| Publication | Date of Publication | Type |
|---|
Byzantine Agreement and Leader Election
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Local Problems in the SUPPORTED Model
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Scalable and secure computation among strangers: message-competitive Byzantine protocols | 2023-11-02 | Paper |
Balanced Allocation: Patience Is Not a Virtue
SIAM Journal on Computing | 2023-04-04 | Paper |
Guarding a Polygon Without Losing Touch
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Latency, capacity, and distributed minimum spanning trees
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Dynamics of Profit-Sharing Games
Internet Mathematics | 2021-04-26 | Paper |
Leader election in sparse dynamic networks with churn
Internet Mathematics | 2021-03-26 | Paper |
Randomized gathering of asynchronous mobile robots
Theoretical Computer Science | 2021-02-03 | Paper |
Shortest Paths in a Hybrid Network Model
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Sublinear message bounds for randomized agreement
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
Algorithmica | 2019-08-20 | Paper |
| Towards robust and efficient computation in dynamic peer-to-peer networks | 2019-05-10 | Paper |
| Fast Byzantine leader election in dynamic networks | 2018-08-24 | Paper |
Information spreading in dynamic networks under oblivious adversaries
(available as arXiv preprint) | 2018-08-16 | Paper |
Balanced allocation: patience is not a virtue
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Distributed agreement in dynamic peer-to-peer networks
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Minimax regret 1-sink location problem in dynamic path networks
Theoretical Computer Science | 2015-06-11 | Paper |
Enforcing efficient equilibria in network design games via subsidies
Algorithmica | 2015-05-21 | Paper |
Fast Byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
Tight analysis of shortest path convergecast in wireless sensor networks
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Localized geometric query problems
Computational Geometry | 2013-01-25 | Paper |
Approximate weighted farthest neighbors and minimum dilation stars
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
On the continuous CNN problem
Algorithms and Computation | 2010-12-09 | Paper |
Approximate weighted farthest neighbors and minimum dilation stars
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Largest empty circle centered on a query line
Journal of Discrete Algorithms | 2010-05-25 | Paper |
Strip packing with precedence constraints and strip packing with release times
Theoretical Computer Science | 2009-09-10 | Paper |
Optimal Power-Down Strategies
SIAM Journal on Computing | 2008-10-28 | Paper |
Linear time approximation schemes for vehicle scheduling problems
Theoretical Computer Science | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2089206 (Why is no real title available?) | 2004-08-12 | Paper |
