A Survey of Algorithms and Models for List Update
From MaRDI portal
Publication:2848979
DOI10.1007/978-3-642-40273-9_17zbMATH Open1395.68342OpenAlexW119445844MaRDI QIDQ2848979FDOQ2848979
Authors: Shahin Kamali, Alejandro Lopez-Ortiz 
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_17
Recommendations
- Analysis and experimentation on list update algorithms
- Off-line algorithms for the list update problem
- A new perspective on list update: probabilistic locality and working set
- Revisiting the COUNTER algorithms for list update
- Randomized competitive algorithms for the list update problem
- Improved Randomized On-Line Algorithms for the List Update Problem
- scientific article; zbMATH DE number 910898
- A competitive analysis of the list update problem with lookahead
- A competitive analysis of the list update problem with lookahead
Cites Work
- A locally adaptive data compression scheme
- Title not available (Why is that?)
- On the power of randomization in on-line algorithms
- Two results on the list update problem
- Randomized competitive algorithms for the list update problem
- A unified analysis of paging and caching
- Average case analyses of list update algorithms, with applications to data compression
- Competitive paging with locality of reference
- Title not available (Why is that?)
- On the separation and equivalence of paging strategies
- On self-organizing sequential search heuristics
- Title not available (Why is that?)
- List Update with Locality of Reference
- Title not available (Why is that?)
- On paging with locality of reference
- On the competitive theory and practice of online list accessing algorithms
- A new lower bound for the list update problem in the partial cost model
- A combined BIT and TIMESTAMP algorithm for the list update problem
- Off-line algorithms for the list update problem
- The working set model for program behavior
- A new measure for the study of on-line algorithms
- List factoring and relative worst order analysis
- Comparing online algorithms for bin packing problems
- Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
- The relative worst order ratio for online algorithms
- The relative worst-order ratio applied to paging
- Online algorithms: a survey
- Algorithms – ESA 2004
- On the competitiveness of the move-to-front rule
- Title not available (Why is that?)
- On List Update with Locality of Reference
- Optimal strategies for the list update problem under the MRM alternative cost model
- Improved Randomized On-Line Algorithms for the List Update Problem
- On Serial Files with Relocatable Records
- Paging and list update under bijective analysis
- Strongly Competitive Algorithms for Paging with Locality of Reference
- Separating online scheduling algorithms with the relative worst order ratio
- Algorithm Theory - SWAT 2004
- LRU is better than FIFO
- A lower bound for randomized list update algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online and Offline Access to Short Lists
Cited In (19)
- On list update and work function algorithms.
- Improved Randomized On-Line Algorithms for the List Update Problem
- Title not available (Why is that?)
- On the list update problem with advice
- On list update with locality of reference
- List update with probabilistic locality of reference
- List Update with Locality of Reference
- A combined BIT and TIMESTAMP algorithm for the list update problem
- Title not available (Why is that?)
- Optimal strategies for the list update problem under the MRM alternative cost model
- Paid exchanges are worth the price
- The itinerant list update problem
- Average case analyses of list update algorithms, with applications to data compression
- Off-line algorithms for the list update problem
- Paid exchanges are worth the price
- Lossless image compression using list update algorithms
- On the separation and equivalence of paging strategies and other online algorithms
- Competitive Algorithms for Relaxed List Update and Multilevel Caching
- On List Update with Locality of Reference
This page was built for publication: A Survey of Algorithms and Models for List Update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848979)
