| Publication | Date of Publication | Type |
|---|
| Sinkless orientation made simple | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7832755 (Why is no real title available?) | 2024-04-15 | Paper |
Near-Optimal Leader Election in Population Protocols on Graphs
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Fast Graphical Population Protocols
(available as arXiv preprint) | 2023-12-08 | Paper |
| Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model | 2023-12-08 | Paper |
| Brief announcement: Efficient load-balancing through distributed token dropping | 2023-11-02 | Paper |
Wait-free approximate agreement on graphs
Theoretical Computer Science | 2023-02-13 | Paper |
| Byzantine approximate agreement on graphs | 2023-02-03 | Paper |
| Self-stabilising Byzantine clock synchronisation is almost as easy as consensus | 2023-02-03 | Paper |
Local mending
(available as arXiv preprint) | 2022-11-11 | Paper |
Wait-free approximate agreement on graphs
Structural Information and Communication Complexity | 2022-03-22 | Paper |
Does Preprocessing Help under Congestion?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Deterministic subgraph detection in broadcast CONGEST
(available as arXiv preprint) | 2020-07-30 | Paper |
Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
Journal of the ACM | 2020-02-11 | Paper |
Near-optimal self-stabilising counting and firing squads
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Near-optimal self-stabilising counting and firing squads
Distributed Computing | 2019-08-13 | Paper |
| Efficient counting with optimal resilience | 2018-08-24 | Paper |
Large cuts with local algorithms on triangle-free graphs
The Electronic Journal of Combinatorics | 2017-10-24 | Paper |
Large cuts with local algorithms on triangle-free graphs
The Electronic Journal of Combinatorics | 2017-10-24 | 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 |
Efficient counting with optimal resilience
SIAM Journal on Computing | 2017-09-25 | Paper |
Towards optimal synchronous counting
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Exact bounds for distributed graph colouring
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Synchronous counting and computational algorithm design
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Deterministic local algorithms, unique identifiers, and fractional graph colouring
Theoretical Computer Science | 2015-12-10 | Paper |
Deterministic local algorithms, unique identifiers, and fractional graph colouring
Structural Information and Communication Complexity | 2012-09-26 | Paper |
A Local 2-Approximation Algorithm for the Vertex Cover Problem
Lecture Notes in Computer Science | 2009-11-19 | Paper |
| scientific article; zbMATH DE number 4081086 (Why is no real title available?) | 1987-01-01 | Paper |
