A mostrar 1 - 7 resultados de 7 para a pesquisa '"Computations on discrete structures."', tempo de pesquisa: 0.02seg Refinar resultados
  1. 1

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

    Publicado no Journal of the ACM
    Artigo

    A new general derandomization method.
  2. 2

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

    Publicado no Journal of the ACM
    Artigo

    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 no Journal of the ACM
    Artigo

    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 no Journal of the ACM
    Artigo

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

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

    Publicado no Journal of the ACM
    Artigo

    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 no Journal of the ACM
    Artigo

    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 no Journal of the ACM
    Artigo

    A unified approach to approximating resource allocation and scheduling.

Ferramentas de pesquisa: