| Publication | Date of Publication | Type |
|---|
| Compressed indexing for consecutive occurrences | 2024-10-21 | Paper |
| Streaming regular expression membership and pattern matching | 2024-07-19 | Paper |
| An improved algorithm for the \(k\)-Dyck edit distance problem | 2024-07-19 | Paper |
| Sorting signed permutations by reversals in nearly-linear time | 2024-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062160 | 2023-10-31 | Paper |
| Pattern matching under DTW distance | 2023-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874289 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874453 | 2023-02-07 | Paper |
| Approximating Longest Common Substring with k mismatches: Theory and Practice | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875566 | 2023-02-03 | Paper |
| Streaming Dictionary Matching with Mismatches | 2022-07-18 | Paper |
| Quasi-Periodicity in Streams | 2022-07-18 | Paper |
| Streaming dictionary matching with mismatches | 2022-03-22 | Paper |
| Fast entropy-bounded string dictionary look-up with mismatches | 2021-08-04 | Paper |
| All non-trivial variants of 3-LDT are equivalent | 2021-01-19 | Paper |
| Upper and lower bounds for dynamic data structures on strings | 2020-08-05 | Paper |
| Communication and Streaming Complexity of Approximate Pattern Matching | 2020-05-25 | Paper |
| Streaming \(k\)-mismatch with error correcting and applications | 2020-03-12 | Paper |
| Lower bounds for text indexing with mismatches and differences | 2019-10-15 | Paper |
| Correction to: ``Longest common substring with approximately \(k\) mismatches | 2019-05-21 | Paper |
| Longest common substring with approximately \(k\) mismatches | 2019-05-17 | Paper |
| Dynamic and approximate pattern matching in 2D | 2018-10-17 | Paper |
| The \(k\)-mismatch problem revisited | 2018-07-16 | Paper |
| Improved bounds for testing Dyck languages | 2018-03-15 | Paper |
| Approximate Hamming distance in a stream | 2017-12-19 | Paper |
| Longest common substring with approximately \(k\) mismatches | 2017-10-17 | Paper |
| Wavelet trees meet suffix trees | 2017-10-05 | Paper |
| Computing minimal and maximal suffixes of a substring | 2016-06-16 | Paper |
| Dictionary matching in a stream | 2015-11-19 | Paper |
| Computing the Longest Unbordered Substring | 2015-10-02 | Paper |
| A suffix tree or not a suffix tree? | 2015-09-15 | Paper |
| On maximal unbordered factors | 2015-08-20 | Paper |
| A suffix tree or not a suffix tree? | 2015-05-04 | Paper |
| Sublinear space algorithms for the longest common substring problem | 2014-10-08 | Paper |
| Cross-document pattern matching | 2014-08-13 | Paper |
| Computing minimal and maximal suffixes of a substring revisited | 2014-06-30 | Paper |
| Minimal Discriminating Words Problem Revisited | 2013-10-29 | Paper |
| Time-space trade-offs for the longest common substring problem | 2013-06-14 | Paper |
| On minimal and maximal suffixes of a substring | 2013-06-14 | Paper |
| Computing discriminating and generic words | 2013-04-08 | Paper |
| Computing Lempel-Ziv factorization online | 2012-09-25 | Paper |
| Cross-document pattern matching | 2012-08-14 | Paper |
| Computing the longest common substring with one mismatch | 2012-03-13 | Paper |
| Computing Longest Common Substrings Via Suffix Arrays | 2008-06-05 | Paper |
