Complexity of Sequential Pattern Matching Algorithms

Mireille Régnier, Wojciech Szpankowski. Complexity of Sequential Pattern Matching Algorithms. In Michael Luby, José D. P. Rolim, Maria J. Serna, editors, Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM 98, Barcelona, Spain, October 8-10, 1998, Proceedings. Volume 1518 of Lecture Notes in Computer Science, pages 187-199, Springer, 1998. [doi]

Abstract

Abstract is missing.