Paging with request sets
From MaRDI portal
Publication:2272199
DOI10.1007/S00224-007-9029-2zbMATH Open1192.68823OpenAlexW2142949082MaRDI QIDQ2272199FDOQ2272199
Authors: Leah Epstein, Rob van Stee, Tami Tamir
Publication date: 6 August 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9029-2
Recommendations
Cites Work
- Title not available (Why is that?)
- Competitive snoopy caching
- Competitive analysis of randomized paging algorithms
- Competitive algorithms for server problems
- Competitive paging algorithms
- An optimal on-line algorithm for metrical task system
- A strongly competitive randomized paging algorithm
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- On-line vertex-covering
- Title not available (Why is that?)
- Competitive algorithms for the weighted server problem
Cited In (7)
This page was built for publication: Paging with request sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272199)