| Publication | Date of Publication | Type |
|---|
| Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! | 2024-07-26 | Paper |
| Contention Resolution with Predictions | 2024-03-26 | Paper |
| On the Validity of Consensus | 2024-03-26 | Paper |
| Brief announcement: Polygraph: accountable Byzantine agreement | 2023-11-02 | Paper |
| Leader election in well-connected graphs | 2023-04-11 | Paper |
| Parallel finger search structures | 2023-02-03 | Paper |
| On bioelectric algorithms | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091105 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092356 | 2022-07-21 | Paper |
| Latency, capacity, and distributed minimum spanning trees | 2022-03-29 | Paper |
| DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead | 2021-03-15 | Paper |
| Confidential gossip | 2020-10-16 | Paper |
| On simple back-off in unreliable radio networks | 2020-01-16 | Paper |
| Contention resolution on a fading channel | 2019-11-27 | Paper |
| Leader Election in Well-Connected Graphs | 2019-09-19 | Paper |
| Dynamic Task Allocation in Asynchronous Shared Memory | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633925 | 2019-05-06 | Paper |
| Scaling Exponential Backoff | 2019-02-25 | Paper |
| Cost-Oblivious Storage Reallocation | 2018-11-05 | Paper |
| A New Approach to Incremental Cycle Detection and Related Problems | 2018-10-30 | Paper |
| Smoothed analysis of dynamic networks | 2018-08-24 | Paper |
| The computational power of beeps | 2018-08-24 | Paper |
| Smoothed analysis of dynamic networks | 2018-08-13 | Paper |
| How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness | 2018-07-16 | Paper |
| File Maintenance: When in Doubt, Change the Layout! | 2018-07-16 | Paper |
| Symmetry Breaking with Noisy Processes | 2017-10-11 | Paper |
| Communication Primitives in Cognitive Radio Networks | 2017-10-11 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Who are you? Secure identities in single hop ad hoc networks | 2017-10-06 | Paper |
| Contention Resolution on a Fading Channel | 2017-09-29 | Paper |
| Bounds for Blind Rate Adaptation | 2017-09-29 | Paper |
| On Differentially Private Online Collaborative Recommendation Systems | 2016-05-19 | Paper |
| Efficient communication in cognitive radio networks | 2016-03-23 | Paper |
| Reconfigurable distributed storage for dynamic networks | 2015-12-18 | Paper |
| Reallocation problems in scheduling | 2015-10-19 | Paper |
| Optimal-time adaptive strong renaming, with applications to counting | 2015-09-11 | Paper |
| Structuring unreliable radio networks | 2015-09-11 | Paper |
| Consensus and collision detectors in wireless Ad Hoc networks | 2015-03-10 | Paper |
| Maximal independent sets in multichannel radio networks | 2015-03-02 | Paper |
| Meeting the deadline | 2015-03-02 | Paper |
| Secure communication over radio channels | 2014-12-12 | Paper |
| On the complexity of asynchronous gossip | 2014-12-12 | Paper |
| Virtual infrastructure for collision-prone wireless networks | 2014-12-12 | Paper |
| Leader election in shared spectrum radio networks | 2014-12-05 | Paper |
| Aggregation in dynamic networks | 2014-12-05 | Paper |
| Making evildoers pay | 2014-12-05 | Paper |
| Broadcast in the Ad Hoc SINR Model | 2014-09-29 | Paper |
| Extensible encoding of type hierarchies | 2014-09-12 | Paper |
| Tight Bounds for Asynchronous Renaming | 2014-09-12 | Paper |
| The Complexity of Renaming | 2014-07-30 | Paper |
| Mutual Exclusion with O(log^2 Log n) Amortized Work | 2014-07-30 | Paper |
| The wireless synchronization problem | 2014-07-23 | Paper |
| Structuring unreliable radio networks | 2014-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417681 | 2014-05-22 | Paper |
| Asynchronous gossip | 2014-02-17 | Paper |
| Consensus and collision detectors in radio networks | 2013-06-28 | Paper |
| GeoQuorums: implementing atomic memory in mobile ad hoc networks | 2013-06-07 | Paper |
| Generating fast indulgent algorithms | 2012-12-07 | Paper |
| Of choices, failures and asynchrony: the many faces of set agreement | 2012-04-26 | Paper |
| \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks | 2012-02-06 | Paper |
| Meeting the deadline: on the complexity of fault-tolerant continuous gossip | 2012-02-06 | Paper |
| Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast | 2011-10-28 | Paper |
| Fast Randomized Test-and-Set and Renaming | 2010-09-10 | Paper |
| Trusted Computing for Fault-Prone Wireless Networks | 2010-09-10 | Paper |
| How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) | 2010-09-07 | Paper |
| Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement | 2009-12-17 | Paper |
| Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks | 2009-03-02 | Paper |
| How to Solve Consensus in the Smallest Window of Synchrony | 2008-11-20 | Paper |
| Gossiping in a Multi-channel Radio Network | 2008-09-02 | Paper |
| On the Message Complexity of Indulgent Consensus | 2008-09-02 | Paper |
| Contention Resolution with Heterogeneous Job Sizes | 2008-03-11 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
