The list update problem and the retrieval of sets
From MaRDI portal
Publication:1331955
DOI10.1016/0304-3975(94)00010-7zbMath0822.68026OpenAlexW1966999110MaRDI QIDQ1331955
Fabrizio d'Amore, Vincenzo Liberatore
Publication date: 18 October 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00010-7
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- A lower bound for randomized list update algorithms
- Competitive snoopy caching
- Two results on the list update problem
- The weighted list update problem and the lazy adversary
- Off-line algorithms for the list update problem
- An Optimal On-Line Algorithm for K Servers on Trees
- Competitive algorithms for server problems
- Amortized Computational Complexity
- Self-adjusting binary search trees
- The list update problem and the retrieval of sets
This page was built for publication: The list update problem and the retrieval of sets