Parallel String Matching
Parallel String Matching is a computational method in parallel algorithms that identifies all occurrences of a pattern within a text simultaneously by leveraging multiple processing units to perform substring comparisons in concert, thereby accelerating the search process relative to sequential execution.
100
Publications
4.2K
Citations
227
Authors
97
Institutions
Publications per year
2017–2026
5
Parents
100
Deep packet inspection using parallel bloom filters
Sarang Dharmapurikar, P. Krishnamurthy, Todd Sproull et al. · IEEE Micro · 2004 · 435 citations
Fast parallel and serial approximate string matching
Gad M. Landau, Uzi Vishkin · Journal of Algorithms · 1989 · 333 citations
Deep packet inspection using parallel Bloom filters
Sarang Dharmapurikar, Praveen Thaggikuppe Krishnamurthy, Todd Sproull et al. · 2004 · 301 citations
1–5 of 100
227
10
h-index
6
h-index
4
h-index
4
h-index
4
h-index
1–5 of 227
97

Tel Aviv University
Tel Aviv, Israel
11 h-index
13 publications
1.3K citations
Columbia University
New York, United States
9 h-index
13 publications
459 citations
National Tsing Hua University
Hsinchu, Taiwan
4 h-index
15 publications
804 citations
Yonsei University
Seoul, South Korea
4 h-index
11 publications
217 citations

University of Eastern Finland
Joensuu, Finland
4 h-index
4 publications
125 citations
Courant Institute of Mathematical Sciences
New York, United States
4 h-index
6 publications
938 citations
IBM (United States)
Armonk, United States
4 h-index
6 publications
208 citations

National Taiwan University
Taipei, Taiwan
3 h-index
5 publications
78 citations
1–8 of 97
6 publications · 225 citations
6
h-index
TPDS · 5 publications · 285 citations
5
h-index
3 publications · 62 citations
3
h-index
3 publications · 55 citations
3
h-index
JEA · 3 publications · 264 citations
3
h-index
1–5