| Publication | Date of Publication | Type |
|---|
| Deterministic even-cycle detection in broadcast CONGEST | 2026-09-29 | Paper |
| Agreement tasks in fault-prone synchronous networks of arbitrary structure | 2026-06-24 | Paper |
| Distributed quantum proofs for replicated data | 2026-04-15 | Paper |
| The topology of local computing in networks | 2026-03-18 | Paper |
The computational power of distributed shared-memory models with bounded-size registers
Distributed Computing | 2026-02-25 | Paper |
Distributed model checking on graphs of bounded treedepth
Algorithmica | 2025-12-16 | Paper |
A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
Distributed Computing | 2025-10-29 | Paper |
| Local conflict coloring | 2025-08-06 | Paper |
| The computational power of distributed shared-memory models with bounded-size registers | 2025-06-13 | Paper |
| Even-cycle detection in the randomized and quantum CONGEST model | 2025-06-13 | Paper |
| Brief announcement: Distributed model checking on graphs of bounded treedepth | 2025-06-13 | Paper |
| The reduced automata technique for graph exploration space lower bounds | 2025-03-19 | Paper |
Distributed computing in the asynchronous LOCAL model
Theoretical Computer Science | 2024-12-12 | Paper |
The topology of randomized symmetry-breaking distributed computing
Journal of Applied and Computational Topology | 2024-11-29 | Paper |
The topology of local computing in networks
Journal of Applied and Computational Topology | 2024-11-29 | Paper |
| Source-oblivious broadcast | 2024-11-12 | Paper |
| Parameterized Complexity of Broadcasting in Graphs | 2024-05-03 | Paper |
| Synchronous t-resilient consensus in arbitrary graphs | 2024-04-19 | Paper |
Parameterized complexity of broadcasting in graphs
Theoretical Computer Science | 2024-04-16 | Paper |
On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model
Theoretical Computer Science | 2024-04-04 | Paper |
The Topology of Randomized Symmetry-Breaking Distributed Computing
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Fault Tolerant Coloring of the Asynchronous Cycle
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A meta-theorem for distributed certification
Algorithmica | 2024-01-25 | Paper |
On the power of threshold-based algorithms for detecting cycles in the CONGEST model
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Energy-efficient distributed algorithms for synchronous networks
Structural Information and Communication Complexity | 2024-01-11 | Paper |
| scientific article; zbMATH DE number 7774298 (Why is no real title available?) | 2023-12-08 | Paper |
| Brief announcement: Distributed quantum proofs for replicated data | 2023-11-02 | Paper |
Synchronous \(t\)-resilient consensus in arbitrary graphs
Information and Computation | 2023-05-19 | Paper |
Decentralized Asynchronous Crash-resilient Runtime Verification
Journal of the ACM | 2023-04-27 | Paper |
| How Do Mobile Agents Benefit from Randomness? | 2023-04-21 | Paper |
| Certification of compact low-stretch routing schemes | 2023-02-03 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
| Error-sensitive proof-labeling schemes | 2023-02-03 | Paper |
| Trade-offs in distributed interactive proofs | 2023-02-03 | Paper |
Local certification of graphs with bounded genus
Discrete Applied Mathematics | 2022-12-08 | Paper |
A meta-theorem for distributed certification
(available as arXiv preprint) | 2022-11-11 | Paper |
Present-biased optimization
Mathematical Social Sciences | 2022-10-04 | Paper |
Distributed Testing of Distance-k Colorings
Structural Information and Communication Complexity | 2022-09-01 | Paper |
| Redundancy in distributed proofs | 2022-07-21 | Paper |
| Equilibria of Games in Networks for Local Tasks | 2022-07-21 | Paper |
Compact distributed certification of planar graphs
Algorithmica | 2021-06-30 | Paper |
Redundancy in distributed proofs
Distributed Computing | 2021-05-17 | Paper |
Compact Distributed Certification of Planar Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
A hierarchy of local decision
Theoretical Computer Science | 2021-01-19 | Paper |
A topological perspective on distributed network algorithms
Theoretical Computer Science | 2020-12-15 | Paper |
Perfect failure detection with very few bits
Information and Computation | 2020-12-15 | Paper |
Assigning labels in an unknown anonymous network with a leader
Distributed Computing | 2020-12-03 | Paper |
Interval routing schemes allow broadcasting with linear message-complexity
Distributed Computing | 2020-12-03 | Paper |
Universal routing schemes
Distributed Computing | 2020-12-02 | Paper |
Deciding and verifying network properties locally with few output bits
Distributed Computing | 2020-04-23 | Paper |
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
Journal of Applied and Computational Topology | 2020-03-06 | Paper |
| On distributed Merlin-Arthur decision protocols | 2020-03-03 | Paper |
A topological perspective on distributed network algorithms
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Perfect failure detection with very few bits
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Parallel Bayesian search with no coordination
Journal of the ACM | 2019-11-21 | Paper |
Noisy rumor spreading and plurality consensus
Distributed Computing | 2019-08-13 | Paper |
Randomized proof-labeling schemes
Distributed Computing | 2019-07-11 | Paper |
Survey of distributed decision
(available as arXiv preprint) | 2019-07-03 | Paper |
| Survey of distributed decision | 2019-07-03 | Paper |
Node labels in local decision
Theoretical Computer Science | 2018-11-29 | Paper |
Label-guided graph exploration by a finite automaton
ACM Transactions on Algorithms | 2018-11-05 | Paper |
What can be verified locally?
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Distributed testing of excluded subgraphs
(available as arXiv preprint) | 2018-08-16 | Paper |
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets
Journal of the ACM | 2018-08-02 | Paper |
| What can be verified locally? | 2018-04-19 | Paper |
| Decentralized asynchronous crash-resilient runtime verification | 2018-03-21 | Paper |
scientific article; zbMATH DE number 6820307 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
On the additive constant of the k-server work function algorithm
Information Processing Letters | 2017-11-03 | Paper |
A characterization of networks supporting linear interval routing
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Parallel exhaustive search without coordination
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Noisy rumor spreading and plurality consensus (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Brief announcement: Asynchronous coordination with constraints and preferences
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Asynchronous coordination under preferences and constraints
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Sparsifying congested cliques and core-periphery networks
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Hierarchical broadcast networks
Information Processing Letters | 2016-06-09 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems
Algorithmica | 2016-05-31 | Paper |
Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Randomized proof-labeling schemes
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Rumor spreading in random evolving graphs
Random Structures & Algorithms | 2016-03-22 | Paper |
Node labels in local decision
Lecture Notes in Computer Science | 2016-01-08 | Paper |
On the complexity of the shortest-path broadcast problem
Discrete Applied Mathematics | 2015-12-10 | Paper |
Distributedly testing cycle-freeness
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
On the Impact of Identifiers on Local Decision
Lecture Notes in Computer Science | 2015-08-05 | Paper |
Eclecticism shrinks even small worlds
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Oracle size, a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Greedy routing in small-world networks with power-law degrees
Distributed Computing | 2015-02-23 | Paper |
Randomized distributed decision
Distributed Computing | 2015-02-23 | Paper |
Delays induce an exponential memory gap for rendezvous in trees
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Brief announcement: What can be computed without communication?
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
The worst case behavior of randomized gossip protocols
Theoretical Computer Science | 2014-12-02 | Paper |
On the searchability of small-world networks with arbitrary underlying structure
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
An optimal ancestry scheme and small universal posets
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Local Distributed Decision
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
The effect of power-law degrees on the navigability of small worlds (extended abstract)
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Compact ancestry labeling schemes for XML trees | 2014-05-22 | Paper |
