Erakusten 1 - 7 emaitzak -- 7 bilaketa honetara '"Computations on discrete structures."', Bilaketaren denbora: 0,02s Findu emaitzak
  1. 1

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

    Argitaratua izan da Journal of the ACM
    Artikulua

    A new general derandomization method.
  2. 2

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

    Argitaratua izan da Journal of the ACM
    Artikulua

    Time-work tradeoffs for parallel algorithms.
  3. 3

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

    Argitaratua izan da Journal of the ACM
    Artikulua

    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. nork Iwata, Satoru

    Argitaratua izan da Journal of the ACM
    Artikulua

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

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

    Argitaratua izan da Journal of the ACM
    Artikulua

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

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

    Argitaratua izan da Journal of the ACM
    Artikulua

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

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

    Argitaratua izan da Journal of the ACM
    Artikulua

    A unified approach to approximating resource allocation and scheduling.

Bilaketa egiteko lanabesak: