Author:
Bose Presenjit,Douïeb Karim,Iacono John,Langerman Stefan
Publisher
Springer International Publishing
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. John Wiley (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
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Combining Binary Search Trees;Automata, Languages, and Programming;2013
2. In Pursuit of the Dynamic Optimality Conjecture;Lecture Notes in Computer Science;2013