Table of Contents

• Session details: Session 3C: ColoringMagnús M. Halldórsson. [doi]
• Session details: Session 2D: ConsensusChryssis Georgiou. [doi]
• Session details: Session 1B: Shared Memory TheoryDan Alistarh. [doi]
• Session details: Session 1C: Wireless NetworksJanna Burman. [doi]
• Session details: Session 3D: Graphs and PopulationMichael Elkin. [doi]
• Session details: Session 1A: Persistent MemoryIdit Keidar. [doi]
• Session details: Session 2A: Approximation and LearningIdit Keidar. [doi]
• Session details: Session 2C: Security, Blockchains, and ReplicationGregory V. Chockler. [doi]
• Session details: Session 1D: Graph AlgorithmsPeter Robinson. [doi]
• Session details: Session 3A: CongestIdit Keidar. [doi]
• Session details: Session 2B: Routing and Leader ElectionMohsen Ghaffari. [doi]
• 2018 Edsger W. Dijkstra Prize in Distributed ComputingYehuda Afek, Idit Keidar, Boaz Patt-Shamir, Sergio Rajsbaum, Ulrich Schmid 0001, Gadi Taubenfeld. 1 [doi]
• 2018 Doctoral Dissertation AwardLorenzo Alvisi, Idit Keidar, Andréa W. Richa, Alexander A. Schwarzmann. 3 [doi]
• Overview of Persistent Memory in Distributed Systems Architecture - Past, Present, FutureRobert Peglar. 5 [doi]
• Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile MemoryHagit Attiya, Ohad Ben-Baruch, Danny Hendler. 7-16 [doi]
• Recoverable Mutual Exclusion Under System-Wide FailuresWojciech Golab, Danny Hendler. 17-26 [doi]
• Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR ComplexityAdam Alon, Adam Morrison 0001. 27-36 [doi]
• Brief Announcement: Persistent Multi-Word Compare-and-SwapMatej Pavlovic, Alex Kogan, Virendra J. Marathe, Tim Harris 0001. 37-39 [doi]
• Separating Lock-Freedom from Wait-FreedomHagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin. 41-50 [doi]
• Passing Messages while Sharing MemoryMarcos K. Aguilera, Naama Ben-David, Irina Calciu, Rachid Guerraoui, Erez Petrank, Sam Toueg. 51-60 [doi]
• Revisionist Simulations: A New Approach to Proving Space Lower BoundsFaith Ellen, Rati Gelashvili, Leqi Zhu. 61-70 [doi]
• On the Classification of Deterministic Objects via Set Agreement PowerDavid Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg. 71-80 [doi]
• Brief Announcement: Specification and Implementation of Replicated List: The Jupiter Protocol RevisitedHengfeng Wei, Yu Huang 0002, Jian Lu 0001. 81-83 [doi]
• Leveraging Indirect Signaling for Topology Inference and Fast BroadcastMagnús M. Halldórsson, Tigran Tonoyan. 85-93 [doi]
• The Energy Complexity of BroadcastYi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie. 95-104 [doi]
• Deterministic Digital Clustering of Wireless Ad Hoc NetworksTomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, Grzegorz Stachowiak. 105-114 [doi]
• Brief Announcement: Broadcast in Radio Networks, Time vs. Energy TradeoffsMarek Klonowski, Dominik Pajak. 115-117 [doi]
• Round- and Message-Optimal Distributed Graph AlgorithmsBernhard Haeupler, D. Ellis Hershkowitz, David Wajc. 119-128 [doi]
• Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex CoverMohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld. 129-138 [doi]
• Distributed Spanner ApproximationKeren Censor Hillel, Michal Dory. 139-148 [doi]
• Distributed Approximation of Minimum k-edge-connected Spanning SubgraphsMichal Dory. 149-158 [doi]
• Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal GraphsChristian Konrad, Viktor Zamaraev. 159-161 [doi]
• Brief Announcement: Simple and Local Independent Set ApproximationRavi B. Boppana, Magnús M. Halldórsson, Dror Rawitz. 163-165 [doi]
• Data Summarization and Distributed ComputationGraham Cormode. 167-168 [doi]
• The Convergence of Stochastic Gradient Descent in Asynchronous Shared MemoryDan Alistarh, Christopher De Sa, Nikola Konstantinov. 169-178 [doi]
• Optimal Gossip Algorithms for Exact and Approximate Quantile ComputationsBernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su. 179-188 [doi]
• On Local Distributed Sampling and CountingWeiming Feng, Yitong Yin. 189-198 [doi]
• A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) RoundsUdit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi. 199-205 [doi]
• Near-Optimal Distributed Routing with Low MemoryMichael Elkin, Ofer Neiman. 207-216 [doi]
• Fair Leader Election for Rational Agents in Asynchronous Rings and NetworksAssaf Yifrach, Yishay Mansour. 217-226 [doi]
• Leader Election in Well-Connected GraphsSeth Gilbert, Peter Robinson 0002, Suman Sourav. 227-236 [doi]
• Brief Announcement: Beeping a Time-Optimal Leader ElectionFabien Dufoulon, Janna Burman, Joffroy Beauquier. 237-239 [doi]
• Brief Announcement: Graph Exploration Using Constant-Size Memory and StorageNaoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi. 241-243 [doi]
• Atomic Cross-Chain SwapsMaurice Herlihy. 245-254 [doi]
• Interactive Distributed ProofsGillat Kol, Rotem Oshman, Raghuvansh R. Saxena. 255-264 [doi]
• Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation RevisitedRishabh Bhadauria, Ashish Choudhury. 265-267 [doi]
• Brief Announcement: Sustainable Blockchains through Proof of eXerciseAli Shoker. 269-271 [doi]
• Brief Announcement: Partially Replicated Causally Consistent Shared MemoryZhuolun Xiang, Nitin H. Vaidya. 273-275 [doi]
• Brief Announcement: Optimal Record and Replay under Causal ConsistencyRussell L. Jones, Muhammad Samir Khan, Nitin H. Vaidya. 277-279 [doi]
• Brief Announcement: MUSIC: Multi-Site Entry Consistencyfor Geo-Distributed ServicesBharath Balasubramanian, Richard D. Schlichting, Pamela Zave. 281-284 [doi]
• SilenceGuy Goren, Yoram Moses. 285-294 [doi]
• Almost-Surely Terminating Asynchronous Byzantine Agreement RevisitedLaasya Bangalore, Ashish Choudhury, Arpita Patra. 295-304 [doi]
• Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus DynamicsMohsen Ghaffari, Johannes Lengler. 305-313 [doi]
• Sublinear Message Bounds for Randomized AgreementJohn Augustine, Anisur Rahaman Molla, Gopal Pandurangan. 315-324 [doi]
• Tight Bounds for Asymptotic and Approximate ConsensusMatthias Függer, Thomas Nowak, Manfred Schwarz. 325-334 [doi]
• Barriers due to Congestion and Two Ways to Deal With ThemKeren Censor Hillel. 335 [doi]
• Sublinear-Time Quantum Computation of the Diameter in CONGEST NetworksFrançois Le Gall, Frédéric Magniez. 337-346 [doi]
• Property Testing of Planarity in the CONGEST modelReut Levi, Moti Medina, Dana Ron. 347-356 [doi]
• Congested Clique Algorithms for the Minimum Cut ProblemMohsen Ghaffari, Krzysztof Nowicki 0002. 357-366 [doi]
• Locking Timestamps versus Locking ObjectsMarcos K. Aguilera, Tudor David, Rachid Guerraoui, Junxiong Wang. 367-376 [doi]
• Relaxed Schedulers Can Efficiently Parallelize Iterative AlgorithmsDan Alistarh, Trevor Brown 0001, Justin Kopinsky, Giorgi Nadiradze. 377-386 [doi]
• An Asynchronous Computability Theorem for Fair AdversariesPetr Kuznetsov, Thibault Rieutord, Yuan He 0003. 387-396 [doi]
• Population Stability: Regulating Size in the Presence of an AdversaryShafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro, Adam Sealfon. 397-406 [doi]
• Brief Announcement: 2D-Stack - A Scalable Lock-Free Stack Design that Continuously Relaxes Semantics for Better PerformanceAdones Rukundo, Aras Atalar, Philippas Tsigas. 407-409 [doi]
• Brief Announcement: Performance Prediction for Coarse-Grained LockingVitaly Aksenov, Dan Alistarh, Petr Kuznetsov. 411-413 [doi]
• Brief Announcement: Automatic Log Enhancement for Fault DiagnosisTong Jia, Ying Li 0015, Zhonghai Wu. 415-417 [doi]
• Distributed Coloring in Sparse Graphs with Fewer ColorsPierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet. 419-425 [doi]
• Improved Distributed Delta-ColoringMohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus. 427-436 [doi]
• Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth ModelsLeonid Barenboim, Michael Elkin, Uri Goldenberg. 437-446 [doi]
• Lower Bounds for Searching Robots, some FaultyAndrey Kupavskii, Emo Welzl. 447-453 [doi]
• Distributed Uniformity TestingOrr Fischer, Uri Meir, Rotem Oshman. 455-464 [doi]
• Minor Excluded Network Families Admit Fast Distributed AlgorithmsBernhard Haeupler, Jason Li, Goran Zuzic. 465-474 [doi]
• Brief Announcement: Population Protocols Are FastAdrian Kosowski, Przemyslaw Uznanski. 475-477 [doi]
• Brief Announcement: Space-Optimal Naming in Population ProtocolsJanna Burman, Joffroy Beauquier, Devan Sohier. 479-481 [doi]
• Brief Announcement: A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle SystemsSarah Cannon, Joshua J. Daymude, Cem Gokmen, Dana Randall, Andréa W. Richa. 483-485 [doi]
• A Brief Tutorial on Distributed and Concurrent Machine LearningDan Alistarh. 487-488 [doi]
• Erasure Coding in Object Stores: Challenges and OpportunitiesLewis Tseng. 489 [doi]
• Tutorial: Consistency Choices in Modern Distributed SystemsAlexey Gotsman. 491 [doi]
• From Self-Stabilization to Self-Optimization: Principles of Distributed Network DesignStefan Schmid 0001. 493 [doi]