Showing 1 - 7 results of 7 for search '"Computations on discrete structures."', सवाल का समय: 0.02सेकंड परिणाम को परिष्कृत करें
  1. 1

    A new general derandomization method. द्वारा Andreev, Alexander E.

    में प्रकाशित Journal of the ACM
    लेख

    A new general derandomization method.
  2. 2

    Time-work tradeoffs for parallel algorithms. द्वारा Spencer, Thomas H.

    में प्रकाशित Journal of the ACM
    लेख

    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
    लेख

    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
    लेख

    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
    लेख

    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
    लेख

    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
    लेख

    A unified approach to approximating resource allocation and scheduling.

खोज साधन: