Amortized efficiency of list update and paging rules
Communications of the ACM
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Simulations of dynamic sequential search algorithms
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
Data Types and Structures
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Two Results on Self-organizing Data Structures
Two Results on Self-organizing Data Structures
Heuristics that dynamically alter data structures to reduce their access time.
Heuristics that dynamically alter data structures to reduce their access time.
ACM Computing Surveys (CSUR)
Self-organizing sequential search and Hilbert's inequalities
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Self-organizing search lists using probabilistic back-pointers
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Randomized competitive algorithms for the list update problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science
On list update and work function algorithms
Theoretical Computer Science
Optimal Projective Algorithms for the List Update Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Two New Families of List Update Algorithms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Offline List Update is NP-Hard
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the Competitiveness of Linear Search
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Managing routing tables for URL routers in content distribution networks
International Journal of Network Management
The CNN problem and other k-server variants
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Least-recently-used caching with dependent requests
Theoretical Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM Transactions on Software Engineering and Methodology (TOSEM)
Algorithms and theory of computation handbook
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
SIAM Journal on Computing
List update with probabilistic locality of reference
Information Processing Letters
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Performance of the move-to-front algorithm with Markov-modulated request sequences
Operations Research Letters
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Online and offline access to short lists
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Paging and list update under bijective analysis
Journal of the ACM (JACM)
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.04 |
The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilistically. In this article, we use amortization to analyze the heuristics in a worst-case sense; the relative merit of the heuristics in this analysis is different in the probabilistic analyses. Experiments show that the behavior of the heuristics on real data is more closely described by the amortized analyses than by the probabilistic analyses.