Wait-free Algorithms: the Burden of the Past
Durable and Writable Universal Primitives with Dynamic Joining
Byzantine Consensus is Θ(n2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
Distributed Computing With the Cloud