| Publication | Date of Publication | Type |
|---|
Exponential speedup over locality in \textsf{MPC} with optimal memory
Distributed Computing | 2026-01-20 | Paper |
| Distributed lower bounds for ruling sets | 2025-08-12 | Paper |
| Lower bounds for maximal matchings and maximal independent sets | 2025-08-12 | Paper |
| Completing the node-averaged complexity landscape of LCLs on trees | 2025-06-13 | Paper |
| Brief announcement: Local advice and local decompression | 2025-06-13 | Paper |
| Tight lower bounds in the supported LOCAL model | 2025-06-13 | Paper |
| Distributed maximal matching and maximal independent set on hypergraphs | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829261 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
The Randomized Local Computation Complexity of the Lovász Local Lemma
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Distributed Edge Coloring in Time Polylogarithmic in Δ
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
The Landscape of Distributed Complexities on Trees and Beyond
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Locally checkable problems in rooted trees
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7774301 (Why is no real title available?) | 2023-12-08 | Paper |
Distributed ∆-coloring plays hide-and-seek
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Classification of distributed binary labeling problems | 2023-11-02 | Paper |
| Tight bounds for deterministic high-dimensional grid exploration | 2023-11-02 | Paper |
| Brief announcement: Efficient load-balancing through distributed token dropping | 2023-11-02 | Paper |
Locally checkable problems in rooted trees
Distributed Computing | 2023-09-11 | Paper |
Lower Bounds for Maximal Matchings and Maximal Independent Sets
Journal of the ACM | 2022-12-08 | Paper |
| A tight lower bound for semi-synchronous collaborative grid exploration | 2022-07-21 | Paper |
| Almost global problems in the LOCAL model | 2022-07-21 | Paper |
| Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees | 2022-04-20 | Paper |
Distributed Lower Bounds for Ruling Sets
SIAM Journal on Computing | 2022-03-11 | Paper |
| On Homomorphism Graphs | 2021-11-05 | Paper |
Almost global problems in the LOCAL model
Distributed Computing | 2021-09-06 | Paper |
| Fine-grained Lower Bounds on Cops and Robbers | 2021-08-04 | Paper |
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
How much does randomness help with locally checkable problems?
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Brief Announcement: Classification of Distributed Binary Labeling Problems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Brief Announcement: Classification of Distributed Binary Labeling Problems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
A tight lower bound for semi-synchronous collaborative grid exploration
Distributed Computing | 2021-01-22 | Paper |
An Automatic Speedup Theorem for Distributed Problems
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Massively Parallel Computation of Matching and MIS in Sparse Graphs
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory
Theoretical Computer Science | 2020-12-15 | Paper |
Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs
Theoretical Computer Science | 2020-09-03 | Paper |
A tight lower bound for the capture time of the cops and robbers game
Theoretical Computer Science | 2020-09-03 | Paper |
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\'asz Local Lemma
(available as arXiv preprint) | 2020-06-08 | Paper |
| A tight lower bound for the capture time of the cops and robbers game | 2020-05-27 | Paper |
Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory
(available as arXiv preprint) | 2020-03-03 | Paper |
Wireless evacuation on \(m\) rays with \(k\) searchers
Theoretical Computer Science | 2020-02-13 | Paper |
Approximating small balanced vertex separators in almost linear time
Algorithmica | 2019-09-10 | Paper |
Querying log data with metric temporal logic
Journal of Artificial Intelligence Research | 2018-09-06 | Paper |
Wireless evacuation on m rays with k searchers
Structural Information and Communication Complexity | 2018-04-12 | 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 |
A lower bound for the distributed Lovász local lemma
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Approximating small balanced vertex separators in almost linear time
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Collaboration without communication: evacuating two robots from a disk
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Toehold DNA languages are regular (extended abstract)
Algorithms and Computation | 2016-01-11 | Paper |
| Extensions of non-standard inferences to description logics with transitive roles | 2010-02-24 | Paper |
Distributed delays stabilize neural feedback systems
Biological Cybernetics | 2009-03-27 | Paper |
Matching in Hybrid Terminologies
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Winner-take-all selection in a neural system with delayed feedback
Biological Cybernetics | 2007-11-12 | Paper |
Large-D expansion from variational perturbation theory
Journal of Mathematical Physics | 2007-05-16 | Paper |
KI 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Recursive calculation of effective potential and variational resummation
Journal of Mathematical Physics | 2005-06-30 | Paper |
