Author:
Bose Prosenjit,Douïeb Karim
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Informatica 1(3), 173–189 (1972)
2. Becker, P.: A new algorithm for the construction of optimal B-trees. Nordic Journal of Computing 1, 389–401 (1994)
3. Lecture Notes in Computer Science;P. Becker,1997
4. Bent, S., Sleator, D., Tarjan, R.: Biased 2-3 trees. In: Annual Symposium on Foundations of Computer Science, pp. 248–254 (1980)
5. Bent, S., Sleator, D., Tarjan, R.: Biased search trees. SIAM J. Comput. 14(3), 545–568 (1985)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Operations research applications of dichotomous search;European Journal of Operational Research;2018-03
2. Twenty (simple) questions;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
3. Performance of Routing Lookups;Advances in Computing and Information Technology;2011
4. Should Static Search Trees Ever Be Unbalanced?;Algorithms and Computation;2010
5. Reflections on Optimal and Nearly Optimal Binary Search Trees;Lecture Notes in Computer Science;2009