Author of the publication

On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching.

, , and . CPM, volume 54 of LIPIcs, page 26:1-26:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching., , and . CPM, volume 54 of LIPIcs, page 26:1-26:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Practical Performance of Space Efficient Data Structures for Longest Common Extensions., , , , and . ESA, volume 173 of LIPIcs, page 39:1-39:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Scalable Construction of Text Indexes with Thrill., , and . IEEE BigData, page 634-643. IEEE, (2018)Dismantling DivSufSort., and . Stringology, page 62-76. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2017)Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory., , and . ALENEX, page 214-228. SIAM, (2020)Faster Wavelet Trees with Quad Vectors., , and . CoRR, (2023)Parallel text index construction.. Technical University of Dortmund, Germany, (2020)Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors.. SPIRE, volume 13617 of Lecture Notes in Computer Science, page 257-272. Springer, (2022)Parallel External Memory Wavelet Tree and Wavelet Matrix Construction., and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 392-406. Springer, (2019)Fast and Simple Parallel Wavelet Tree and Matrix Construction., and . CoRR, (2017)