Author:
Hon Wing-Kai,Lam Tak-Wah,Shah Rahul,Tam Siu-Lung,Vitter Jeffrey Scott
Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. L. Arge, G.S. Brodal, R. Fagerberg, M. Laustsen, Cache-oblivious planar orthogonal range searching and counting, in: Proceedings of ACM Symposium on Computational Geometry, 2005, pp. 160–169.
2. The input/output complexity of sorting and related problems;Aggarwal;Communications of the ACM,1988
3. Text indexing and dictionary matching with one error;Amir;Journal of Algorithms,2000
4. Dynamic text and static pattern matching;Amir;ACM Transactions on Algorithms,2007
5. Lowest common ancestors in trees and directed acyclic graphs;Bender;Journal of Algorithms,2005
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predecessor Search;ACM Computing Surveys;2020-10-15
2. Cache-Oblivious B-Tree;Encyclopedia of Algorithms;2016
3. Cache-Oblivious B-Tree;Encyclopedia of Algorithms;2015
4. I/O-Efficient Dictionary Search with One Edit Error;String Processing and Information Retrieval;2014
5. AML: Efficient Approximate Membership Localization within a Web-Based Join Framework;IEEE Transactions on Knowledge and Data Engineering;2013-02