| Publication | Date of Publication | Type |
|---|
| Scalable and secure computation among strangers: message-competitive Byzantine protocols | 2023-11-02 | Paper |
| Communication costs in a geometric communication network | 2023-10-17 | Paper |
| A simpler minimum spanning tree verification algorithm | 2022-12-16 | Paper |
| Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model | 2022-07-21 | Paper |
| A resource-competitive jamming defense | 2022-02-15 | Paper |
| Communication-efficient randomized consensus | 2022-02-15 | Paper |
| Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model | 2021-09-06 | Paper |
| A deterministic distributed algorithm for exact weighted all-pairs shortest paths in \(\tilde{O}(n^{3/2})\) rounds | 2019-09-19 | Paper |
| Faster agreement via a spectral method for detecting malicious behavior | 2019-06-20 | Paper |
| Dynamic graph connectivity in polylogarithmic worst case time | 2019-05-15 | Paper |
| Kinetic \(k\)-semi-Yao graph and its applications | 2018-11-19 | Paper |
| Byzantine Agreement in Expected Polynomial Time | 2018-08-02 | Paper |
| Maintaining minimum spanning trees in dynamic graphs | 2018-07-04 | Paper |
| Secure multi-party computation in large networks | 2017-08-31 | Paper |
| Simultaneous secrecy and reliability amplification for a general channel model | 2016-12-21 | Paper |
| A fully dynamic algorithm for maintaining the transitive closure | 2016-09-29 | Paper |
| An optimal EREW PRAM algorithm for minimum spanning tree verification | 2016-06-01 | Paper |
| Construction and impromptu repair of an MST in a distributed network with \(o(m)\) communication | 2016-03-23 | Paper |
| Kinetic reverse \(k\)-nearest neighbor problem | 2015-09-15 | Paper |
| Conflict on a communication channel | 2015-09-11 | Paper |
| Choosing a random peer | 2015-08-03 | Paper |
| A simple, faster method for kinetic proximity problems | 2015-05-12 | Paper |
| Lower bound for scalable Byzantine agreement | 2015-03-10 | Paper |
| Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary | 2015-03-02 | Paper |
| Kinetic data structures for all nearest neighbors and closest pair in the plane | 2015-02-17 | Paper |
| Sleeping on the job | 2014-12-12 | Paper |
| Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary | 2014-12-05 | Paper |
| Fast asynchronous Byzantine agreement and leader election with full information | 2014-11-18 | Paper |
| Byzantine agreement in polynomial expected time (extended abstract) | 2014-08-07 | Paper |
| Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary | 2014-02-17 | Paper |
| Lower bound for scalable Byzantine agreement | 2013-06-28 | Paper |
| Kinetic and Stationary Point-Set Embeddability for Plane Graphs | 2013-04-03 | Paper |
| Sleeping on the job: energy-efficient and robust broadcast for radio networks | 2011-11-07 | Paper |
| Scalable leader election | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579423 | 2010-08-06 | 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 |
| Randomized fully dynamic graph algorithms with polylogarithmic time per operation | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471327 | 2004-07-28 | Paper |
| A fully dynamic algorithm for maintaining the transitive closure | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553236 | 2002-11-04 | Paper |
| Maintaining minimum spanning forests in dynamic graphs | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769435 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234100 | 2002-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252752 | 2000-04-26 | Paper |
| Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology | 1999-06-29 | Paper |
| A simpler minimum spanning tree verification algorithm | 1997-05-28 | Paper |
| Limits on the power of parallel random access machines with weak forms of write conflict resolution | 1997-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875203 | 1996-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281540 | 1996-07-29 | Paper |
| On boolean decision trees with faulty nodes | 1994-09-19 | Paper |
| Optimal Randomized Algorithms for Local Sorting and Set-Maxima | 1993-05-17 | Paper |
| An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties | 1992-06-27 | Paper |
| A lower bound for the recognition of digraph properties | 1990-01-01 | Paper |
