Отображение 921 - 930 результаты of 1,827 для поиска '"Algorithm."', время запроса: 0.02сек. Отмена результатов
  1. 921

    An optimality proof of the LRU-K page replacement algorithm. по O'Neil, Elizabeth J.

    Опубликовано в: Journal of the ACM
    Статья

    An optimality proof of the LRU-K page replacement algorithm.
  2. 922

    Complexity estimates depending on condition and round-off error. по Cucker, Felipe

    Опубликовано в: Journal of the ACM
    Статья

    Complexity estimates depending on condition and round-off error.
  3. 923

    Implementing sequentially consistent shared objects using broadcast and point-to-point communication. по Fekete, Alan

    Опубликовано в: Journal of the ACM
    Статья

    Implementing sequentially consistent shared objects using broadcast and point-to-point communication.
  4. 924

    Probabilistic checking of proofs a new characterization of NP. по Arora, Sanjeev

    Опубликовано в: Journal of the ACM
    Статья

    Probabilistic checking of proofs a new characterization of NP.
  5. 925

    Explicit OR-dispersers with polylogarithmic degree. по Saks, Michael

    Опубликовано в: Journal of the ACM
    Статья

    Explicit OR-dispersers with polylogarithmic degree.
  6. 926

    A new general derandomization method. по Andreev, Alexander E.

    Опубликовано в: Journal of the ACM
    Статья

    A new general derandomization method.
  7. 927

    Contention in shared memory algorithms. по Dwork, Cynthia

    Опубликовано в: Journal of the ACM
    Статья

    Contention in shared memory algorithms.
  8. 928

    Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP. по Hemaspaandra, Edith

    Опубликовано в: Journal of the ACM
    Статья

    Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP.
  9. 929

    Software reliability via run-time result-checking. по Wasserman, Hal

    Опубликовано в: Journal of the ACM
    Статья

    Software reliability via run-time result-checking.
  10. 930

    Sparsification-a technique for speeding up dynamic graph algorithms. по Eppstein, David

    Опубликовано в: Journal of the ACM
    Статья

    Sparsification-a technique for speeding up dynamic graph algorithms.

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