Memory paging for connectivity and path problems in graphs
- 1 January 1993
- book chapter
- Published by Springer Nature
- Vol. 2 (2) , 416-425
- https://doi.org/10.1007/3-540-57568-5_273
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Competitive k-server algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Competitive paging algorithmsJournal of Algorithms, 1991
- An Optimal On-Line Algorithm for K Servers on TreesSIAM Journal on Computing, 1991
- The harmonic online K-server algorithm is competitivePublished by Association for Computing Machinery (ACM) ,1991
- Competitive paging with locality of referencePublished by Association for Computing Machinery (ACM) ,1991
- Competitive snoopy cachingAlgorithmica, 1988
- Competitive algorithms for on-line problemsPublished by Association for Computing Machinery (ACM) ,1988
- Virtual memory algorithmsPublished by Association for Computing Machinery (ACM) ,1988
- An optimal online algorithm for metrical task systemsPublished by Association for Computing Machinery (ACM) ,1987
- A model for hierarchical memoryPublished by Association for Computing Machinery (ACM) ,1987