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

Authors

227

  1. ZG
    Zvi Galil

    Tel Aviv University, Israel

    10 publications · 412 citations

    10

    h-index

  2. DB
    Dany Breslauer

    Danish National Research Foundation, Denmark

    6 publications · 206 citations

    6

    h-index

  3. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    4 publications · 476 citations

    4

    h-index

  4. GM
    Gad M. Landau

    University of Haifa, Israel

    4 publications · 503 citations

    4

    h-index

  5. JT
    Jorma Tarhio

    University of Helsinki, Finland

    4 publications · 183 citations

    4

    h-index

1–5 of 227

Venues

  1. SIAM Journal on Computing

    6 publications · 225 citations

    6

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 285 citations

    5

    h-index

  3. Information Processing Letters

    3 publications · 62 citations

    3

    h-index

  4. Bioinformatics

    3 publications · 55 citations

    3

    h-index

  5. ACM Journal of Experimental Algorithmics

    JEA · 3 publications · 264 citations

    3

    h-index

1–5