Author:
Demaine Erik D.,Iacono John,Langerman Stefan
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference5 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
2. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, pp. 383–391 (1996)
3. Ferragina, P., Grossi, R.: The string b-tree: a new data structure for string search in external memory and its applications. J. ACM 46(2), 236–280 (1999)
4. Gil, J., Itai, A.: How to pack trees. J. Algorithms 32(2), 108–132 (1999)
5. Nodine, M.H., Goodrich, M.T., Vitter, J.S.: Blocking for external graph searching. Algorithmica 16(2), 181–214 (1996)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Belga B-Trees;Theory of Computing Systems;2020-06-27
2. Belga B-Trees;Computer Science – Theory and Applications;2019
3. Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts;Lecture Notes in Computer Science;2019