1. An algorithm for the organization of information;Adelʼson-Velʼskii;Soviet Math. Dokl.,1962
2. A unified access bound on comparison-based dynamic dictionaries;Bădoiu;Theoret. Comput. Sci.,2007
3. Prosenjit Bose, Karim Douïeb, Stefan Langerman, Dynamic optimality for skip lists and B-trees, in: SODA ʼ08: Proceedings of the 19th Annual ACM–SIAM Symposium on Discrete Algorithms, 2008, pp. 1106–1114.
4. Layered working-set trees;Bose,2010
5. A data structure for a sequence of string accesses in external memory;Ciriani;ACM Trans. Algorithms,2007