Showing 7,871 - 7,880 results of 8,437 for search '"Problems."', זמן שאילתה: 0.05s Refine Results
  1. 7871

    A new general derandomization method. מאת Andreev, Alexander E.

    הוצא לאור ב Journal of the ACM
    Article

    A new general derandomization method.
  2. 7872

    Contention in shared memory algorithms. מאת Dwork, Cynthia

    הוצא לאור ב Journal of the ACM
    Article

    Contention in shared memory algorithms.
  3. 7873

    Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP. מאת Hemaspaandra, Edith

    הוצא לאור ב Journal of the ACM
    Article

    Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP.
  4. 7874

    Software reliability via run-time result-checking. מאת Wasserman, Hal

    הוצא לאור ב Journal of the ACM
    Article

    Software reliability via run-time result-checking.
  5. 7875

    Sparsification-a technique for speeding up dynamic graph algorithms. מאת Eppstein, David

    הוצא לאור ב Journal of the ACM
    Article

    Sparsification-a technique for speeding up dynamic graph algorithms.
  6. 7876

    How much can hardware help routing?. מאת Borodin, Allan

    הוצא לאור ב Journal of the ACM
    Article

    How much can hardware help routing?.
  7. 7877

    Time-work tradeoffs for parallel algorithms. מאת Spencer, Thomas H.

    הוצא לאור ב Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  8. 7878

    Polynomial-time data reduction for dominating set. מאת Alber, Jochen

    הוצא לאור ב Journal of the ACM
    Article

    Polynomial-time data reduction for dominating set.
  9. 7879

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time. מאת Spielman, Daniel A.

    הוצא לאור ב Journal of the ACM
    Article

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time.
  10. 7880

    Lower bounds on the bounded coefficient complexity of bilinear maps. מאת Bürgisser, Peter

    הוצא לאור ב Journal of the ACM
    Article

    Lower bounds on the bounded coefficient complexity of bilinear maps.

כלי חיפוש: