| Publication | Date of Publication | Type |
|---|
| An improved algorithm for the \(k\)-Dyck edit distance problem | 2024-07-19 | Paper |
| Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time | 2024-07-03 | Paper |
| Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue | 2023-10-31 | 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 |
| Support optimality and adaptive cuckoo filters | 2022-03-25 | 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 |
| Approximating text-to-pattern Hamming distances | 2021-01-19 | Paper |
| Contention resolution without collision detection | 2021-01-19 | Paper |
| The Online House Numbering Problem: Min-Max Online List Labeling | 2020-05-27 | Paper |
| Dynamic dictionary matching in the online model | 2020-01-16 | Paper |
| Exponential Separations in the Energy Complexity of Leader Election | 2019-12-02 | Paper |
| A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance | 2019-10-25 | Paper |
| Mind the gap! | 2019-05-17 | Paper |
| Streaming pattern matching with \(d\) wildcards | 2019-05-07 | Paper |
| An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model | 2019-02-08 | Paper |
| Sparse Text Indexing in Small Space | 2018-11-05 | Paper |
| Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses | 2018-10-11 | Paper |
| Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time | 2018-07-16 | Paper |
| Higher Lower Bounds from the 3SUM Conjecture | 2018-07-16 | Paper |
| File Maintenance: When in Doubt, Change the Layout! | 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 |
| https://portal.mardi4nfdi.de/entity/Q4606316 | 2018-03-02 | Paper |
| Faster worst case deterministic dynamic connectivity | 2018-03-02 | Paper |
| Streaming Pattern Matching with d Wildcards | 2018-03-02 | Paper |
| Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. | 2017-10-17 | Paper |
| Color-Distance Oracles and Snippets | 2017-10-17 | Paper |
| Contention resolution with log-logstar channel accesses | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365085 | 2017-09-29 | Paper |
| Conditional lower bounds for space/time tradeoffs | 2017-09-22 | Paper |
| Exponential separations in the energy complexity of leader election | 2017-08-17 | Paper |
| The property suffix tree with dynamic properties | 2016-06-16 | Paper |
| Dynamic Set Intersection | 2015-10-30 | Paper |
| Suffix trays and suffix trists: structures for faster text indexing | 2015-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934639 | 2014-12-18 | Paper |
| Managing unbounded-length keys in comparison-driven data structures with applications to online indexing | 2014-11-14 | Paper |
| Cross-document pattern matching | 2014-08-13 | Paper |
| Orienting Fully Dynamic Graphs with Worst-Case Time Bounds | 2014-07-01 | Paper |
| Generalized substring compression | 2014-03-13 | Paper |
| Sparse Suffix Tree Construction in Small Space | 2013-08-06 | Paper |
| Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting | 2013-03-21 | Paper |
| Forbidden Patterns | 2012-06-29 | Paper |
| The Property Suffix Tree with Dynamic Properties | 2010-07-26 | Paper |
| On the longest common parameterized subsequence | 2009-11-18 | Paper |
| Suffix trays and suffix trists: structures for faster text indexing | 2009-03-12 | Paper |
| Range Non-overlapping Indexing and Successive List Indexing | 2009-02-17 | Paper |
| Property matching and weighted matching | 2008-07-10 | Paper |
| On the Longest Common Parameterized Subsequence | 2008-06-17 | Paper |
| Improved algorithms for polynomial-time decay and time-decay with additive error | 2008-04-11 | Paper |
| Property Matching and Weighted Matching | 2007-09-14 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
