by Dany Breslauer, Dany Breslauer, Livio Colussi, Livio Colussi, Laura Toniolo, Laura Toniolo
In Proc. 2nd European Symposium on Algorithms, number 855 in Lecture Notes in Computer Science
http://www.daimi.aau.dk/BRICS/RS/95/46/BRICS-RS-95-46.ps.gz
Add To MetaCart
Abstract:
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS
Citations
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
377
|
A fast string searching algorithm
– Boyer, Moore
- 1977
|
|
72
|
Speeding up two string matching algorithms
– Crochemore, Czumaj, et al.
- 1994
|
|
40
|
The Boyer–Moore–Galil string searching strategies revisited
– Apostolico, Giancarlo
- 1986
|
|
38
|
alphabet-independent twoDimensional pattern matching,Proc 33 rd IEEE symposium, Foundation of Computer science
– Galil, Park
- 1992
|
|
37
|
Two-way string-matching
– Crochemore, Perrin
- 1991
|
|
34
|
parallel algorithms for string matching
– Galil
- 1985
|
|
31
|
Time-space-optimal string matching
– Galil, Seiferas
- 1983
|
|
23
|
Tight bounds on the complexity of the Boyer–Moore string matching algorithm
– Cole
- 1994
|
|
21
|
An alphabet independent approach to two dimensional pattern matching
– Amir, Benson, et al.
- 1994
|
|
19
|
The exact complexity of string matching: upper bounds
– Galil, Giancarlo
- 1992
|
|
18
|
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
– Cole, Crochemore, et al.
- 1993
|
|
18
|
Tighter lower bounds on the exact complexity of string matching
– Cole, Hariharan, et al.
- 1995
|
|
15
|
Fastest pattern matching in strings
– Colussi
- 1994
|
|
14
|
Tight Comparison Bounds for the String Prefix-Matching Problem
– Breslauer, Colussi, et al.
- 1993
|
|
14
|
On the Exact Complexity of String Matching: Lower Bounds
– Galil, Giancarlo
- 1991
|
|
13
|
Efficient comparison based string matching
– Breslauer, Galil
- 1993
|
|
11
|
Tighter Bounds on the Exact Complexity of String Matching
– Cole, Hariharan
- 1992
|
|
9
|
Correctness and efficiency of string matching algorithms
– Colussi
- 1991
|
|
8
|
Saving comparisons in the Crochemore-Perrin string matching algorithm
– Breslauer
- 1993
|
|
7
|
String-matching on ordered alphabets
– Crochemore
- 1992
|
|
6
|
Periodic Prefixes in Texts
– Crochemore, Rytter
- 1993
|
|
5
|
Fast parallel string prefix-matching
– Breslauer
- 1995
|
|
2
|
Off-line serial exact string searching
– Crochemore
- 1992
|
|
2
|
Optimal parallel prefix matching
– Gasieniec, Park
- 1994
|
