1. Adel'son-Vel'skii, G.M., Landis, E.M.: An algorithm for the organisation of information. Doklady Akadamii Nauk SSSR. 146, 263–266 (1962) In Russian. English translation in Soviet Math. Doklady, 3, 1259-1263 (1962)
2. Andersson, A., Fagerberg, R., Larsen, K.S.: Balanced binary search trees. In: Dinesh P. Mehta, Sartaj Sahni (eds.), Handbook of Data Structures and Applications, Chapman & Hall/CRC Computer & Information Science Series, pp. 10–1–10–28. CRC Press (2005)
3. Dietz, P.F., Raman, R.: Persistence, amortization and randomization. In: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp 78–88, (1991)
4. Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences 38, 86–124 (1989)
5. Huddleston, S., Mehlhorn, K.: A new data structure for representing sorted lists. Acta Informatica 17, 157–184 (1982)