Showing 41 - 50 results of 146 for search '"Theory of Computation."', 查詢時間: 0.02s Refine Results
  1. 41

    Contention in shared memory algorithms. 由 Dwork, Cynthia

    發表在 Journal of the ACM
    Article

    Contention in shared memory algorithms.
  2. 42

    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.
  3. 43

    Software reliability via run-time result-checking. 由 Wasserman, Hal

    發表在 Journal of the ACM
    Article

    Software reliability via run-time result-checking.
  4. 44

    Compositional refinement of interactive systems. 由 Broy, Manfred

    發表在 Journal of the ACM
    Article

    Compositional refinement of interactive systems.
  5. 45

    Applications of a logic of knowledge to motion planning under uncertainty. 由 Brafman, Ronen I.

    發表在 Journal of the ACM
    Article

    Applications of a logic of knowledge to motion planning under uncertainty.
  6. 46

    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.
  7. 47

    How much can hardware help routing?. 由 Borodin, Allan

    發表在 Journal of the ACM
    Article

    How much can hardware help routing?.
  8. 48

    Time-work tradeoffs for parallel algorithms. 由 Spencer, Thomas H.

    發表在 Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  9. 49

    Polynomial-time data reduction for dominating set. 由 Alber, Jochen

    發表在 Journal of the ACM
    Article

    Polynomial-time data reduction for dominating set.
  10. 50

    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.

檢索工具: