Showing 101 - 110 results of 394 for search 'Journal of algorithms.', query time: 0.02s Refine Results
  1. 101

    An in-place sorting with O(nlog n) comparisons and O(n) moves. by Franceschini, Gianni

    Published in Journal of the ACM
    Article

    An in-place sorting with O(nlog n) comparisons and O(n) moves.
  2. 102

    Asymmetric k-center is log* n-hard to approximate. by Chuzhoy, Julia

    Published in Journal of the ACM
    Article

    Asymmetric k-center is log* n-hard to approximate.
  3. 103

    Boosting textual compression in optimal linear time. by Ferragina, Paolo

    Published in Journal of the ACM
    Article

    Boosting textual compression in optimal linear time.
  4. 104

    Edge-disjoint routing in plane switch graphs in linear time. by Hochstein, J.M

    Published in Journal of the ACM
    Article

    Edge-disjoint routing in plane switch graphs in linear time.
  5. 105

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. by Jerrum, Mark

    Published in Journal of the ACM
    Article

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
  6. 106

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

    Published in Journal of the ACM
    Article

    An optimality proof of the LRU-K page replacement algorithm.
  7. 107

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

    Published in Journal of the ACM
    Article

    Complexity estimates depending on condition and round-off error.
  8. 108

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

    Published in Journal of the ACM
    Article

    Implementing sequentially consistent shared objects using broadcast and point-to-point communication.
  9. 109

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

    Published in Journal of the ACM
    Article

    Probabilistic checking of proofs a new characterization of NP.
  10. 110

    Explicit OR-dispersers with polylogarithmic degree. by Saks, Michael

    Published in Journal of the ACM
    Article

    Explicit OR-dispersers with polylogarithmic degree.

Search Tools: