| Publication | Date of Publication | Type |
|---|
| Color distance oracles and snippets: separation between exact and approximate solutions | 2026-08-31 | Paper |
| Removing the log factor from (,+)-products on bounded range integer matrices | 2026-05-26 | Paper |
| Towards optimal set-disjointness and set-intersection data structures | 2026-03-18 | Paper |
| On the space usage of approximate distance oracles with sub-2 stretch | 2026-01-14 | Paper |
| An exponential separation between randomized and deterministic complexity in the LOCAL model | 2025-08-06 | Paper |
| Breaking the variance: approximating the Hamming distance in 1/ time per alignment | 2025-08-05 | Paper |
| On-line indexing for general alphabets via predecessor queries on subsets of an ordered list | 2025-05-05 | Paper |
An improved algorithm for the k-Dyck edit distance problem
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| 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
TheoretiCS | 2024-07-03 | Paper |
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue
ACM Transactions on Algorithms | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7758348 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Incremental Edge Orientation in Forests
(available as arXiv preprint) | 2023-09-20 | Paper |
scientific article; zbMATH DE number 7651106 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Support optimality and adaptive cuckoo filters
(available as arXiv preprint) | 2022-03-25 | Paper |
| Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams | 2021-07-28 | Paper |
An<i>O</i>(log<sup>3/2</sup><i>n</i>) Parallel Time Population Protocol for Majority with<i>O</i>(log<i>n</i>) States
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Contention resolution without collision detection
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Approximating text-to-pattern Hamming distances
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 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
ACM Transactions on Algorithms | 2019-12-02 | Paper |
| A simple algorithm for approximating the text-to-pattern Hamming distance | 2019-10-25 | Paper |
Mind the gap!
Algorithmica | 2019-05-17 | Paper |
Streaming pattern matching with \(d\) wildcards
Algorithmica | 2019-05-07 | Paper |
An exponential separation between randomized and deterministic complexity in the LOCAL model
SIAM Journal on Computing | 2019-02-08 | Paper |
Sparse text indexing in small space
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Contention resolution with constant throughput and log-logstar channel accesses
SIAM Journal on Computing | 2018-10-11 | Paper |
Higher lower bounds from the 3SUM conjecture
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
File maintenance: when in doubt, change the layout!
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 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 |
Streaming Pattern Matching with d Wildcards
(available as arXiv preprint) | 2018-03-02 | Paper |
How hard is it to find (honest) witnesses?
(available as arXiv preprint) | 2018-03-02 | Paper |
Faster worst case deterministic dynamic connectivity
(available as arXiv preprint) | 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
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Brief announcement: An exponential separation between randomized and deterministic complexity in the LOCAL model
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Fast, precise and dynamic distance queries
(available as arXiv preprint) | 2017-09-29 | Paper |
| Fast, precise and dynamic distance queries | 2017-09-29 | Paper |
Conditional lower bounds for space/time tradeoffs
(available as arXiv preprint) | 2017-09-22 | Paper |
Exponential separations in the energy complexity of leader election
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
The property suffix tree with dynamic properties
Theoretical Computer Science | 2016-06-16 | Paper |
Dynamic set intersection
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Suffix trays and suffix trists: structures for faster text indexing
Algorithmica | 2015-07-10 | Paper |
| Dynamic weighted ancestors | 2014-12-18 | Paper |
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
SIAM Journal on Computing | 2014-11-14 | Paper |
Cross-document pattern matching
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Orienting fully dynamic graphs with worst-case time bounds
Automata, Languages, and Programming | 2014-07-01 | Paper |
Generalized substring compression
Theoretical Computer Science | 2014-03-13 | Paper |
Sparse suffix tree construction in small space
Automata, Languages, and Programming | 2013-08-06 | Paper |
Selection in the presence of memory faults, with applications to in-place resilient sorting
Algorithms and Computation | 2013-03-21 | Paper |
Forbidden patterns
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
The Property Suffix Tree with Dynamic Properties
Combinatorial Pattern Matching | 2010-07-26 | Paper |
On the longest common parameterized subsequence
Theoretical Computer Science | 2009-11-18 | Paper |
Suffix trays and suffix trists: structures for faster text indexing
Lecture Notes in Computer Science | 2009-03-12 | Paper |
Range Non-overlapping Indexing and Successive List Indexing
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Property matching and weighted matching
Theoretical Computer Science | 2008-07-10 | Paper |
On the Longest Common Parameterized Subsequence
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Improved algorithms for polynomial-time decay and time-decay with additive error
Theory of Computing Systems | 2008-04-11 | Paper |
Property Matching and Weighted Matching
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
