Visas 1 - 7 av 7 resultat för sökning '"Computations on discrete structures."', Sökningstid: 0,02s Förfina resultatet
  1. 1

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

    I publikationen Journal of the ACM
    Artikel

    A new general derandomization method.
  2. 2

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

    I publikationen 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. av Holm, Jacob

    I publikationen 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. av Iwata, Satoru

    I publikationen 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. av Demetrescu, Camil

    I publikationen 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. av Thorup, M.

    I publikationen 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. av Bar-Noy, Amotz

    I publikationen Journal of the ACM
    Artikel

    A unified approach to approximating resource allocation and scheduling.

Sökverktyg: