Title of article
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
Author/Authors
Maxime Crochemore، نويسنده , , Thierry Lecroq، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1997
Pages
9
From page
195
To page
203
Keywords
String matching , analysis of algorithms , computational complexity
Journal title
Information Processing Letters
Serial Year
1997
Journal title
Information Processing Letters
Record number
128740
Link To Document