Back to Results
First PageMeta Content
String matching algorithms / Pattern matching / Regular expression / AWK / Fibonacci number / Knuth–Morris–Pratt algorithm / Approximate string matching / Computing / Computer programming / Software engineering


SIAM J. COMPUT. Vol. 6, No. 2, June 1977 FAST PATTERN MATCHING IN STRINGS* DONALD E. KNUTHf, JAMES H. MORRIS, JR.:l: AND VAUGHAN R. PRATT Abstract. An algorithm is presented which finds all occurrences of one. given stri
Add to Reading List

Document Date: 2005-07-04 12:11:12


Open Document

File Size: 2,97 MB

Share Result on Facebook

City

Palo Alto / Cambridge / /

Company

Xerox / Artificial Intelligence Laboratory / /

Facility

Massachusetts Institute of Technology / Xerox Palo Alto Research Center / University of California / Stanford University / /

IndustryTerm

optimum algorithm / pattern-matching algorithm / above algorithm / naive algorithm / /

Organization

University of California / Berkeley / Massachusetts Institute of Technology / office of Naval Research / National Science Foundation / Stanford University / Computer Science Department / /

Person

JAMES H. MORRIS / JR. / H. MORRIS / JR. / /

Position

author / text-editor / /

ProvinceOrState

California / Massachusetts / /

SportsLeague

Stanford University / /

Technology

above algorithm / naive algorithm / same pattern-matching algorithm / pattern-matching algorithm / optimum algorithm / matching algorithm / previous technology / /

SocialTag