Advertisement

Memory paging for connectivity and path problems in graphs

Extended abstract
  • Esteban Feuerstein
  • Alberto Marchetti-Spaccamela
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 762)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 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. 6.
    M. Chrobak and L. Larmore, An optimal online algorithm for k servers on trees, SIAM Journal on Computing 20 144–148 (1991).CrossRefGoogle Scholar
  7. 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).CrossRefGoogle Scholar
  8. 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. 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. 10.
    M. Nodine, M. Goodrich, J. S. Vitter, Blocking for external graph searching, Tech. Rep. CS-92-44 (1992).Google Scholar
  11. 11.
    A. Karlin, M. Manasse, L. Rudolph and D. Sleator, Competitive snoopy caching, Algorithmica 3 79–119 (1988).MathSciNetGoogle Scholar
  12. 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. 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).CrossRefGoogle Scholar
  14. 14.
    P. Raghavan and M. Snir, Memory versus randomization in on-line algorithms, IBM Research Report RC 15622 (1990).Google Scholar
  15. 15.
    D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging algorithms, Comm. ACM 28 202–208 (1985).CrossRefGoogle Scholar
  16. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Esteban Feuerstein
    • 1
  • Alberto Marchetti-Spaccamela
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItalia

Personalised recommendations