| Publication | Date of Publication | Type |
|---|
| Can We Break Symmetry with o(m) Communication? | 2024-03-26 | Paper |
| Byzantine Agreement and Leader Election | 2024-03-26 | Paper |
| Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds | 2024-03-26 | Paper |
| Distributed MIS in O(log log n) Awake Complexity | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083391 | 2023-12-08 | Paper |
| Scalable and secure computation among strangers: message-competitive Byzantine protocols | 2023-11-02 | Paper |
| Singularly optimal randomized leader election | 2023-11-02 | Paper |
| Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090924 | 2022-07-21 | Paper |
| Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity | 2021-03-15 | Paper |
| DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead | 2021-03-15 | Paper |
| A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees | 2021-01-27 | Paper |
| The complexity of leader election in diameter-two networks | 2020-04-23 | Paper |
| Message lower bounds via efficient network synchronization | 2020-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5203926 | 2019-12-09 | Paper |
| A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees | 2019-12-02 | Paper |
| Sublinear Message Bounds for Randomized Agreement | 2019-09-19 | Paper |
| On the Complexity of Information Spreading in Dynamic Networks | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743420 | 2019-05-10 | Paper |
| Fast Byzantine leader election in dynamic networks | 2018-08-24 | Paper |
| Information spreading in dynamic networks under oblivious adversaries | 2018-08-16 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Distributed Computation of Large-scale Graph Problems | 2017-10-05 | Paper |
| A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees | 2017-08-17 | Paper |
| Sublinear bounds for randomized leader election | 2016-12-19 | Paper |
| Message Lower Bounds via Efficient Network Synchronization | 2016-12-01 | Paper |
| Static and dynamic evaluation of QoS properties | 2016-09-29 | Paper |
| Efficient computation of sparse structures | 2016-09-15 | Paper |
| DEX: self-healing expanders | 2016-07-05 | Paper |
| Discovery through gossip | 2016-06-10 | Paper |
| Toward optimal bounds in the congested clique, graph connectivity and MST | 2016-03-23 | Paper |
| Efficient distributed computation of distance sketches in networks | 2015-10-20 | Paper |
| A tight unconditional lower bound on distributed randomwalk computation | 2015-09-11 | Paper |
| Xheal | 2015-09-11 | Paper |
| Can quantum communication speed up distributed computation? | 2015-09-03 | Paper |
| Entropy-based bounds for online algorithms | 2015-09-02 | Paper |
| On the Complexity of Universal Leader Election | 2015-08-14 | Paper |
| Distributed agreement in dynamic peer-to-peer networks | 2015-07-13 | Paper |
| Distributed computation in dynamic networks via random walks | 2015-05-22 | Paper |
| Fast byzantine agreement in dynamic networks | 2015-03-02 | Paper |
| Efficient distributed random walks with applications | 2015-03-02 | Paper |
| On the complexity of universal leader election | 2015-03-02 | Paper |
| Efficient distributed approximation algorithms via probabilistic tree embeddings | 2014-12-12 | Paper |
| Fast distributed PageRank computation | 2014-12-02 | Paper |
| Sublinear bounds for randomized leader election | 2014-12-02 | Paper |
| The bin-covering technique for thresholding random geometric graph properties | 2014-10-13 | Paper |
| Fast distributed random walks | 2014-07-23 | Paper |
| Xheal: a localized self-healing algorithm using expanders | 2014-07-11 | Paper |
| Distributed verification and hardness of distributed approximation | 2014-06-05 | Paper |
| Distributed Random Walks | 2014-02-17 | Paper |
| Efficient Computation of Balanced Structures | 2013-08-07 | Paper |
| A fast distributed approximation algorithm for minimum spanning trees | 2013-06-20 | Paper |
| Fast Distributed Computation in Dynamic Networks via Random Walks | 2013-03-13 | Paper |
| Distributed Verification and Hardness of Distributed Approximation | 2013-02-04 | Paper |
| Efficient distributed approximation algorithms via probabilistic tree embeddings | 2013-02-04 | Paper |
| Almost-optimal gossip-based aggregate computation | 2012-09-12 | Paper |
| A universal online caching algorithm based on pattern matching | 2010-03-04 | Paper |
| On a simple randomized algorithm for finding a 2-factor in sparse graphs | 2009-12-04 | Paper |
| On the Hardness of Optimization in Power Law Graphs | 2009-03-06 | Paper |
| Improved random graph isomorphism | 2008-11-18 | Paper |
| A Fast Distributed Approximation Algorithm for Minimum Spanning Trees | 2008-09-09 | Paper |
| On the hardness of optimization in power-law graphs | 2008-04-15 | Paper |
| Analysis of randomized protocols for conflict-free distributed access | 2007-11-28 | Paper |
| A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms | 2007-10-18 | Paper |
| Using PageRank to Characterize Web Structure | 2007-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808653 | 2004-08-12 | Paper |
| The restriction mapping problem revisited. | 2003-05-14 | Paper |
| Can entropy characterize performance of online algorithms? | 2002-03-24 | Paper |
