Mostra 41 - 50 risultati di 146 ricerca '"Theory of Computation."', tempo di risposta: 0,03s Raffina i risultati
  1. 41

    Contention in shared memory algorithms. di Dwork, Cynthia

    Pubblicato in Journal of the ACM
    Articolo

    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. di Hemaspaandra, Edith

    Pubblicato in Journal of the ACM
    Articolo

    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. di Wasserman, Hal

    Pubblicato in Journal of the ACM
    Articolo

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

    Compositional refinement of interactive systems. di Broy, Manfred

    Pubblicato in Journal of the ACM
    Articolo

    Compositional refinement of interactive systems.
  5. 45

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

    Sparsification-a technique for speeding up dynamic graph algorithms.
  7. 47

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

    Pubblicato in Journal of the ACM
    Articolo

    How much can hardware help routing?.
  8. 48

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

    Pubblicato in Journal of the ACM
    Articolo

    Time-work tradeoffs for parallel algorithms.
  9. 49

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

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

Strumenti per la ricerca: