| Publication | Date of Publication | Type |
|---|
| Perfect asynchronous MPC with linear communication overhead | 2024-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128564 | 2024-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128596 | 2024-04-15 | Paper |
| Reaching consensus for asynchronous distributed key generation | 2024-03-26 | Paper |
| Good-case Latency of Byzantine Broadcast | 2024-03-26 | Paper |
| Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement | 2024-03-26 | Paper |
| Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security | 2024-03-26 | Paper |
| BeeGees: Stayin' Alive in Chained BFT | 2024-03-26 | Paper |
| \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation | 2024-02-02 | Paper |
| Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083449 | 2023-12-08 | Paper |
| Corrigendum: Metric Embedding via Shortest Path Decompositions | 2023-11-14 | Paper |
| Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency | 2023-11-02 | Paper |
| Reaching consensus for asynchronous distributed key generation | 2023-09-11 | Paper |
| Asymptotically free broadcast in constant expected time via packed VSS | 2023-08-14 | Paper |
| Efficient perfectly secure computation with optimal resilience | 2023-04-13 | Paper |
| Communication complexity of Byzantine agreement, revisited | 2023-03-14 | Paper |
| Aggregatable subvector commitments for stateless cryptocurrencies | 2022-12-16 | Paper |
| Efficient perfectly secure computation with optimal resilience | 2022-10-04 | Paper |
| Revisiting asynchronous fault tolerant computation with optimal resilience | 2022-08-24 | Paper |
| Metric Embedding via Shortest Path Decompositions | 2022-04-20 | Paper |
| Ramsey spanning trees and their applications | 2021-05-03 | Paper |
| Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience | 2021-03-17 | Paper |
| Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience | 2021-03-15 | Paper |
| Communication Complexity of Byzantine Agreement, Revisited | 2021-01-20 | Paper |
| Asymptotically Optimal Validated Asynchronous Byzantine Agreement | 2021-01-20 | Paper |
| HotStuff | 2021-01-20 | Paper |
| Implementing Mediators with Asynchronous Cheap Talk | 2021-01-20 | Paper |
| Peaches, lemons, and cookies: designing auction markets with dispersed information | 2020-11-24 | Paper |
| Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs | 2019-09-02 | Paper |
| Metric embedding via shortest path decompositions | 2019-08-22 | Paper |
| The blockchain consensus layer and BFT | 2019-07-03 | Paper |
| Low-distortion inference of latent similarities from a multiplex social network | 2019-05-15 | Paper |
| On low dimensional local embeddings | 2019-05-06 | Paper |
| Using petal-decompositions to build a low stretch spanning tree | 2019-03-22 | Paper |
| Compact name-independent routing with minimum stretch | 2018-11-05 | Paper |
| Forbidden-set distance labels for graphs of bounded doubling dimension | 2018-10-30 | Paper |
| Distributed SSH key management with proactive RSA threshold signatures | 2018-08-10 | Paper |
| Highway dimension and provably efficient shortest path algorithms | 2018-08-02 | Paper |
| On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs | 2018-07-16 | Paper |
| Fully dynamic all-pairs shortest paths with worst-case update-time revisited | 2018-07-16 | Paper |
| Ramsey spanning trees and their applications | 2018-03-15 | Paper |
| Approximate nearest neighbor search in metrics of planar graphs | 2017-08-31 | Paper |
| Asymptotically tight bounds for composing ORAM with PIR | 2017-06-13 | Paper |
| Fully dynamic all-pairs shortest paths: breaking the \(O(n)\) barrier | 2017-03-22 | Paper |
| Asynchronous resource discovery | 2015-09-04 | Paper |
| Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity | 2015-08-21 | Paper |
| Compact routing on Euclidian metrics | 2015-08-03 | Paper |
| Byzantine disk paxos | 2015-08-03 | Paper |
| LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs | 2015-08-03 | Paper |
| Local embeddings of metric spaces | 2015-07-10 | Paper |
| Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs | 2015-06-26 | Paper |
| Low-distortion inference of latent similarities from a multiplex social network | 2015-06-11 | Paper |
| Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion | 2015-06-02 | Paper |
| Alternative routes in road networks | 2015-03-16 | Paper |
| Distributed computing meets game theory | 2015-03-10 | Paper |
| Object location using path separators | 2015-03-10 | Paper |
| Forbidden-set distance labels for graphs of bounded doubling dimension | 2015-03-02 | Paper |
| Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion | 2014-12-18 | Paper |
| An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience | 2014-12-12 | Paper |
| Advances in metric embedding theory | 2014-11-25 | Paper |
| Volume in general metric spaces | 2014-10-29 | Paper |
| Distributed protocols for leader election: a game-theoretic perspective | 2014-09-29 | Paper |
| Distance Labels with Optimal Local Stretch | 2014-07-01 | Paper |
| Highway dimension, shortest paths, and provably efficient algorithms | 2014-05-22 | Paper |
| Using petal-decompositions to build a low stretch spanning tree | 2014-05-13 | Paper |
| Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels | 2014-05-13 | Paper |
| Reconstructing approximate tree metrics | 2014-03-13 | Paper |
| Byzantine disk paxos: optimal resilience with Byzantine shared memory | 2013-06-13 | Paper |
| Probabilistic quorums for dynamic systems | 2013-06-07 | Paper |
| Hierarchical hub labelings for shortest paths | 2012-09-25 | Paper |
| Advances in metric embedding theory | 2011-12-02 | Paper |
| On approximate distance labels and routing schemes with affine stretch | 2011-10-28 | Paper |
| VC-dimension and shortest path algorithms | 2011-07-06 | Paper |
| Strong-diameter decompositions of minor free graphs | 2010-12-17 | Paper |
| Volume in general metric spaces | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579400 | 2010-08-06 | Paper |
| Probabilistic quorums for dynamic systems. (Extended abstract) | 2010-02-23 | Paper |
| Wait-free regular storage from Byzantine components | 2010-01-29 | Paper |
| Compact Multicast Routing | 2009-11-19 | Paper |
| Local embeddings of metric spaces | 2009-01-05 | Paper |
| Lower Bounds on Implementing Robust and Resilient Mediators | 2008-03-05 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Asynchronous resource discovery | 2006-06-30 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Routing with Improved Communication-Space Trade-Off | 2005-08-17 | Paper |
