| Publication | Date of Publication | Type |
|---|
Labeling schemes for deterministic radio multi-broadcast
Theoretical Computer Science | 2026-03-26 | Paper |
Fast deterministic rendezvous in labeled lines
Distributed Computing | 2026-01-20 | Paper |
Reconfiguration of multisets with applications to bin packing
Algorithmica | 2025-10-10 | Paper |
| Cops and robbers on 1-planar graphs | 2024-10-14 | Paper |
| Reconfiguration of multisets with applications to bin packing | 2024-07-19 | Paper |
Four shades of deterministic leader election in anonymous networks
Distributed Computing | 2023-11-21 | Paper |
Deterministic Leader Election in Anonymous Radio Networks
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Local gossip and neighbour discovery in mobile ad hoc radio networks
Algorithms for Sensor Systems | 2023-10-20 | Paper |
| Cops and Robbers on 1-Planar Graphs | 2023-09-02 | Paper |
Labeling schemes for deterministic radio multi-broadcast
(available as arXiv preprint) | 2022-06-08 | Paper |
Fast Byzantine gathering with visibility in graphs
(available as arXiv preprint) | 2021-07-08 | Paper |
With Great Speed Come Small Buffers
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Burning two worlds
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Global synchronization and consensus using beeps in a fault-prone multiple access channel
Theoretical Computer Science | 2020-01-16 | Paper |
| Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs | 2019-09-01 | Paper |
Time vs. information tradeoffs for leader election in anonymous trees
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks | 2018-10-17 | Paper |
Deterministic distributed construction of T-dominating sets in time T
Discrete Applied Mathematics | 2018-09-25 | Paper |
Buffer size for routing limited-rate adversarial traffic
(available as arXiv preprint) | 2018-08-16 | Paper |
Time vs. information tradeoffs for leader election in anonymous trees
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Time versus cost tradeoffs for deterministic rendezvous in networks
Distributed Computing | 2016-03-01 | Paper |
On the complexity of neighbourhood learning in radio networks
Theoretical Computer Science | 2015-12-11 | Paper |
Fast rendezvous with advice
Theoretical Computer Science | 2015-12-11 | Paper |
Time versus cost tradeoffs for deterministic rendezvous in networks
1321.68318 | 2015-09-03 | Paper |
Decimations of languages and state complexity
Theoretical Computer Science | 2009-06-04 | Paper |
