A competitive analysis of the list update problem with lookahead
From MaRDI portal
Publication:1128665
DOI10.1016/S0304-3975(97)00026-1zbMath0902.68083MaRDI QIDQ1128665
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (12)
Ignorant vs. Anonymous Recommendations ⋮ Scheduling resource allocation with timeslot penalty for changeover ⋮ On the power of lookahead in online lot-sizing ⋮ Self-adjusting grid networks ⋮ How much is it worth to know the future in online conversion problems? ⋮ On the list update problem with advice ⋮ On the power of lookahead in on-line server routing problems ⋮ Online computation with advice ⋮ On competitive recommendations ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead ⋮ Topology matters: smoothed competitiveness of metrical task systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic location problem for graphs
- A combined BIT and TIMESTAMP algorithm for the list update problem
- A lower bound for randomized list update algorithms
- Online matching with blocked input
- Two results on the list update problem
- The weighted list update problem and the lazy adversary
- On the power of randomization in on-line algorithms
- Randomized competitive algorithms for the list update problem
- A new measure for the study of on-line algorithms
- On the influence of lookahead in competitive paging algorithms
- A locally adaptive data compression scheme
- On self-organizing sequential search heuristics
- Heuristics That Dynamically Organize Data Structures
- On competitive on-line paging with lookahead
- On a model for storage and search
- An extension of a theorem concerning an interesting Markov chain
This page was built for publication: A competitive analysis of the list update problem with lookahead
