Toon 8.631 - 8.640 resultaten van 9.883 Voor zoekopdracht '"Theory."', zoektijd: 0,05s Verfijn jouw resultaten
  1. 8631

    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.
  2. 8632

    Learning to reason. door Khardon, Roni

    Gepubliceerd in Journal of the ACM
    Artikel

    Learning to reason.
  3. 8633

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

    Gepubliceerd in Journal of the ACM
    Artikel

    How much can hardware help routing?.
  4. 8634

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

    Gepubliceerd in Journal of the ACM
    Artikel

    Time-work tradeoffs for parallel algorithms.
  5. 8635

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

    Gepubliceerd in Journal of the ACM
    Artikel

    Polynomial-time data reduction for dominating set.
  6. 8636

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

    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.
  8. 8638

    Satisfiability of word equations with constants is in PSPACE. door Plandowski, Wojciech

    Gepubliceerd in Journal of the ACM
    Artikel

    Satisfiability of word equations with constants is in PSPACE.
  9. 8639

    On clusterings good, bad and spectral. door Kannan, Ravi

    Gepubliceerd in Journal of the ACM
    Artikel

    On clusterings good, bad and spectral.
  10. 8640

    Optimal Time Bounds for Approximate Clustering. door Mettu, Ramgopal R.

    Gepubliceerd in Machine learning.
    Artikel

    Optimal Time Bounds for Approximate Clustering.

Zoekinstrumenten: