Toon 1 - 7 resultaten van 7 Voor zoekopdracht '"Computations on discrete structures."', zoektijd: 0,02s Verfijn jouw resultaten
  1. 1

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

    Gepubliceerd in Journal of the ACM
    Artikel

    A new general derandomization method.
  2. 2

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

    Gepubliceerd in Journal of the ACM
    Artikel

    Time-work tradeoffs for parallel algorithms.
  3. 3

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. door Holm, Jacob

    Gepubliceerd in Journal of the ACM
    Artikel

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
  4. 4

    A combinatorial strongly polynomial algorithm for minimizing submodular functions. door Iwata, Satoru

    Gepubliceerd in Journal of the ACM
    Artikel

    A combinatorial strongly polynomial algorithm for minimizing submodular functions.
  5. 5

    A new approach to dynamic all pairs shortest paths. door Demetrescu, Camil

    Gepubliceerd in Journal of the ACM
    Artikel

    A new approach to dynamic all pairs shortest paths.
  6. 6

    Compact oracles for reachability and approximate distances in planar diagraphs. door Thorup, M.

    Gepubliceerd in Journal of the ACM
    Artikel

    Compact oracles for reachability and approximate distances in planar diagraphs.
  7. 7

    A unified approach to approximating resource allocation and scheduling. door Bar-Noy, Amotz

    Gepubliceerd in Journal of the ACM
    Artikel

    A unified approach to approximating resource allocation and scheduling.

Zoekinstrumenten: