Отображение 1 - 7 результаты of 7 для поиска '"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.

Инструменты поиска: