| Publication | Date of Publication | Type |
|---|
Energy constrained depth first search
Algorithmica | 2024-12-03 | Paper |
| A framework for searching in graphs in the presence of errors | 2024-08-26 | Paper |
| The dynamic \(k\)-mismatch problem | 2024-05-06 | Paper |
Comparison Dynamics in Population Protocols
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7788356 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7758337 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7758348 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Better distance labeling for unweighted planar graphs
Algorithmica | 2023-06-05 | Paper |
Approximating Text-To-Pattern Distance via Dimensionality Reduction
(available as arXiv preprint) | 2023-02-07 | Paper |
| Recent advances in text-to-pattern distance algorithms | 2022-12-16 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Journal of Computer and System Sciences | 2022-08-26 | Paper |
Faster algorithms for all-pairs bounded min-cuts
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561710 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Approximating Approximate Pattern Matching
(available as arXiv preprint) | 2022-07-18 | Paper |
| Hamming Distance Completeness | 2022-07-18 | Paper |
| Better distance labeling for unweighted planar graphs | 2022-03-25 | Paper |
An efficient noisy binary search in graphs via Median approximation
(available as arXiv preprint) | 2022-03-22 | Paper |
| Towards unified approximate pattern matching for Hamming and \(L_1\) distance | 2021-07-28 | Paper |
| Brief announcement: Hamming distance completeness and sparse matrix multiplication | 2021-07-28 | Paper |
Brief announcement: Energy constrained depth first search
(available as arXiv preprint) | 2021-07-28 | Paper |
Hardness of exact distance queries in sparse graphs through hub labeling
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Approximation strategies for generalized binary search in weighted trees
(available as arXiv preprint) | 2020-05-27 | Paper |
All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time
(available as arXiv preprint) | 2020-05-27 | Paper |
Brief Announcement
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Tight tradeoffs for real-time approximation of longest palindromes in streams
Algorithmica | 2019-08-20 | Paper |
Improved analysis of deterministic load-balancing schemes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
| Limit behavior of the multi-agent rotor-router system | 2018-08-24 | Paper |
Sublinear-space distance labeling using hubs
(available as arXiv preprint) | 2018-08-16 | Paper |
| scientific article; zbMATH DE number 6850478 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850478 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
Robust detection in leak-prone population protocols
(available as arXiv preprint) | 2018-02-02 | Paper |
Randomized algorithms for finding a majority element
(available as arXiv preprint) | 2017-10-17 | Paper |
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.
(available as arXiv preprint) | 2017-10-17 | Paper |
LCL problems on grids
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
LCL problems on grids
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Brief announcement: Sublinear-space distance labeling using hubs
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Time and space optimality of rotor-router graph exploration
Information Processing Letters | 2017-08-16 | Paper |
| Bounds on the cover time of parallel rotor walks | 2017-03-03 | Paper |
Order-preserving pattern matching with \(k\) mismatches
Theoretical Computer Science | 2016-06-16 | Paper |
Bounds on the cover time of parallel rotor walks
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Improved analysis of deterministic load-balancing schemes
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Automata, Languages, and Programming | 2015-10-27 | Paper |
Fast collaborative graph exploration
Information and Computation | 2015-06-09 | Paper |
Rendezvous of distance-aware mobile agents in unknown graphs
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Order-preserving pattern matching with \(k\) mismatches
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Fast collaborative graph exploration
Automata, Languages, and Programming | 2013-08-07 | Paper |
