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
Parents
21
1–5 of 21
37
5
h-index
5
h-index
3
h-index
3
h-index
2
h-index
1–5 of 37
31

University of Helsinki
Helsinki, Finland
6 h-index
11 publications
197 citations
Helsinki Institute for Information Technology
Espoo, Finland
3 h-index
7 publications
181 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
3 h-index
7 publications
261 citations

Sun Yat-sen University
Guangzhou, China
2 h-index
5 publications
156 citations
Duke University
Durham, United States
2 h-index
2 publications
174 citations
Universidade de São Paulo
São Paulo, Brazil
2 h-index
3 publications
79 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
2 h-index
2 publications
59 citations

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
79 citations
1–8 of 31
JEA · 2 publications · 45 citations
2
h-index
Repository · 2 publications · 74 citations
2
h-index
2 publications · 65 citations
2
h-index
1 publications · 11 citations
1
h-index
TALG · 1 publications · 12 citations
1
h-index
1–5