Non-Overlapping Indexing - Cache Obliviously
暂无分享,去创建一个
[1] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.
[2] Franco P. Preparata,et al. Data structures and algorithms for the string statistics problem , 1996, Algorithmica.
[3] Alok Aggarwal,et al. The input/output complexity of sorting and related problems , 1988, CACM.
[4] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[5] Moshe Lewenstein,et al. Range Non-overlapping Indexing and Successive List Indexing , 2007, WADS.
[6] Gonzalo Navarro,et al. Sorted Range Reporting , 2012, SWAT.
[7] Gerth Stølting Brodal,et al. Cache-oblivious string dictionaries , 2006, SODA '06.
[8] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.
[9] Michael A. Bender,et al. Cache-oblivious B-trees , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[10] Maxime Crochemore. String-Matching on Ordered Alphabets , 1992, Theor. Comput. Sci..
[11] M. Crochemore,et al. On-line construction of suffix trees , 2002 .