Table of Contents

• Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity CertificatesMarcel Bezdrighin, Michael Elkin, Mohsen Ghaffari 0001, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon. 1-10 [doi]
• Fully Polynomial-Time Distributed Computation in Low-Treewidth GraphsTaisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman. 11-22 [doi]
• Adaptive Massively Parallel Algorithms for Cut ProblemsMohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh. 23-33 [doi]
• Massively Parallel Algorithms for b-MatchingMohsen Ghaffari 0001, Christoph Grunau, Slobodan Mitrovic. 35-44 [doi]
• Average Awake Complexity of MIS and MatchingMohsen Ghaffari 0001, Julian Portmann. 45-55 [doi]
• Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling MetricsDavid Eppstein, Hadi Khodabandeh. 57-59 [doi]
• Keynote Talk: Large Scale Parallel Sparse Matrix Streaming Graph/Network AnalysisJeremy Kepner. 61 [doi]
• Preparing for Disaster: Leveraging Precomputation to Efficiently Repair Graph Structures Upon FailuresCalvin Newport, Nitin H. Vaidya, Alex Weaver. 63-74 [doi]
• The Energy Complexity of Las Vegas Leader ElectionYi-Jun Chang, Shunhua Jiang. 75-86 [doi]
• A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash TablesJohn Augustine, Soumyottam Chatterjee, Gopal Pandurangan. 87-98 [doi]
• Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through CollusionThorsten Götte, Christian Scheideler. 99-101 [doi]
• Brief Announcement: Composable Dynamic Secure EmulationPierre Civit, Maria Potop-Butucaru. 103-105 [doi]
• Robust and Optimal Contention Resolution without Collision DetectionYonggang Jiang, Chaodong Zheng. 107-118 [doi]
• Contention Resolution for Coded Radio NetworksMichael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Médard. 119-130 [doi]
• Achieving Sublinear Complexity under Constant T in T-interval Dynamic NetworksRuomu Hou, Irvan Jahja, Yucheng Sun, Jiyan Wu, Haifeng Yu. 131-141 [doi]
• Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast SchedulesJesper Larsson Träff. 143-146 [doi]
• Automatic HBM Management: Models and AlgorithmsDaniel DeLayo, Kenny Zhang, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Rathish Das, Benjamin Moseley, Cynthia A. Phillips. 147-159 [doi]
• Competitive Algorithms for Block-Aware CachingChristian Coester, Roie Levin, Joseph (Seffi) Naor, Ohad Talmon. 161-172 [doi]
• Brief Announcement: Spatial Locality and Granularity Change in CachingNathan Beckmann, Phillip B. Gibbons, Charles McGuffey. 173-175 [doi]
• Parallel Shortest Paths with Negative Edge WeightsNairen Cao, Jeremy T. Fineman, Katina Russell. 177-190 [doi]
• Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph ProblemsQuanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun. 191-204 [doi]
• Online Parallel Paging with Optimal MakespanKunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato. 205-216 [doi]
• PREP-UC: A Practical Replicated Persistent Universal ConstructionGaetano C. Coccimiglio, Trevor Alexander Brown, Srivatsan Ravi. 217-229 [doi]
• Keynote Talk: Algorithm Improvement: How Fast Has It Been and How Much Farther Can It Go?Neil Thompson. 231 [doi]
• Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph ClusteringTom Tseng, Laxman Dhulipala, Julian Shun. 233-245 [doi]
• Scalable Fine-Grained Parallel Cycle Enumeration AlgorithmsJovan Blanusa, Paolo Ienne, Kubilay Atasu. 247-258 [doi]
• Parallel Cover Trees and their ApplicationsYan Gu 0001, Zachary Napier, Yihan Sun 0001, Letong Wang. 259-272 [doi]
• Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficientZheqi Shen, Zijin Wan, Yan Gu 0001, Yihan Sun 0001. 273-286 [doi]
• Brief Announcement: A Parallel (Δ, Γ)-Stepping Algorithm for the Constrained Shortest Path ProblemTayebeh Bahreini, Nathan Fisher, Daniel Grosu. 287-289 [doi]
• Brief Announcement: Faster Stencil Computations using Gaussian ApproximationsZafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu. 291-293 [doi]
• A NUMA-Aware Recoverable Mutex LockAhmed Fahmy, Wojciech M. Golab. 295-305 [doi]
• wCQ: A Fast Wait-Free Queue with Bounded Memory UsageRuslan Nikolaev 0001, Binoy Ravindran. 307-319 [doi]
• HybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing ArchitecturesJiwon Choe, Andrew Crotty, Tali Moreshet, Maurice Herlihy, R. Iris Bahar. 321-332 [doi]
• Performance Analysis and Modelling of Concurrent Multi-access Data StructuresAdones Rukundo, Aras Atalar, Philippas Tsigas. 333-344 [doi]
• The k-Server with Preferences ProblemJannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide. 345-356 [doi]
• Permutation Predictions for Non-Clairvoyant SchedulingAlexander Lindermayr, Nicole Megow. 357-368 [doi]
• Balancing Flow Time and Energy ConsumptionSami Davies, Samir Khuller, Shirley Zhang. 369-380 [doi]
• Brief Announcement: Nested Active-Time SchedulingNairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh. 381-383 [doi]
• Brief Announcement: Towards a More Robust Algorithm for Flow Time Scheduling with PredictionsTianming Zhao, Chunhao Li, Wei Li 0058, Albert Y. Zomaya. 385-388 [doi]
• Balanced Allocations in Batches: Simplified and GeneralizedDimitrios Los, Thomas Sauerwald. 389-399 [doi]
• Approximate Dynamic Balanced Graph PartitioningHarald Räcke, Stefan Schmid 0001, Ruslan Zabrodin. 401-409 [doi]
• Bamboo Trimming Revisited: Simple Algorithms Can Do Well TooJohn Kuszmaul. 411-417 [doi]
• Brief Announcement: Tight Bounds for Repeated Balls-into-BinsDimitrios Los, Thomas Sauerwald. 419-421 [doi]
• I/O-Optimal Algorithms for Symmetric Linear Algebra KernelsOlivier Beaumont, Lionel Eyraud-Dubois, Julien Langou, Mathieu Vérité. 423-433 [doi]
• Sparse Matrix Multiplication in the Low-Bandwidth ModelChetan Gupta 0002, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela. 435-444 [doi]
• Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower BoundsHussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse. 445-448 [doi]
• Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication AlgorithmsLorenzo De Stefani. 449-452 [doi]