Author:
Bose Prosenjit,Douïeb Karim,Morin Pat
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Aragon, C.R., Seidel, R.: Randomized search trees. Algorithmica 16, 464–497 (1996)
2. Bagchi, A., Buchsbaum, A.L., Goodrich, M.T.: Biased skip lists. Algorithmica 42(1), 31–48 (2005)
3. Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informatica 1, 173–189 (1972)
4. Bent, S.W., Sleator, D., Tarjan, R.: Biased search trees. SIAM Journal on Computing 14(3), 545–568 (1985)
5. Bose, P., Douïeb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 1106–1114 (2008)