Author:
Franceschini Gianni,Grossi Roberto
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious b-trees. In Proc. 41st Symposium on Foundations of Computer Science, pages 399–409, 2000.
2. Michael A. Bender, Richard Cole, and Rajeev Raman. Exponential structures for efficient cache-oblivious algorithms. Lecture Notes in Computer Science, 2380:195–207, 2002.
3. Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual Symposium On Discrete Mathematics, pages 29–38, 2002.
4. Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob. Cache-oblivious search trees via trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39–48, 2002.
5. Andrej Brodnik and J. Ian Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627–1640, 1999.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献