Toon 21 - 30 resultaten van 85 Voor zoekopdracht '"Analysis of Algorithms and Problem Complexity."', zoektijd: 0,02s Verfijn jouw resultaten
  1. 21

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

    Gepubliceerd in Journal of the ACM
    Artikel

    A new general derandomization method.
  2. 22

    Contention in shared memory algorithms. door Dwork, Cynthia

    Gepubliceerd in Journal of the ACM
    Artikel

    Contention in shared memory algorithms.
  3. 23

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

    Gepubliceerd in Journal of the ACM
    Artikel

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

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

    Gepubliceerd in Journal of the ACM
    Artikel

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

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

    Gepubliceerd in Journal of the ACM
    Artikel

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

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

    Gepubliceerd in Journal of the ACM
    Artikel

    How much can hardware help routing?.
  7. 27

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

    Gepubliceerd in Journal of the ACM
    Artikel

    Time-work tradeoffs for parallel algorithms.
  8. 28

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

    Gepubliceerd in Journal of the ACM
    Artikel

    Polynomial-time data reduction for dominating set.
  9. 29

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

    Gepubliceerd in Journal of the ACM
    Artikel

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

    Lower bounds on the bounded coefficient complexity of bilinear maps. door Bürgisser, Peter

    Gepubliceerd in Journal of the ACM
    Artikel

    Lower bounds on the bounded coefficient complexity of bilinear maps.

Zoekinstrumenten: