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

Authors

55

  1. ZG
    Zvi Galil

    Tel Aviv University, Israel

    7 publications · 323 citations

    7

    h-index

  2. DB
    Dany Breslauer

    Danish National Research Foundation, Denmark

    4 publications · 152 citations

    4

    h-index

  3. CS
    Costas S. Iliopoulos

    King's College London, United Kingdom

    2 publications · 37 citations

    2

    h-index

  4. GM
    Gad M. Landau

    University of Haifa, Israel

    2 publications · 158 citations

    2

    h-index

  5. JT
    Jorma Tarhio

    University of Helsinki, Finland

    2 publications · 37 citations

    2

    h-index

1–5 of 55

Venues

  1. Software Practice and Experience

    2 publications · 42 citations

    2

    h-index

  2. Theoretical Computer Science

    2 publications · 108 citations

    2

    h-index

  3. Algorithmica

    2 publications · 71 citations

    2

    h-index

  4. Proceedings of the International Conference on Parallel Processing

    Conference · 1 publications · 25 citations

    1

    h-index

  5. 1

    h-index

1–5