Showing 1 - 7 results of 7 for search '"Computations on discrete structures."', זמן שאילתה: 0.02s Refine Results
  1. 1

    A new general derandomization method. מאת Andreev, Alexander E.

    הוצא לאור ב Journal of the ACM
    Article

    A new general derandomization method.
  2. 2

    Time-work tradeoffs for parallel algorithms. מאת Spencer, Thomas H.

    הוצא לאור ב Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  3. 3

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

    הוצא לאור ב Journal of the ACM
    Article

    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. מאת Iwata, Satoru

    הוצא לאור ב Journal of the ACM
    Article

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

    A new approach to dynamic all pairs shortest paths. מאת Demetrescu, Camil

    הוצא לאור ב Journal of the ACM
    Article

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

    Compact oracles for reachability and approximate distances in planar diagraphs. מאת Thorup, M.

    הוצא לאור ב Journal of the ACM
    Article

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

    A unified approach to approximating resource allocation and scheduling. מאת Bar-Noy, Amotz

    הוצא לאור ב Journal of the ACM
    Article

    A unified approach to approximating resource allocation and scheduling.

כלי חיפוש: