Streaming String Algorithms is a computational paradigm within string algorithms that processes input strings sequentially in a single pass or a few passes with sublinear memory usage, distinguishing it from classical algorithms by its emphasis on efficiency under data stream constraints.
6
Publications
222
Citations
16
Authors
8
Institutions
Publications per year
2017–2026
1
Parents
Publications
6
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Martin Herbordt, Josh Model, Yongfeng Gu et al. · 2006 · 69 citations
Real-Time Streaming String-Matching
Dany Breslauer, Zvi Galil · ACM Transactions on Algorithms · 2014 · 22 citations
LZ-End Parsing in Compressed Space
Dominik Kempa, Dmitry Kosolobov · 2017 · 20 citations · Full text
1–5 of 6
Authors
16
- TV
1
h-index
- DK
1
h-index
- MH
1
h-index
- MG
1
h-index
- JM
1
h-index
1–5 of 16
Institutions
8
University of Helsinki
Helsinki, Finland
1 h-index
2 publications
40 citations
Charles University
Prague, Czechia
1 h-index
2 publications
128 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
1 h-index
2 publications
38 citations
Humboldt-Universität zu Berlin
Berlin, Germany
1 h-index
1 publications
19 citations
Indian Institute of Technology Kanpur
Kanpur, India
1 h-index
1 publications
64 citations
University of Haifa
Haifa, Israel
1 h-index
1 publications
22 citations
Boston University
Boston, United States
1 h-index
5 publications
345 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
22 citations
1–8 of 8
Venues
- Journal of the ACM
JACM · 1 publications · 19 citations
1
h-index
- Journal Of Big Data
1 publications · 28 citations
1
h-index
- ACM Transactions on Algorithms
TALG · 1 publications · 22 citations
1
h-index
1–3