| Publication | Date of Publication | Type |
|---|
| On greedily packing anchored rectangles | 2026-05-12 | Paper |
| Scheduling with a limited testing budget: tight results for the offline and oblivious settings | 2025-01-06 | Paper |
| Improved scheduling with a shared resource | 2024-09-16 | Paper |
| Fast consensus via the unconstrained undecided state dynamics | 2024-07-19 | Paper |
Population Protocols for Exact Plurality Consensus
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| A Discrete and Continuous Study of the Max-Chain-Formation Problem | 2023-03-21 | Paper |
| Improved scheduling with a shared resource via structural insights | 2023-03-21 | Paper |
| A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states | 2022-07-21 | Paper |
A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
Information and Computation | 2022-06-08 | Paper |
| On the complexity of anchored rectangle packing | 2022-05-11 | Paper |
On minimum generalized Manhattan connections
(available as arXiv preprint) | 2022-03-25 | Paper |
Time-space trade-offs in population protocols for the majority problem
Distributed Computing | 2021-05-17 | Paper |
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Optimal time and space leader election in population protocols
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
What defines the quantum regime of the free-electron laser?
New Journal of Physics | 2021-01-15 | Paper |
| Simple and Efficient Leader Election | 2019-10-25 | Paper |
Scheduling shared continuous resources on many-cores
Journal of Scheduling | 2018-11-07 | Paper |
Self-stabilizing balls and bins in batches. The power of leaky bins
Algorithmica | 2018-10-18 | Paper |
| Tight bounds for coalescing-branching random walks on regular graphs | 2018-03-15 | Paper |
Plurality consensus in arbitrary graphs: lessons learned from load balancing
(available as arXiv preprint) | 2018-03-02 | Paper |
| Efficient plurality consensus, or: the benefits of cleaning up from time to time | 2017-12-19 | Paper |
Ignore or comply? On breaking symmetry in consensus
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Efficient computation of optimal energy and fractional weighted flow trade-off schedules
Algorithmica | 2017-10-10 | Paper |
Self-stabilizing balls \& bins in batches: the power of leaky bins (extended abstract)
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Tight Load Balancing via Randomized Local Search | 2017-06-29 | Paper |
Continuous speed scaling with variability: a simple and direct approach
Theoretical Computer Science | 2017-05-15 | Paper |
| Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules | 2017-03-03 | Paper |
Optimal speed scaling with a solar cell (extended abstract)
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Towards the price of leasing online
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
On the complexity of speed scaling
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Slow down and sleep for profit in online deadline scheduling
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Basic network creation games with communication interests
Algorithmic Game Theory | 2013-03-13 | Paper |
A new approach for analyzing convergence algorithms for mobile robots
Automata, Languages and Programming | 2011-07-07 | Paper |
Collisionless gathering of robots with an extent
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
A continuous, local strategy for constructing a short chain of mobile robots
Structural Information and Communication Complexity | 2010-06-17 | Paper |
