Jewels of stringology
By M. Crochemore, W. Rytter. 2002
331 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/e73a992dc0ba3299ac846aa1575180b2d8f718c8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Steven S. Skiena
- Christopher Alberti
- Pedro J. Moreno Mengibar
- Brenda S. Baker
- Peter Sanders
- Juha Kärkkäinen
- Bryan Perozzi
- William L. Hamilton
In Hardware and Architecture
- Steven S. Skiena
- Christopher Alberti
- Pedro J. Moreno Mengibar
- Brenda S. Baker
- Peter Sanders
- Juha Kärkkäinen
- William F. Smyth
- Andrew Turpin
Citations in the corpus
- The Algorithm Design Manual (2020, methodology): “• Crochemore and Rytter [CR03] – A survey of specialized topics in string algorithmics emphasizing theory.”
- Linear work suffix array construction (2006, background): “This is evident, for example, in textbooks, including recent ones [Crochemore and Rytter 2002; Smyth 2003].”
- Finding Clones with Dup: Analysis of an Experiment (2007, background): “Dup finds either maximal exact matches over a threshold length or maximal parameterized matches over a threshold 1.”
- A factor automaton approach for the forced alignment of long speech recordings (2009, methodology): “In this paper we introduce a new technique to address this data mining problem.”
- Extracting Powers and Periods in a String from Its Runs Structure (2010, methodology): “Recall that the border array can be computed in O(n) time, as in the Morris-Pratt algorithm [5].”