Constant-space string-matching in sublinear average time

Author： Crochemore M. Gasieniec L. Rytter W.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.218, Iss.1, 1999-04, pp. : 197-203

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The zooming method: a recursive approach to time-space efficient string-matching

By Gasieniec L. Plandowski W. Rytter W.

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 19-30

Elsevier

Access to resources Recommend Favorite

On maximal suffixes and constant-space linear-time versions of KMP algorithm

By Rytter W.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 763-774

Elsevier

Access to resources Recommend Favorite

Saving comparisons in the Crochemore-Perrin string-matching algorithm

By Breslauer D.

Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. : 177-192

Elsevier

Access to resources Recommend Favorite

Space-efficient multiple string matching automata

By Zhang Meng Yang Tianyu Wu Rui

International Journal of Wireless and Mobile Computing, Vol. 5, Iss. 3, 2012-07 ,pp. : 308-313

Inderscience Publishers

Access to resources Recommend Favorite

k One-Way Heads Cannot Do String-Matching

By Jiang T. Li M.

Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. : 513-524

Academic Press

Access to resources Recommend Favorite