1. Adel’son-Vel’skii, G.M., Landis, E.M.: An algorithm for the organization of information. Soviet. Math. 3, 1259–1262 (1962)
2. Allen, B., Munro, I.: Self-organizing binary search trees. JACM 25(4), 526–535 (1978)
3. Badoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2), 86–96 (2007)
4. Bose, P., Douïeb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: Proc. of the ACM-SIAM Symposium On Discrete Algorithms, pp. 1106–1114 (2008)
5. Lecture Notes in Computer Science;P. Bose,2010