On-Line File Caching
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Classical paging and Landlord-style file caching assume placement-independent object costs.
“Classical paging [20] and Landlord-style file caching [21] assume placement-independent object costs”
From PrefixPlace: Provable Prefix Key-Value Placement for Large Language Model Serving under Heterogeneous Compute and Transfer Costs (2026) · cites this paper as [21]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., & Young, N. E. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90041-v · Cited by 457 · see citing works
Self-citationA strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238 · see citing works
Flagged first, then by citations
Research works printed but not linked: 18
- [1][1] Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , El Paso, Texas, 4-6 May 1997. -
- [2][2] Allan Borodin, Sandy Irani, Prabhakar Raghavan, and Baruch Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences , 50(2):244-258, April 1995. -
- [3][3] Pei Cao and Sandy Irani. Cost-aware WWW proxy caching algorithms. In USENIX Symposium on Internet Technologies and Systems , December 1997. -
- [4][4] Marek Chrobak, Howard Karloff, T.H. Payne, and Sundar Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics , 4(2):172-181, May 1991. -
- [5][5] Amos Fiat and Anna R. Karlin. Randomized and multipointer paging with locality of reference. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing , pages 626-634, Las Vegas, Nevada, 29 May-1 June 1995. -
- [7][7] Amos Fiat and Ziv Rosen. Experimental studies of access graph based heuristics: Beating the LRU standard? In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages 63-72, New Orleans, Louisiana, 5-7 January 1997. -
- [8][8] IEEE. 35th Annual Symposium on Foundations of Computer Science , Santa Fe, New Mexico, 20-22 November 1994. -
- [9][9] Sandy Irani. Page replacement with multi-size pages and applications to Web caching. In ACM [1], pages 701-710. -
- [10][10] Sandy Irani, Anna R. Karlin, and Steven Phillips. Strongly competitive algorithms for paging with locality of reference. SIAM Journal on Computing , 25(3):477-497, June 1996. -
- [11][11] David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In ACM [1], pages 654-663. -
- [12][12] Anna R. Karlin, Steven J. Phillips, and Prabhakar Raghavan. Markov paging (extended abstract). In 33rd Annual Symposium on Foundations of Computer Science , pages 208-217, Pittsburgh, Pennsylvania, 24-27 October 1992. IEEE. -
- [13][13] Elias Koutsoupias and Christos H. Papadimitriou. Beyond competitive analysis. In 35th Annual Symposium on Foundations of Computer Science [8], pages 394-400. -
- [14][14] Carsten Lund, Steven Phillips, and Nick Reingold. IP over connectionoriented networks and distributional paging. In 35th Annual Symposium on Foundations of Computer Science [8], pages 424-434. -
- [15][15] Mark S. Manasse, Lyle A. McGeoch, and Daniel D. Sleator. Competitive algorithms for server problems. Journal of Algorithms , 11:208-230, 1990. -
- [17][17] Daniel D. Sleator and Robert E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM , 28(2):202-208, February 1985. -
- [18][18] Neal E. Young. Competitive paging and dual-guided algorithms for weighted caching and matching. (Thesis) Tech. Rep. CS-TR-348-91, Computer Science Department, Princeton University, October 1991. -
- [19][19] Neal E. Young. On-line caching as cache size varies. In Proc. of the Second Annual ACM-SIAM Symposium on Discrete Algorithms , pages 241-250, 1991. -
- [20][20] Neal E. Young. The k -server dual and loose competitiveness for paging. Algorithmica , 11(6):525-541, June 1994.
Cited by
Sorted by citations
- Authors
- Young, N. E.
- Affiliations
- Akamai (United States) (US)
- Corresponding author
- Young, N. E.
- ORCID
- Young, N. E.
- Venue
- Algorithmica
- Published
- 2002-01-01
- Volume
- 33
- Issue
- 3
- Pages
- 371-383
- ISSN
- 0178-4617 (ISSN-L)
- OpenAlex
- W3125910951
- Cited by
- 105
- References
- 2
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 4 · 2023: 3 · 2022: 2 · 2021: 1 · 2020: 5 · 2019: 4 · 2018: 6 · 2017: 3 · 2016: 5 · 2015: 4 · 2014: 3 · 2013: 4 · 2012: 2
- FWCI
- 5.30
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Algorithmica (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- eScholarship (California Digital Library) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (9720664)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Optimization and Search Problems
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Keywords
- paging, competitive ratio, LRU, FIFO, cache size, retrieval cost, web caching
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
