| Publication | Date of Publication | Type |
|---|
| Defending hash tables from algorithmic complexity attacks with resource burning | 2024-10-07 | Paper |
| Boundary sketching with asymptotically optimal distance and rotation | 2024-08-20 | Paper |
| Boundary sketching with asymptotically optimal distance and rotation | 2024-01-11 | Paper |
| Scalable and secure computation among strangers: message-competitive Byzantine protocols | 2023-11-02 | Paper |
| Bankrupting Sybil despite churn | 2023-04-21 | Paper |
| Resource Burning for Permissionless Systems (Invited Paper) | 2022-09-01 | Paper |
| ANTS on a Plane | 2022-09-01 | Paper |
| A resource-competitive jamming defense | 2022-02-15 | Paper |
| Communication-efficient randomized consensus | 2022-02-15 | Paper |
| Multiparty Interactive Communication with Private Channels | 2021-01-20 | Paper |
| Bootstrapping Public Blockchains Without a Trusted Setup | 2021-01-20 | Paper |
| A computational approach to animal breeding | 2020-10-28 | Paper |
| Making social networks more human: A topological approach | 2020-10-14 | Paper |
| Faster Agreement via a Spectral Method for Detecting Malicious Behavior | 2019-06-20 | Paper |
| Byzantine Agreement in Expected Polynomial Time | 2018-08-02 | Paper |
| Interactive communication with unknown noise rate | 2018-06-14 | Paper |
| A theoretical and empirical evaluation of an algorithm for self-healing computation | 2017-11-29 | Paper |
| Secure multi-party computation in large networks | 2017-08-31 | Paper |
| Secure Multi-party Shuffling | 2016-01-08 | Paper |
| Interactive communication with unknown noise rate | 2015-11-04 | Paper |
| Conflict on a communication channel | 2015-09-11 | Paper |
| Scalable rational secret sharing | 2015-09-11 | Paper |
| Choosing a random peer | 2015-08-03 | Paper |
| Scalable mechanisms for rational secret sharing | 2015-07-22 | Paper |
| Breaking the O ( n 2 ) bit barrier | 2015-03-02 | Paper |
| Spectral analysis of data | 2015-02-27 | Paper |
| Recent Results in Scalable Multi-Party Computation | 2015-02-20 | Paper |
| Sleeping on the job | 2014-12-12 | Paper |
| The forgiving tree | 2014-12-12 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Fast asynchronous Byzantine agreement and leader election with full information | 2014-11-18 | Paper |
| Byzantine agreement in polynomial expected time | 2014-08-07 | Paper |
| The forgiving graph | 2014-07-23 | Paper |
| Breaking the O ( n 2 ) bit barrier | 2014-02-17 | Paper |
| The Power of Mediation in an Extended El Farol Game | 2013-10-23 | Paper |
| A note on improving the performance of approximation algorithms for radiation therapy | 2013-03-28 | Paper |
| The forgiving graph: a distributed data structure for low stretch under adversarial attack | 2013-02-04 | Paper |
| Sleeping on the job: energy-efficient and robust broadcast for radio networks | 2011-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002776 | 2011-05-24 | Paper |
| Scalable leader election | 2010-08-16 | Paper |
| Reducing communication costs in robust peer-to-peer networks | 2010-04-19 | Paper |
| Algorithms for data migration | 2010-03-23 | Paper |
| Nonnegative integral subset representations of integer sets | 2010-01-29 | Paper |
| Approximation algorithms for minimizing segments in radiation therapy | 2010-01-29 | Paper |
| From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits | 2009-11-19 | Paper |
| Choosing a random peer in Chord | 2007-11-28 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Discrete sensor placement problems in distribution networks | 2006-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828919 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709172 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785579 | 2003-01-05 | Paper |
| On algorithms for efficient data migration | 2002-01-30 | Paper |
| On-line and off-line preemptive two-machine job shop scheduling | 2001-05-13 | Paper |
