Prikaz rezultata 111 – 120 od 394 za pretragu 'Journal of algorithms.', vrijeme upita: 0,01s Detaljiziraj rezultate
  1. 111

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

    Članak

    A new general derandomization method.
  2. 112

    Contention in shared memory algorithms. od Dwork, Cynthia

    Članak

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

    Članak

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

    Članak

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

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

    Članak

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

    Learning to reason. od Khardon, Roni

    Članak

    Learning to reason.
  7. 117

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

    Članak

    How much can hardware help routing?.
  8. 118

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

    Članak

    Time-work tradeoffs for parallel algorithms.
  9. 119

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

    Članak

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

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

    Članak

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

Alati za pretragu: