Author:
Bender Michael A.,Farach-Colton Martín
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lect Notes Comput Sci;S. Alstrup,2000
2. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 399–409, 2000.
3. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In LATIN, pages 88–94, 2000.
4. O. Berkman and U. Vishkin. Recursive *-tree parallel data-structure. In Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 196–202, 1989.
5. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM J. Comput., 22(2):221–242, Apr. 1993.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献