Table of Contents

• 2019 Edsger W. Dijkstra Prize in Distributed ComputingLorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela. 1 [doi]
• 2019 Principles of Distributed Computing Doctoral Dissertation AwardPrasad Jayanti, Nancy A. Lynch, Boaz Patt-Shamir, Ulrich Schmid 0001. 2 [doi]
• Local Computation AlgorithmsRonitt Rubinfeld. 3 [doi]
• Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown AttributesJurek Czyzowicz, Leszek Gasieniec, Ryan Killick, Evangelos Kranakis. 4-13 [doi]
• Composable Computation in Discrete Chemical Reaction NetworksEric E. Severson, David Haley, David Doty. 14-23 [doi]
• How to Spread a Rumor: Call Your Neighbors or Take a Walk?George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan. 24-33 [doi]
• Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population ProtocolsDavid Doty, Mahsa Eftekhari. 34-42 [doi]
• On Counting the Population SizePetra Berenbrink, Dominik Kaaser, Tomasz Radzik. 43-52 [doi]
• Self-Stabilizing Leader ElectionHsueh-Ping Chen, Ho-Lin Chen. 53-59 [doi]
• Logarithmic Expected-Time Leader Election in Population Protocol ModelYuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa. 60-62 [doi]
• On Site Fidelity and the Price of Ignorance in Swarm Robotic Central Place Foraging AlgorithmsAbhinav Aggarwal, G. Matthew Fricke, Diksha Gupta, Melanie E. Moses. 63-65 [doi]
• Improved Distributed Expander Decomposition and Nearly Optimal Triangle EnumerationYi-Jun Chang, Thatchaphol Saranurak. 66-73 [doi]
• Fast Approximate Shortest Paths in the Congested CliqueKeren Censor Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf. 74-83 [doi]
• Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE ModelTaisuke Izumi, François Le Gall. 84-93 [doi]
• Deterministic Distributed Dominating Set Approximation in the CONGEST ModelJanosch Deurer, Fabian Kuhn, Yannic Maus. 94-103 [doi]
• Optimal Distributed Covering AlgorithmsRan Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman. 104-106 [doi]
• Secure Distributed Computing Made (Nearly) OptimalMerav Parter, Eylon Yogev. 107-116 [doi]
• With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for RoutingAvery Miller, Boaz Patt-Shamir, Will Rosenbaum. 117-126 [doi]
• Plain SINR is Enough!Magnús M. Halldórsson, Tigran Tonoyan. 127-136 [doi]
• Efficient Multiparty Interactive Coding for Insertions, Deletions, and SubstitutionsRan Gelles, Yael Tauman Kalai, Govind Ramnarayan. 137-146 [doi]
• Multiparty Interactive Communication with Private ChannelsAbhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia. 147-149 [doi]
• Coded State Machine - Scaling State Machine Execution under Byzantine FaultsSongze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath. 150-152 [doi]
• On Termination of a Flooding ProcessWalter Hussak, Amitabh Trehan. 153-155 [doi]
• Towards a Theory of Randomized Shared Memory AlgorithmsPhilipp Woelfel. 156 [doi]
• Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual ExclusionZahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel. 157-166 [doi]
• Constant Amortized RMR Abortable Mutex for CC and DSMPrasad V. Jayanti, Siddhartha Jayanti. 167-176 [doi]
• A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSMPrasad Jayanti, Siddhartha V. Jayanti, Anup Joshi. 177-186 [doi]
• Randomized Concurrent Set Union and Generalized Wake-UpSiddhartha V. Jayanti, Robert E. Tarjan, Enric Boix-Adserà. 187-196 [doi]
• Strongly Linearizable Implementations of Snapshots and Other TypesSean Ovens, Philipp Woelfel. 197-206 [doi]
• Fast Concurrent Data SketchesArik Rinberg, Alexander Spiegelman, Edward Bortnikov, Eshcar Hillel, Idit Keidar, Hadar Serviansky. 207-208 [doi]
• Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked SystemsChryssis Georgiou, Oskar Lundström, Elad Michael Schiller. 209-211 [doi]
• The Recoverable Consensus HierarchyWojciech Golab. 212-214 [doi]
• How Fast Reads Affect Multi-Valued Register SimulationsSoma Chaudhuri, Reginald Frank, Jennifer L. Welch. 215-217 [doi]
• Topological Characterization of Consensus under General Message AdversariesThomas Nowak, Ulrich Schmid 0001, Kyrill Winkler. 218-227 [doi]
• Can Distributed Uniformity Testing Be Local?Uri Meir, Dor Minzer, Rotem Oshman. 228-237 [doi]
• Hardness of Distributed OptimizationNir Bachrach, Keren Censor Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz. 238-247 [doi]
• Broadcast Congested Clique: Planted Cliques and Pseudorandom GeneratorsLijie Chen, Ofer Grossman. 248-255 [doi]
• Connectivity Lower Bounds in Broadcast Congested CliqueShreyas Pai, Sriram V. Pemmaraju. 256-258 [doi]
• Does Preprocessing Help under Congestion?Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, Stefan Schmid 0001. 259-261 [doi]
• The Distributed Complexity of Locally Checkable Problems on Paths is DecidableAlkida Balliu, Sebastian Brandt 0002, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela. 262-271 [doi]
• Hardness of Exact Distance Queries in Sparse Graphs Through Hub LabelingAdrian Kosowski, Przemyslaw Uznanski, Laurent Viennot. 272-279 [doi]
• On the Complexity of Distributed Splitting ProblemsPhilipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto. 280-289 [doi]
• On the Use of Randomness in Local Distributed Graph AlgorithmsMohsen Ghaffari, Fabian Kuhn. 290-299 [doi]
• Message Reduction in the LOCAL Model is a Free LunchShimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten. 300-302 [doi]
• P-SLOCAL-Completeness of Maximum Independent Set ApproximationYannic Maus. 303-305 [doi]
• Engineering Distributed Systems that We Can Trust (and Also Run)Ilya Sergey. 306 [doi]
• The Consensus Number of a CryptocurrencyRachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi. 307-316 [doi]
• Communication Complexity of Byzantine Agreement, RevisitedIttai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren 0001, Elaine Shi. 317-326 [doi]
• Exact Byzantine Consensus on Undirected Graphs under Local Broadcast ModelMuhammad Samir Khan, Syed Shalan Naqvi, Nitin H. Vaidya. 327-336 [doi]
• Asymptotically Optimal Validated Asynchronous Byzantine AgreementIttai Abraham, Dahlia Malkhi, Alexander Spiegelman. 337-346 [doi]
• HotStuff: BFT Consensus with Linearity and ResponsivenessMaofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, Ittai Abraham. 347-356 [doi]
• Fault Tolerant Gradient Clock SynchronizationJohannes Bund, Christoph Lenzen, Will Rosenbaum. 357-365 [doi]
• Bootstrapping Public Blockchains Without a Trusted SetupAbhinav Aggarwal, Mahnush Movahedi, Jared Saia, Mahdi Zamani. 366-368 [doi]
• Hardness of Minimal Symmetry Breaking in Distributed ComputingAlkida Balliu, Juho Hirvonen, Dennis Olivetti, Jukka Suomela. 369-378 [doi]
• An Automatic Speedup Theorem for Distributed ProblemsSebastian Brandt. 379-388 [doi]
• A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local LemmaSebastian Brandt 0002, Yannic Maus, Jara Uitto. 389-398 [doi]
• Reconfigurable Atomic Transaction CommitManuel Bravo, Alexey Gotsman. 399-408 [doi]
• The Impact of RDMA on AgreementMarcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Virendra Marathe, Igor Zablotchi. 409-418 [doi]
• Hyaline: Fast and Transparent Lock-Free Memory ReclamationRuslan Nikolaev 0001, Binoy Ravindran. 419-421 [doi]
• Layering Data Structures over Skip Graphs for Increased NUMA LocalitySamuel Thomas, Hammurabi Mendes. 422-424 [doi]
• Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An AlgorithmZhuolun Xiang, Nitin H. Vaidya. 425-434 [doi]
• Vorpal: Vector Clock Ordering For Large Persistent Memory SystemsKunal Korgaonkar, Joseph Izraelevitz, Jishen Zhao, Steven Swanson. 435-444 [doi]
• On the Parallels between Paxos and Raft, and how to Port OptimizationsZhaoguo Wang, Changgeng Zhao, Shuai Mu 0001, Haibo Chen, Jinyang Li 0001. 445-454 [doi]
• Linearizable State Machine Replication of State-Based CRDTs without LogsJan Skrzypczak, Florian Schintke, Thorsten Schütt. 455-457 [doi]
• On Mixing Eventual and Strong Consistency: Bayou RevisitedMaciej Kokocinski, Tadeusz Kobus, Pawel T. Wojciechowski. 458-460 [doi]
• Massively Parallel Algorithms for Finding Well-Connected Components in Sparse GraphsSepehr Assadi, Xiaorui Sun, Omri Weinstein. 461-470 [doi]
• The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local ComputationYi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, Yufan Zheng. 471-480 [doi]
• Massively Parallel Computation of Matching and MIS in Sparse GraphsSoheil Behnezhad, Sebastian Brandt 0002, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto. 481-490 [doi]
• Weighted Matchings via Unweighted AugmentationsBuddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson. 491-500 [doi]
• Implementing Mediators with Asynchronous Cheap TalkIttai Abraham, Danny Dolev, Ivan Geffner, Joseph Y. Halpern. 501-510 [doi]
• Distributed Minimum Degree Spanning TreesMichael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport. 511-520 [doi]
• Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning SubgraphMichal Dory, Mohsen Ghaffari. 521-530 [doi]
• Near-Additive Spanners In Low Polynomial Deterministic CONGEST TimeMichael Elkin, Shaked Matar. 531-540 [doi]
• A Trivial Yet Optimal Solution to Vertex Fault Tolerant SpannersGreg Bodwin, Shyamal Patel. 541-543 [doi]
• From Classical to Blockchain Consensus: What Are the Exact Algorithms?Yanhong A. Liu, Scott D. Stoller. 544-545 [doi]
• Byzantine Fault Tolerant State Machine Replication in Any Programming LanguageEthan Buchman. 546 [doi]
• Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network UpdatesKlaus-Tycho Foerster. 547-548 [doi]
• Tutorial: Specifying, Implementing, and Verifying Algorithms for Persistent MemoryDiego Cepeda, Sakib Chowdhury, Wojciech Golab. 549 [doi]