Memory versus randomization in on-line algorithms

Extended abstract
  • Prabhakar Raghavan
  • Marc Snir
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 372)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Nineteenth Annual ACM Symposium on Theory of Computing, pages 373–382, 1987.Google Scholar
  2. [2]
    A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, May 1989.Google Scholar
  3. [3]
    P. Chew. There exist planar graphs almost as good as the complete graph. 1988. To appear, JCSS.Google Scholar
  4. [4]
    A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. Randomized algorithms for paging problems. 1988. In preparation.Google Scholar
  5. [5]
    A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70–119, 1988.CrossRefGoogle Scholar
  6. [6]
    M.S. Manasse, L.A McGeooch, and D.D. Sleator. Competitive algorithms for online problems. In Twentieth ACM Annual Symposium on Theory of Computing, pages 322–333, 1988.Google Scholar
  7. [7]
    D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, February 1985.CrossRefGoogle Scholar
  8. [8]
    K. So and R.N. Rechtschaffen. Cache operations by MRU change. IEEE Trans. Computers, 37(6):700–709, June 1988.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Prabhakar Raghavan
    • 1
  • Marc Snir
    • 1
  1. 1.IBM Research DivisionT.J.Watson Research CenterYorktown HeightsUSA

Personalised recommendations