|
6
|
Optimal Parallel Dictionary Matching and Compression (Extended Abstract)
– Martin Farach, S. Muthukrishnan
- 1995
|
|
1
|
The architecture of a software library for string processing
– A. Czumaj, P. Ferragina, L. Gasieniec, S. Muthukrishnan, J. L. Träff
- 1997
|
|
14
|
Optimal Logarithmic Time Randomized Suffix Tree Construction
– Martin Farach, S. Muthukrishnan
- 1996
|
|
|
Practical Amortized Dynamic Indexing
– Amihood Amir, Noa Lewenstein, Alejandro A. Schäffer
|
|
14
|
Suffix Trees and their Applications in String Algorithms
– Roberto Grossi, Giuseppe F. Italiano
- 1993
|
|
1
|
Dictionary Automaton in Optimal Space
– Stefan Edelkamp
- 1999
|
|
23
|
Cache-Oblivious String B-trees
– Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul
- 2006
|
|
|
Suffix Trees for Integer Alphabets Revisited
– Dong Kyue Kim , Jeong Seop Sim, Kunsoo Park
- 1999
|
|
4
|
Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract)
– Doug Kyue Kim, Kim Kunsoo Park
- 1999
|
|
16
|
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
– Stephen Alstrup, Jacob Holm
- 2000
|
|
1
|
Lower Bound Techniques for Data Structures
– Mihai Patrascu
- 2008
|
|
8
|
Efficient String Algorithmics
– Dany Breslauer
- 1992
|
|
|
Using Learning and Difficulty of Prediction to Decrease Computation: A Fast Sort and Priority Queue on Entropy Bounded Inputs ∗
– Shenfeng Chen, John H. Reif
|
|
2
|
Random Suffix Search Trees
– Luc Devroye, Ralph Neininger
- 2003
|
|
11
|
Alphabet Independent And Dictionary Scaled Matching
– Amihood Amir, Gruia Calinescu
- 1996
|
|
1
|
The Euler Path to Static Level-Ancestors
– Amir M. Ben-amram
- 2007
|
|
31
|
The Level Ancestor Problem Simplified
– Michael A. Bender, Martin Farach-Colton
|
|
32
|
Succinct ordinal trees with level-ancestor queries
– Richard F. Geary, Rajeev Raman
- 2004
|
|
6
|
Hash and displace: Efficient evaluation of minimal perfect hash functions
– Rasmus Pagh
- 1999
|
