Mostra 1 - 7 risultati di 7 ricerca '"Computations on discrete structures."', tempo di risposta: 0,02s Raffina i risultati
  1. 1

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

    Pubblicato in Journal of the ACM
    Articolo

    A new general derandomization method.
  2. 2

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

    Pubblicato in Journal of the ACM
    Articolo

    Time-work tradeoffs for parallel algorithms.
  3. 3

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

    Pubblicato in Journal of the ACM
    Articolo

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

    A unified approach to approximating resource allocation and scheduling.

Strumenti per la ricerca: