Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On self-organizing sequential search heuristics
Communications of the ACM
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)
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Two New Families of List Update Algorithms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
| Hi-index | 0.00 |
In this paper we describe a general technique which can be used to solve an old problem in analyzing self-organizing sequential search. We prove that the average time required for the move-to-front heuristic is no more than &pgr;/2 times that of the optimal order and this bound is best possible. Hilbert's inequalities will be used to derive large classes of inequalities some of which can be applied to obtain tight worst-case bounds for several self-organizing heuristics.