Tight bounds on the complexity of the Apostolico-Giancarlo algorithm

Authors:
Maxime Crochemore;Thierry Lecroq
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1997

Citing 0
Cited 3

Research on a faster algorithm for pattern matching

IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
A unifying look at the Apostolico--Giancarlo string-matching algorithm

Journal of Discrete Algorithms
Reversing longest previous factor tables is hard

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Quantified Score

Hi-index	0.89

Visualization

Abstract