Randomized competitive algorithms for the list update problem
From MaRDI portal
Recommendations
Cites work
- A locally adaptive data compression scheme
- An Account of Self-Organizing Systems
- An optimal on-line algorithm for metrical task system
- Competitive paging algorithms
- Competitive snoopy caching
- scientific article; zbMATH DE number 432763 (Why is no real title available?)
- scientific article; zbMATH DE number 432777 (Why is no real title available?)
- scientific article; zbMATH DE number 432826 (Why is no real title available?)
- scientific article; zbMATH DE number 3782281 (Why is no real title available?)
- scientific article; zbMATH DE number 15120 (Why is no real title available?)
- scientific article; zbMATH DE number 65694 (Why is no real title available?)
- scientific article; zbMATH DE number 65703 (Why is no real title available?)
- Off-line algorithms for the list update problem
- On a model for storage and search
- On fast algorithms for two servers
- On self-organizing sequential search heuristics
- On Serial Files with Relocatable Records
- Page Migration Algorithms Using Work Functions
- Random walks on weighted graphs and applications to on-line algorithms
- Two results on the list update problem
Cited in
(43)- A competitive analysis of the list update problem with lookahead
- Two results on the list update problem
- The weighted list update problem and the lazy adversary
- Randomized online interval scheduling
- A parallel list update problem
- Off-line algorithms for the list update problem
- Average case analyses of list update algorithms, with applications to data compression
- On the competitiveness of the move-to-front rule
- A manifesto for the computational method
- Randomized competitive analysis for two server problems
- Comparison-based buffer management in QoS switches
- Delayed information and action in on-line algorithms
- List factoring and relative worst order analysis
- Paid exchanges are worth the price
- Parameterized analysis of paging and list update algorithms
- On list update with locality of reference
- A Survey of Algorithms and Models for List Update
- Revisiting the COUNTER algorithms for list update
- Advice complexity and barely random algorithms
- A randomized algorithm for online scheduling with interval conflicts
- Randomized Competitive Analysis for Two-Server Problems
- Competitive algorithms for the weighted list update problem
- List update with probabilistic locality of reference
- Improved Randomized On-Line Algorithms for the List Update Problem
- Verified analysis of list update algorithms
- scientific article; zbMATH DE number 910898 (Why is no real title available?)
- The list update problem and the retrieval of sets
- Advice complexity and barely random algorithms
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- List Update with Locality of Reference
- Semi-online scheduling with decreasing job sizes
- A new lower bound for the list update problem in the partial cost model
- An optimal online algorithm for scheduling two machines with release times
- Self-adjusting grid networks
- Self-adjusting linear networks
- On the separation and equivalence of paging strategies and other online algorithms
- A combined BIT and TIMESTAMP algorithm for the list update problem
- A lower bound for randomized list update algorithms
- List update with delays or time windows
- Randomized algorithms for fully online multiprocessor scheduling with testing
- A 3.3904-competitive online algorithm for list update with uniform costs
- Randomized distributed online algorithms against adaptive offline adversaries
- A new family of randomized algorithms for list accessing
This page was built for publication: Randomized competitive algorithms for the list update problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312185)