Skip to main content
SpringerLink
Log in

Memory versus randomization in on-line algorithms

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 372))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. P. Chew. There exist planar graphs almost as good as the complete graph. 1988. To appear, JCSS.

    Google Scholar 

  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. A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70–119, 1988.

    Article  Google Scholar 

  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. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, February 1985.

    Article  Google Scholar 

  8. K. So and R.N. Rechtschaffen. Cache operations by MRU change. IEEE Trans. Computers, 37(6):700–709, June 1988.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Division, T.J.Watson Research Center, 10598, Yorktown Heights, NY, USA

    Prabhakar Raghavan & Marc Snir

Authors
  1. Prabhakar Raghavan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Snir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Raghavan, P., Snir, M. (1989). Memory versus randomization in on-line algorithms. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035792

Download citation

  • DOI: https://doi.org/10.1007/BFb0035792

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation