Mostrando 1 - 7 Resultados de 7 Para Buscar '"Computations on discrete structures."', tiempo de consulta: 0.02s Limitar resultados
  1. 1

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

    Publicado en Journal of the ACM
    Artículo

    A new general derandomization method.
  2. 2

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

    Publicado en Journal of the ACM
    Artículo

    Time-work tradeoffs for parallel algorithms.
  3. 3

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

    Publicado en Journal of the ACM
    Artículo

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

    Publicado en Journal of the ACM
    Artículo

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

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

    Publicado en Journal of the ACM
    Artículo

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

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

    Publicado en Journal of the ACM
    Artículo

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

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

    Publicado en Journal of the ACM
    Artículo

    A unified approach to approximating resource allocation and scheduling.

Herramientas de búsqueda: