Showing 111 - 120 results of 394 for search 'Journal of algorithms.', query time: 0.02s Refine Results
  1. 111

    A new general derandomization method. by Andreev, Alexander E.

    Published in Journal of the ACM
    Article

    A new general derandomization method.
  2. 112

    Contention in shared memory algorithms. by Dwork, Cynthia

    Published in Journal of the ACM
    Article

    Contention in shared memory algorithms.
  3. 113

    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.
  4. 114

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

    Published in Journal of the ACM
    Article

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

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

    Learning to reason. by Khardon, Roni

    Published in Journal of the ACM
    Article

    Learning to reason.
  7. 117

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

    Published in Journal of the ACM
    Article

    How much can hardware help routing?.
  8. 118

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

    Published in Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  9. 119

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

    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: