| Publication | Date of Publication | Type |
|---|
| The dynamic \(k\)-mismatch problem | 2024-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092429 | 2022-07-21 | Paper |
| Upper and Lower Bounds for Dynamic Data Structures on Strings | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5204820 | 2019-12-05 | Paper |
| The streaming k-mismatch problem | 2019-10-15 | Paper |
| Tight Cell-Probe Bounds for Online Hamming Distance Computation | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633890 | 2019-05-06 | Paper |
| Dynamic and approximate pattern matching in 2D | 2018-10-17 | Paper |
| The k-mismatch problem revisited | 2018-07-16 | Paper |
| The Classical Complexity of Boson Sampling | 2018-03-15 | Paper |
| Cell-Probe Lower Bounds for Bit Stream Computation | 2018-03-02 | Paper |
| Approximate Hamming Distance in a Stream | 2017-12-19 | Paper |
| Permuted function matching | 2017-11-03 | Paper |
| A filtering algorithm for \(k\)-mismatch with don't cares | 2017-11-03 | Paper |
| Cell-probe bounds for online edit distance and other pattern matching problems | 2017-10-05 | Paper |
| The Classical Complexity of Boson Sampling | 2017-06-05 | Paper |
| Dictionary Matching in a Stream | 2015-11-19 | Paper |
| Space lower bounds for online pattern matching | 2014-01-09 | Paper |
| Pattern Matching under Polynomial Transformation | 2013-07-24 | Paper |
| Maximum subset intersection | 2013-03-28 | Paper |
| NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES | 2013-02-21 | Paper |
| The complexity of flood filling games | 2012-12-06 | Paper |
| Pattern Matching in Multiple Streams | 2012-08-14 | Paper |
| Mismatch sampling | 2012-05-24 | Paper |
| Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model | 2011-07-06 | Paper |
| Space Lower Bounds for Online Pattern Matching | 2011-06-29 | Paper |
| Restricted Common Superstring and Restricted Common Supersequence | 2011-06-29 | Paper |
| Pattern matching in pseudo real-time | 2011-05-03 | Paper |
| A black box for online approximate pattern matching | 2011-04-28 | Paper |
| Pseudo-realtime Pattern Matching: Closing the Gap | 2010-07-26 | Paper |
| Distributed and Paged Suffix Trees for Large Genetic Databases | 2010-04-06 | Paper |
| Pattern matching with don't cares and few errors | 2010-02-12 | Paper |
| Simple deterministic wildcard matching | 2010-01-29 | Paper |
| Scheduling algorithms for procrastinators | 2009-08-28 | Paper |
| Algorithms on Extended (δ, γ)-Matching | 2009-02-10 | Paper |
| k-Mismatch with Don’t Cares | 2008-09-25 | Paper |
| Self-normalised Distance with Don’t Cares | 2008-06-17 | Paper |
| A Black Box for Online Approximate Pattern Matching | 2008-06-17 | Paper |
| Fast Approximate Point Set Matching for Information Retrieval | 2008-03-07 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Distributed suffix trees | 2005-10-27 | Paper |
| Approximate string matching for music analysis | 2005-04-04 | Paper |
