Showing 8,621 - 8,630 results of 9,877 for search '"Theory"', query time: 0.05s Refine Results
  1. 8621

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

    Published in Journal of the ACM
    Article

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

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

    Published in Journal of the ACM
    Article

    Software reliability via run-time result-checking.
  3. 8623

    Compositional refinement of interactive systems. by Broy, Manfred

    Published in Journal of the ACM
    Article

    Compositional refinement of interactive systems.
  4. 8624

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

    Published in Journal of the ACM
    Article

    Applications of a logic of knowledge to motion planning under uncertainty.
  5. 8625

    Sparsification-a technique for speeding up dynamic graph algorithms. by Eppstein, David

    Published in Journal of the ACM
    Article

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

    Learning to reason. by Khardon, Roni

    Published in Journal of the ACM
    Article

    Learning to reason.
  7. 8627

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

    Published in Journal of the ACM
    Article

    How much can hardware help routing?.
  8. 8628

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

    Published in Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  9. 8629

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

    Published in Journal of the ACM
    Article

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

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

    Published in Journal of the ACM
    Article

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

Search Tools: