1 - 7 toradh á dtaispeáint as 7 toradh san iomlán ar an gcuardach '"Computations on discrete structures."', am iarratais: 0.02s Beachtaigh na torthaí
  1. 1

    A new general derandomization method. de réir Andreev, Alexander E.

    Foilsithe in Journal of the ACM
    Alt

    A new general derandomization method.
  2. 2

    Time-work tradeoffs for parallel algorithms. de réir Spencer, Thomas H.

    Foilsithe in Journal of the ACM
    Alt

    Time-work tradeoffs for parallel algorithms.
  3. 3

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

    Foilsithe in Journal of the ACM
    Alt

    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. de réir Iwata, Satoru

    Foilsithe in Journal of the ACM
    Alt

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

    A new approach to dynamic all pairs shortest paths. de réir Demetrescu, Camil

    Foilsithe in Journal of the ACM
    Alt

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

    Compact oracles for reachability and approximate distances in planar diagraphs. de réir Thorup, M.

    Foilsithe in Journal of the ACM
    Alt

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

    A unified approach to approximating resource allocation and scheduling. de réir Bar-Noy, Amotz

    Foilsithe in Journal of the ACM
    Alt

    A unified approach to approximating resource allocation and scheduling.

Uirlisí cuardaigh: