Skip to main content
SpringerLink
Log in

Memory paging for connectivity and path problems in graphs

Extended abstract

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

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

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. Aggarwal, B. Alpern, A.K. Chandra and M. Snir, A model for hierarchical memory, Proc. 19th Annual ACM Symposium on Theory of Computing 305–314 (1987).

    Google Scholar 

  2. A. Aggarwal and A.K. Chandra, Virtual memory algorithms, Proc. 20th Annual ACM Symposium on Theory of Computing 173–185 (1988).

    Google Scholar 

  3. A. Borodin, S. Irani, P. Raghavan and B. Schieber, Competitive paging with locality of reference, Proc. 23rd Annual ACM Symp. on Theory of Computing 249–259 (1991).

    Google Scholar 

  4. A. Borodin, N. Linial, and M. Saks, An optimal online algorithm for metrical task systems, Proc. 19th Annual ACM Symposium on Theory of Computing 373–382 (1987).

    Google Scholar 

  5. M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New Results on server problems, Proc. 1st. Annual ACM-SIAM Symp. on Discrete Algorithms 291–300 (1990).

    Google Scholar 

  6. M. Chrobak and L. Larmore, An optimal online algorithm for k servers on trees, SIAM Journal on Computing 20 144–148 (1991).

    Article  Google Scholar 

  7. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator and N.E. Young, Competitive paging algorithms, Journal of Algorithms 12 685–699 (1991).

    Article  Google Scholar 

  8. A. Fiat, Y. Rabani and Y. Ravid, Competitive k-server algorithms, Proc. 31th. Annual Symposium on Foundations of Computer Science 454–463 (1990).

    Google Scholar 

  9. E.F. Grove, The harmonic online k-server algorithm is competitive, Proc. 21th Annual ACM Symposium on Theory of Computing, 260–266, (1991).

    Google Scholar 

  10. M. Nodine, M. Goodrich, J. S. Vitter, Blocking for external graph searching, Tech. Rep. CS-92-44 (1992).

    Google Scholar 

  11. A. Karlin, M. Manasse, L. Rudolph and D. Sleator, Competitive snoopy caching, Algorithmica 3 79–119 (1988).

    MathSciNet  Google Scholar 

  12. M.S. Manasse, L.A. McGeoch and D. Sleator, Competitive algorithms for on-line problems, Proc. 20th ACM Symp. on Theory of Computing 322–333 (1988).

    Google Scholar 

  13. M. Overmars, M. Smid, M. de Berg and M. van Kreveld, Maintaining range trees in secondary memory, part I: partitions, Acta Informatica 27 423–452 (1990).

    Article  Google Scholar 

  14. P. Raghavan and M. Snir, Memory versus randomization in on-line algorithms, IBM Research Report RC 15622 (1990).

    Google Scholar 

  15. D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging algorithms, Comm. ACM 28 202–208 (1985).

    Article  Google Scholar 

  16. M. Smid and P. van Emde Boas, Dynamic data structures on multiple storage media, a tutorial, Technical Report Universitat des Saarlandes a 15/90, (1990).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, I-00198, Roma, Italia

    Esteban Feuerstein & Alberto Marchetti-Spaccamela

Authors
  1. Esteban Feuerstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feuerstein, E., Marchetti-Spaccamela, A. (1993). Memory paging for connectivity and path problems in graphs. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_273

Download citation

  • DOI: https://doi.org/10.1007/3-540-57568-5_273

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57568-9

  • Online ISBN: 978-3-540-48233-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation