摘要:
springer.com
mpg.de
acm.org 
sci-hub.se 参考文章(66)
Y. C. Kan, S. M. Ross, OPTIMAL LIST ORDER UNDER PARTIAL MEMORY CONSTRAINTS Journal of Applied Probability. ,vol. 17, pp. 1004- 1015 ,(1980) , 10.1017/S0021900200097291
R. Cole, On the dynamic finger conjecture for splay trees symposium on the theory of computing. pp. 8- 17 ,(1990) , 10.1145/100216.100218
Daniel D. Sleator, Robert E. Tarjan, Amortized efficiency of list update and paging rules Communications of The ACM. ,vol. 28, pp. 202- 208 ,(1985) , 10.1145/2786.2793
E. J. Anderson, P. Nash, R. R. Weber, A counterexample to a conjecture on optimal list ordering Journal of Applied Probability. ,vol. 19, pp. 730- 732 ,(1982) , 10.1017/S002190020003727X
James R. Bitner, Heuristics That Dynamically Organize Data Structures SIAM Journal on Computing. ,vol. 8, pp. 82- 110 ,(1979) , 10.1137/0208007
Jim Bell, Gopal Gupta, An evaluation of self-adjusting binary search tree techniques Software - Practice and Experience. ,vol. 23, pp. 369- 382 ,(1993) , 10.1002/SPE.4380230403
D. W. Jones, Application of splay trees to data compression Communications of The ACM. ,vol. 31, pp. 996- 1007 ,(1988) , 10.1145/63030.63036
S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson, On the power of randomization in on-line algorithms Algorithmica. ,vol. 11, pp. 2- 14 ,(1994) , 10.1007/BF01294260
Sandy Irani, Two results on the list update problem Information Processing Letters. ,vol. 38, pp. 301- 306 ,(1991) , 10.1016/0020-0190(91)90086-W
Aaron M. Tenenbaum, Richard M. Nemes, Two Spectra of Self-Organizing Sequential Search Algorithms SIAM Journal on Computing. ,vol. 11, pp. 557- 566 ,(1982) , 10.1137/0211046