String Searching
String Searching is a fundamental algorithmic problem in computer science that involves locating one or more occurrences of a pattern string within a larger text string according to specified matching criteria.
655
Publications
50.4K
Citations
1.1K
Authors
495
Institutions
Publications per year
2017–2026
52
Parents
655
Fast Pattern Matching in Strings
Donald E. Knuth, James H. Morris, Vaughan Pratt · SIAM Journal on Computing · 1977 · 2.9K citations
Alfred V. Aho, Margaret J. Corasick · Communications of the ACM · 1975 · 2.9K citations · Full text
A fast string searching algorithm
Robert S. Boyer, J Strother Moore · Communications of the ACM · 1977 · 2.3K citations · Full text
Suffix Arrays: A New Method for On-Line String Searches
Udi Manber, Gene Myers · SIAM Journal on Computing · 1993 · 2K citations
Linear pattern matching algorithms
Peter Weiner · 1973 · 1.8K citations
1–5 of 655
1.1K
20
h-index
17
h-index
17
h-index
15
h-index
14
h-index
1–5 of 1.1K
495
University of Chile
Santiago, Chile
24 h-index
36 publications
2.9K citations

University of Waterloo
Waterloo, Canada
20 h-index
35 publications
3K citations

Tel Aviv University
Tel Aviv, Israel
17 h-index
25 publications
2.2K citations

University of Helsinki
Helsinki, Finland
17 h-index
26 publications
1.8K citations

University of Pisa
Pisa, Italy
13 h-index
16 publications
1.1K citations

Bar-Ilan University
Ramat Gan, Israel
12 h-index
43 publications
2.1K citations
Purdue University West Lafayette
West Lafayette, United States
12 h-index
18 publications
1.2K citations
Columbia University
New York, United States
11 h-index
20 publications
1.3K citations
1–8 of 495
34 publications · 7.3K citations
27
h-index
26 publications · 2.2K citations
22
h-index
23 publications · 696 citations
18
h-index
27 publications · 1.5K citations
17
h-index
21 publications · 1.5K citations
17
h-index
1–5