External Memory String Algorithms

External Memory String Algorithms is a class of algorithmic methods designed to efficiently process string data that resides primarily in external memory, distinguished by their optimization of input/output operations between internal and external storage to handle large-scale string matching, pattern searching, and text indexing tasks beyond the capacity of main memory.

21

Publications

631

Citations

37

Authors

31

Institutions

Publications per year

2017–2026

4

Authors

37

  1. DK
    Dominik Kempa

    University of Helsinki, Finland

    5 publications · 100 citations

    5

    h-index

  2. JK
    Juha Kärkkäinen

    University of Helsinki, Finland

    5 publications · 102 citations

    5

    h-index

  3. JS
    Jeffrey Scott Vitter

    Duke University, United States

    3 publications · 208 citations

    3

    h-index

  4. SJ
    Simon J. Puglisi

    University of Helsinki, Finland

    3 publications · 67 citations

    3

    h-index

  5. DE
    Darren Erik Vengroff

    Duke University, United States

    2 publications · 79 citations

    2

    h-index

1–5 of 37

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 45 citations

    2

    h-index

  2. 2

    h-index

  3. ACM Transactions on Information Systems

    2 publications · 65 citations

    2

    h-index

  4. Software Practice and Experience

    1 publications · 11 citations

    1

    h-index

  5. ACM Transactions on Algorithms

    TALG · 1 publications · 12 citations

    1

    h-index

1–5