Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees-Reference-Cited by-同舟云学术

Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees

Published:2003 Issue: Volume: Page:114-126
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Franceschini Gianni,Grossi Roberto

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45078-8_11

Reference20 articles.

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

2. Arge, L., Vitter, J.S.: Optimal dynamic interval management in external memory. In: IEEE (ed.) 37th Annual Symposium on Foundations of Computer Science. Burlington, Vermontl, USA, October 14-16, pp. 560–569. IEEE Computer Society Press, Los Alamitos (1996)

3. Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: IEEE (ed.) 41st Annual Symposium on Foundations of Computer Science: proceedings: Redondo Beach, California, USA, 12-14 November, pp. 399–409. IEEE Computer Society Press, Los Alamitos (2000)

4. Lecture Notes in Computer Science;M.A. Bender,2002

5. Brodal, G.S., Fagerberg, R., Jacob, R.: Cache-oblivious search trees via trees of small height. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 39–48 (2002)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cache-Oblivious B-Tree;Encyclopedia of Algorithms;2016

2. Cache-Oblivious B-Tree;Encyclopedia of Algorithms;2015

3. Succinct and Implicit Data Structures for Computational Geometry;Lecture Notes in Computer Science;2013

4. A Survey on Priority Queues;Lecture Notes in Computer Science;2013

5. A distribution-sensitive dictionary with low space overhead;Journal of Discrete Algorithms;2012-01