Parallel Substring Search
Parallel Substring Search is a computational method in parallel string processing that identifies all occurrences of a pattern within a text by simultaneously executing multiple search operations across distributed or shared-memory processing units.
29
Publications
1.1K
Citations
55
Authors
46
Institutions
Publications per year
2017–2026
0
Parents
29
Optimal parallel algorithms for string matching
Zvi Galil · Information and Control · 1985 · 95 citations
Scalable parallel suffix array construction
Fabian Kulla, Peter Sanders · Parallel Computing · 2007 · 71 citations
1–5 of 29
55
7
h-index
4
h-index
2
h-index
2
h-index
2
h-index
1–5 of 55
46

Tel Aviv University
Tel Aviv, Israel
6 h-index
7 publications
520 citations
Columbia University
New York, United States
4 h-index
5 publications
152 citations

University of Padua
Padua, Italy
2 h-index
2 publications
86 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
2 publications
158 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
3 publications
127 citations

University of Warsaw
Warsaw, Poland
2 h-index
3 publications
85 citations
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"
Pisa, Italy
1 h-index
1 publications
57 citations
Seoul National University
Seoul, South Korea
1 h-index
1 publications
17 citations
1–8 of 46
2 publications · 42 citations
2
h-index
2 publications · 108 citations
2
h-index
2 publications · 71 citations
2
h-index
Conference · 1 publications · 25 citations
1
h-index
1 publications · 65 citations
1
h-index
1–5