| 2020 | Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. | Sebastian Brandt, Dennis Olivetti |
| 2020 | Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovsz Local Lemma. | Sebastian Brandt, Christoph Grunau, Vclav Rozhon |
| 2019 | HotStuff: BFT Consensus with Linearity and Responsiveness. | Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, Ittai Abraham |
| 2019 | Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm. | Zhuolun Xiang, Nitin H. Vaidya |
| 2019 | Towards a Theory of Randomized Shared Memory Algorithms. | Philipp Woelfel |
| 2019 | On the Parallels between Paxos and Raft, and how to Port Optimizations. | Zhaoguo Wang, Changgeng Zhao, Shuai Mu, Haibo Chen, Jinyang Li |
| 2019 | Layering Data Structures over Skip Graphs for Increased NUMA Locality. | Samuel Thomas, Hammurabi Mendes |
| 2019 | Logarithmic Expected-Time Leader Election in Population Protocol Model. | Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa |
| 2019 | Linearizable State Machine Replication of State-Based CRDTs without Logs. | Jan Skrzypczak, Florian Schintke, Thorsten Schtt |
| 2019 | Composable Computation in Discrete Chemical Reaction Networks. | Eric E. Severson, David Haley, David Doty |
| 2019 | Engineering Distributed Systems that We Can Trust (and Also Run). | Ilya Sergey |
| 2019 | Local Computation Algorithms. | Ronitt Rubinfeld |
| 2019 | Fast Concurrent Data Sketches. | Arik Rinberg, Alexander Spiegelman, Edward Bortnikov, Eshcar Hillel, Idit Keidar, Hadar Serviansky |
| 2019 | Secure Distributed Computing Made (Nearly) Optimal. | Merav Parter, Eylon Yogev |
| 2019 | Connectivity Lower Bounds in Broadcast Congested Clique. | Shreyas Pai, Sriram V. Pemmaraju |
| 2019 | Strongly Linearizable Implementations of Snapshots and Other Types. | Sean Ovens, Philipp Woelfel |
| 2019 | Topological Characterization of Consensus under General Message Adversaries. | Thomas Nowak, Ulrich Schmid, Kyrill Winkler |
| 2019 | With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. | Avery Miller, Boaz Patt-Shamir, Will Rosenbaum |
| 2019 | Can Distributed Uniformity Testing Be Local? | Uri Meir, Dor Minzer, Rotem Oshman |
| 2019 | P-SLOCAL-Completeness of Maximum Independent Set Approximation. | Yannic Maus |
| 2019 | From Classical to Blockchain Consensus: What Are the Exact Algorithms? | Yanhong A. Liu, Scott D. Stoller |
| 2019 | Coded State Machine - Scaling State Machine Execution under Byzantine Faults. | Songze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath |
| 2019 | Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. | Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot |
| 2019 | Vorpal: Vector Clock Ordering For Large Persistent Memory Systems. | Kunal Korgaonkar, Joseph Izraelevitz, Jishen Zhao, Steven Swanson |
| 2019 | On Mixing Eventual and Strong Consistency: Bayou Revisited. | Maciej Kokocinski, Tadeusz Kobus, Pawel T. Wojciechowski |