Amortized efficiency of list update and paging rules
Communications of the ACM
ACM Computing Surveys (CSUR)
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On self-organizing sequential search heuristics
Communications of the ACM
| Hi-index | 0.00 |
The linear list is one of basic data structures in computer science with search being a primary operation defined on it. Items are located in the list by sequentially examining them from the beginning of the list. Intuitively one would like to place items that are frequently requested at the front of the list in order to minimize the number of items being examined. Given the properties of the request sequence one could place items in an order that minimizes the search cost. Yet often properties of the request sequence are either not known in advance or time dependent. Hence, it is desirable to employ self-organizing algorithms. The two best known such rules are the move-to-front and transposition rule [9, Section 6]. In addition to being simple these rules are memory-free, i.e., require no memory for their operation.