Bilaketaren emaitzak - "Computations on discrete structures."

  • Erakusten 1 - 7 emaitzak -- 7
Findu emaitzak
  1. 1

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

    Argitaratua izan da Journal of the ACM
    Artikulua


    Azala
  2. 2

    A combinatorial strongly polynomial algorithm for minimizing submodular functions. nork Iwata, Satoru

    Argitaratua izan da Journal of the ACM
    Artikulua


    Azala
  3. 3

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

    Argitaratua izan da Journal of the ACM
    Artikulua


    Azala
  4. 4

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

    Argitaratua izan da Journal of the ACM
    Artikulua


    Azala
  5. 5

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

    Argitaratua izan da Journal of the ACM
    Artikulua


    Azala
  6. 6

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

    Argitaratua izan da Journal of the ACM
    Artikulua


    Azala
  7. 7

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

    Argitaratua izan da Journal of the ACM
    Artikulua


    Azala

Bilaketa egiteko lanabesak: