Self-organizing lists and independent references: A statistical synergy

Bellow, 1987, An investigation of self-organizing heuristics for doubly-linked lists, 64 Bentley, 1985, Amortized analyses of self-organizing sequential search heuristics, Comm. ACM, 28, 404, 10.1145/3341.3349 Bitner, 1979, Heuristics that dynamically organize data structures, SIAM J. Comput., 8, 82, 10.1137/0208007 Burville, 1973, On a model for storage and search, J. Appl. Probab., 10, 697, 10.2307/3212792 Gibbons, 1977, Selecting the one best category for the multinomial distribution, 158 Gibbons, 1977, Selecting the one best category for the multinomial distribution, 443 Hendricks, 1976, An account of self-organizing systems, SIAM J. Comput., 5, 715, 10.1137/0205050 Hester, 1985, Self-organizing linear search, ACM Comput. Surveys, 17, 295, 10.1145/5505.5507 Hofri, 1991, On the Optimality of the Counter Scheme for Dynamic Linear Lists, 37, 175 Knuth, 1973, A “self-organizing” file, 398 Lam, 1981, A generalized counter scheme, Theoret. Comput. Sci., 16, 271, 10.1016/0304-3975(81)90098-0 McCabe, 1965, On serial files with relocatable records, Oper. Res., 13, 609, 10.1287/opre.13.4.609 Oommen, 1987, List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations, SIAM J. Comput., 16, 705, 10.1137/0216047 Oommen, 1987, Deterministic move-to-rear list organizing strategies with optimal and expedient properties, 54 Rivest, 1976, On self-organizing sequential search heuristics, Comm. ACM, 19, 63, 10.1145/359997.360000 Sleator, 1985, Amortized efficiency of list update and paging rules, Comm. ACM, 28, 202, 10.1145/2786.2793 Topkis, 1986, Reordering heuristics for routing in communication networks, J. Appl. Probab., 23, 130, 10.2307/3214122