Online String Algorithms

Online String Algorithms is a class of string processing algorithms that belong to the broader category of online algorithms, distinguished by their ability to process input strings sequentially in a left-to-right manner without requiring prior knowledge of the entire string, producing output incrementally as each character is read.

11

Publications

292

Citations

35

Authors

18

Institutions

Publications per year

2017–2026

3

Authors

35

  1. ZG
    Zvi Galil

    Tel Aviv University, Israel

    3 publications · 86 citations

    3

    h-index

  2. AM
    Arseny M. Shur

    Ural Federal University, Russia

    1 publications · 12 citations

    1

    h-index

  3. PS
    Panu Somervuo

    University of Helsinki, Finland

    1 publications · 28 citations

    1

    h-index

  4. LC
    Livio Colussi

    University of Padua, Italy

    1 publications · 33 citations

    1

    h-index

  5. RH
    R. Hariharan

    Princeton University, United States

    1 publications · 19 citations

    1

    h-index

1–5 of 35

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 27 citations

    2

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 29 citations

    1

    h-index

  3. Scientific Reports

    1 publications · 25 citations

    1

    h-index

  4. Neural Networks

    1 publications · 28 citations

    1

    h-index

  5. ACM Transactions on Algorithms

    TALG · 1 publications · 22 citations

    1

    h-index

1–5