| Publication | Date of Publication | Type |
|---|
| String factorization via prefix free families | 2024-10-21 | Paper |
| An improved algorithm for the \(k\)-Dyck edit distance problem | 2024-07-19 | Paper |
| Partial permutations comparison, maintenance and applications | 2024-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084405 | 2023-10-31 | Paper |
| Incremental Edge Orientation in Forests | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874443 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875567 | 2023-02-03 | Paper |
| Support optimality and adaptive cuckoo filters | 2022-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009597 | 2021-08-04 | Paper |
| Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams | 2021-07-28 | Paper |
| AnO(log3/2n) Parallel Time Population Protocol for Majority withO(logn) States | 2021-03-15 | Paper |
| Locally Consistent Parsing for Text Indexing in Small Space | 2021-02-02 | Paper |
| Approximating text-to-pattern Hamming distances | 2021-01-19 | Paper |
| Quasi-Periodicity Under Mismatch Errors | 2020-12-16 | Paper |
| Online recognition of dictionary with one gap | 2020-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136259 | 2020-11-25 | Paper |
| Real-Time Streaming Multi-Pattern Search for Constant Alphabet | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110892 | 2020-05-25 | Paper |
| Dynamic dictionary matching in the online model | 2020-01-16 | Paper |
| A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance | 2019-10-25 | Paper |
| The streaming k-mismatch problem | 2019-10-15 | Paper |
| Approximate cover of strings | 2019-10-07 | Paper |
| Mind the gap! | 2019-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743471 | 2019-05-10 | Paper |
| Streaming pattern matching with \(d\) wildcards | 2019-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633890 | 2019-05-06 | Paper |
| Worst-case Optimal Join Algorithms | 2018-12-06 | Paper |
| For-All Sparse Recovery in Near-Optimal Time | 2018-11-05 | Paper |
| Higher Lower Bounds from the 3SUM Conjecture | 2018-07-16 | Paper |
| The k-mismatch problem revisited | 2018-07-16 | Paper |
| Simultaneously load balancing for every p-norm, with reassignments | 2018-05-03 | Paper |
| Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap | 2018-04-19 | Paper |
| New Parameterized Algorithms for APSP in Directed Graphs | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606316 | 2018-03-02 | Paper |
| Sublinear Distance Labeling | 2018-03-02 | Paper |
| Streaming Pattern Matching with d Wildcards | 2018-03-02 | Paper |
| Distance labeling schemes for trees | 2017-12-19 | Paper |
| A filtering algorithm for \(k\)-mismatch with don't cares | 2017-11-03 | Paper |
| Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365021 | 2017-09-29 | Paper |
| Conditional lower bounds for space/time tradeoffs | 2017-09-22 | Paper |
| Weight Distribution and List-Decoding Size of Reed–Muller Codes | 2017-07-12 | Paper |
| Explicit Nonadaptive Combinatorial Group Testing Schemes | 2017-07-12 | Paper |
| A grouping approach for succinct dynamic dictionary matching | 2017-03-06 | Paper |
| Exponential Space Improvement for minwise Based Algorithms | 2017-01-26 | Paper |
| On the relationship between histogram indexing and block-mass indexing | 2017-01-13 | Paper |
| Addendum to: ``Exponential time improvement for min-wise based algorithms | 2016-11-18 | Paper |
| d-k-min-wise independent family of hash functions | 2016-11-14 | Paper |
| Set intersection and sequence matching with mismatch counting | 2016-06-16 | Paper |
| Dictionary Matching in a Stream | 2015-11-19 | Paper |
| Dynamic Set Intersection | 2015-10-30 | Paper |
| Fingerprints for highly similar streams | 2015-09-28 | Paper |
| Efficient sampling of non-strict turnstile data streams | 2015-06-10 | Paper |
| Dictionary matching with a few gaps | 2015-06-01 | Paper |
| Preprocess, set, query! | 2015-03-23 | Paper |
| Cycle detection and correction | 2014-12-05 | Paper |
| A PTAS for the square tiling problem | 2014-12-02 | Paper |
| Approximate sparse recovery: optimizing time and measurements | 2014-08-13 | Paper |
| Homomorphic fingerprints under misalignments | 2014-08-07 | Paper |
| Exact and Approximate Pattern Matching in the Streaming Model | 2014-07-25 | Paper |
| Orienting Fully Dynamic Graphs with Worst-Case Time Bounds | 2014-07-01 | Paper |
| For-All Sparse Recovery in Near-Optimal Time | 2014-07-01 | Paper |
| Dictionary Matching with One Gap | 2014-06-30 | Paper |
| An Improved Query Time for Succinct Dynamic Dictionary Matching | 2014-06-30 | Paper |
| Range LCP | 2014-06-10 | Paper |
| Fast moment estimation in data streams in optimal space | 2014-06-05 | Paper |
| A Space Lower Bound for Dynamic Approximate Membership Data Structures | 2014-04-11 | Paper |
| Space lower bounds for online pattern matching | 2014-01-09 | Paper |
| Efficient Sampling of Non-strict Turnstile Data Streams | 2013-08-16 | Paper |
| Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints | 2013-08-07 | Paper |
| ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk | 2013-08-06 | Paper |
| Pattern matching under polynomial transformation | 2013-07-24 | Paper |
| Sharing Rewards in Cooperative Connectivity Games | 2013-06-20 | Paper |
| Efficiently decodable compressed sensing by list-recoverable codes and recursion | 2012-08-23 | Paper |
| Pattern Matching in Multiple Streams | 2012-08-14 | Paper |
| Approximate sparse recovery: optimizing time and measurements | 2012-08-10 | Paper |
| Mismatch sampling | 2012-05-24 | Paper |
| Range LCP | 2011-12-16 | Paper |
| Preprocess, Set, Query! | 2011-09-16 | Paper |
| Approximate string matching with stuck address bits | 2011-07-14 | Paper |
| Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications | 2011-07-06 | Paper |
| Space Lower Bounds for Online Pattern Matching | 2011-06-29 | Paper |
| Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics | 2011-05-10 | Paper |
| Exponential time improvement for min-wise based algorithms | 2011-04-28 | Paper |
| A black box for online approximate pattern matching | 2011-04-28 | Paper |
| The approximate swap and mismatch edit distance | 2010-11-11 | Paper |
| Fast set intersection and two-patterns matching | 2010-10-11 | Paper |
| Fast computation of a longest increasing subsequence and application | 2010-10-07 | Paper |
| String matching with up to \(k\) swaps and mismatches | 2010-10-07 | Paper |
| Cycle Detection and Correction | 2010-09-07 | Paper |
| On the Cost of Interchange Rearrangement in Strings | 2010-09-06 | Paper |
| Pattern matching with address errors | 2010-08-16 | Paper |
| The frequent items problem, under polynomial decay, in the streaming model | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579401 | 2010-08-06 | Paper |
| Fast Set Intersection and Two-Patterns Matching | 2010-04-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Approximate matching in the \(L_{\infty }\) metric | 2010-03-24 | Paper |
| \(L_{1}\) pattern matching lower bound | 2010-03-24 | Paper |
| Pattern matching with don't cares and few errors | 2010-02-12 | Paper |
| Range non-overlapping indexing | 2009-12-17 | Paper |
| Approximate string matching with address bit errors | 2009-11-18 | Paper |
| Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances | 2009-10-09 | Paper |
| Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems | 2009-09-29 | Paper |
| An Optimal Bloom Filter Replacement Based on Matrix Solving | 2009-08-18 | Paper |
| Pattern matching with address errors: rearrangement distances | 2009-07-24 | Paper |
| Real two dimensional scaled matching | 2009-06-17 | Paper |
| Pattern matching with pair correlation distance | 2008-11-18 | Paper |
| k-Mismatch with Don’t Cares | 2008-09-25 | Paper |
| On the Cost of Interchange Rearrangement in Strings | 2008-09-25 | Paper |
| Explicit Non-adaptive Combinatorial Group Testing Schemes | 2008-08-28 | Paper |
| Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications | 2008-06-17 | Paper |
| Improved Sketching of Hamming Distance with Error Correcting | 2008-06-17 | Paper |
| A Black Box for Online Approximate Pattern Matching | 2008-06-17 | Paper |
| Approximate String Matching with Address Bit Errors | 2008-06-17 | Paper |
| Approximate String Matching with Swap and Mismatch | 2008-05-27 | Paper |
| Improved algorithms for polynomial-time decay and time-decay with additive error | 2008-04-11 | Paper |
| Efficient one-dimensional real scaled matching | 2007-10-30 | Paper |
| Approximate Matching in Weighted Sequences | 2007-09-14 | Paper |
| Finding the Position of the k-Mismatch and Approximate Tandem Repeats | 2007-09-07 | Paper |
| Efficient pebbling for list traversal synopses with application to program rollback | 2007-07-16 | Paper |
| Swap and mismatch edit distance | 2007-06-21 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Function Matching | 2006-06-01 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Faster algorithms for string matching with k mismatches | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472453 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449229 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449230 | 2004-02-08 | Paper |
| Overlap matching. | 2003-08-19 | Paper |
| Approximate swapped matching. | 2003-01-21 | Paper |
| A faster implementation of the Goemans-Williamson clustering algorithm | 2003-01-20 | Paper |
| Overlap matching | 2002-06-18 | Paper |
| Approximate subset matching with don't cares | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952702 | 2000-05-10 | Paper |
