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.
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
ACM Computing Surveys (CSUR)
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 48.22 |
In [3], R.L. Rivest presents a set of methods for dynamically reordering a sequential list containing N records in order to increase search efficiency. The method Ai (for i between 1 and N) performs the following operation each time that a record R has been successfully retrieved: Move R forward i positions in the list, or to the front of the list if it was in a position less than i. The method A1 is called the transposition method, and the method AN-1 is called the move-to-front method.