1. Randomized search trees;Aragon;Algorithmica,1996
2. Biased skip lists;Bagchi;Algorithmica,2005
3. Organization and maintenance of large ordered indexes;Bayer;Acta Informatica,1972
4. Biased search trees;Bent;SIAM Journal on Computing,1985
5. P. Bose, K. Douïeb, S. Langerman, Dynamic optimality for skip lists and B-trees, in: Proceedings of the Nineteenth Annual ACM–SIAM Symposium on Discrete Algorithms (SODAʼ08), 2008, pp. 1106–1114.