Author:
Bose Prosenjit,Fagerberg Rolf,Howat John,Morin Pat
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM, 54(3):Article 13 (2007)
2. Bădoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2), 86–96 (2007)
3. Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65(1), 38–72 (2002)
4. Belazzougui, D., Kaporis, A.C., Spirakis,P.G.: Random input helps searching predecessors. arXiv:1104.4353 (2011)
5. Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased search trees. SIAM J. Comput. 14(3), 545–568 (1985)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predecessor Search;ACM Computing Surveys;2020-10-15