Näytetään 1 - 7 yhteensä 7 tuloksesta haulle '"Computations on discrete structures."', hakuaika: 0,02s Tarkenna hakua
  1. 1

    A new general derandomization method. Tekijä Andreev, Alexander E.

    Julkaisussa Journal of the ACM
    Artikkeli

    A new general derandomization method.
  2. 2

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

    Julkaisussa Journal of the ACM
    Artikkeli

    Time-work tradeoffs for parallel algorithms.
  3. 3

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

    Julkaisussa Journal of the ACM
    Artikkeli

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

    Julkaisussa Journal of the ACM
    Artikkeli

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

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

    Julkaisussa Journal of the ACM
    Artikkeli

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

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

    Julkaisussa Journal of the ACM
    Artikkeli

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

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

    Julkaisussa Journal of the ACM
    Artikkeli

    A unified approach to approximating resource allocation and scheduling.

Työkalut: