1. G.M. Adel’son-Vel’skii and E M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3 (1962), 1259–1263.
2. Samuel W. Bent, Daniel D. Sleator and Robert E. Tarjan. Biased search trees. SIAM Journal on Computing 14 (1985), 545–568.
3. Jon L. Bentley and Robert Sedgewick. Fast algorithms for sorting and searching strings. In Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (1997), 360–369.
4. Gerth Stølting Brodal. Finger search trees with constant insertion time. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (1998), 540–549.
5. Mark R. Brown and Robert E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal on Computing 9 (1980), 594–614.