Author:
Bose Prosenjit,Douïeb Karim,Iacono John,Langerman Stefan
Funder
Division of Computing and Communication Foundations
Fonds De La Recherche Scientifique - FNRS
Fulbright Commission
Center for Massive Data Algorithmics
Canadian Network for Research and Innovation in Machining Technology
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Adelson-Velskij, G.M., Landis, E.M.: An algorithm for the organization of information. Doklady Akademii Nauk USSR 146(2), 263–266 (1962)
2. Alon, N., Spencer, J.: The Probabilistic Method. Wiley, London (1992)
3. Aragon, C.R., Seidel, R.: Randomized search trees. In: FOCS, pp. 540–545. IEEE Computer Society (1989)
4. Bender, M.A., Duan, Z., Iacono, J., Jing, W.: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2), 115–136 (2004)
5. Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: Govindarajan, R., Padua, D.A., Hall, M.W. (eds.) PPOPP, pp. 257–268. ACM (2010)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Competitive Online Search Trees on Trees;ACM Transactions on Algorithms;2023-06-24
2. Pinning Down the Strong Wilber-1 Bound for Binary Search Trees;Theory of Computing;2023
3. Belga B-Trees;Theory of Computing Systems;2020-06-27
4. Belga B-Trees;Computer Science – Theory and Applications;2019