Table of Contents

• PIM-trie: A Skew-resistant Trie for Processing-in-MemoryHongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu 0001, Charles McGuffey, Phillip B. Gibbons. 1-14 [doi]
• Quancurrent: A Concurrent Quantiles SketchShaked Elias-Zada, Arik Rinberg, Idit Keidar. 15-25 [doi]
• An Efficient Scheduler for Task-Parallel Interactive ApplicationsKyle Singer, Kunal Agrawal, I-Ting Angelina Lee. 27-38 [doi]
• Efficient Synchronization-Light Work StealingRafael Custódio, Hervé Paulino, Guilherme Rito. 39-49 [doi]
• Balanced Allocations in Batches: The Tower of Two ChoicesDimitrios Los, Thomas Sauerwald. 51-61 [doi]
• Are Parallel Algorithms Ready for Prime Time?Guy E. Blelloch. 63 [doi]
• On Parallel k-Center ClusteringSam Coy, Artur Czumaj, Gopinath Mishra. 65-75 [doi]
• Massively Parallel Tree Embeddings for High Dimensional SpacesAmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong. 77-88 [doi]
• Deterministic Massively Parallel Symmetry Breaking for Sparse GraphsManuela Fischer, Jeff Giliberti, Christoph Grunau. 89-100 [doi]
• Location-Sensitive String Problems in MPCJacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin. 101-111 [doi]
• Brief Announcement: Regular and Dyck Languages in MPCJacob Gilbert, MohammadTaghi Hajiaghayi. 113-116 [doi]
• An Associativity Threshold Phenomenon in Set-Associative CachesMichael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini. 117-127 [doi]
• Increment - and - Freeze: Every Cache, Everywhere, All of the TimeMichael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West. 129-139 [doi]
• Multidimensional Approximate Agreement with Asynchronous FallbackDiana Ghinea, Chen-Da Liu Zhang, Roger Wattenhofer. 141-151 [doi]
• A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is PossibleWenkai Dai, Klaus-Tycho Foerster, Stefan Schmid 0001. 153-163 [doi]
• In-network Allreduce with Multiple Spanning Trees on PolarFlyKartik Lakhotia, Kelly Isham, Laura Monroe, Maciej Besta, Torsten Hoefler, Fabrizio Petrini. 165-176 [doi]
• Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free ProgramsPedro Moreno, Ricardo Rocha 0001. 177-186 [doi]
• Transactional Composition of Nonblocking Data StructuresWentao Cai 0002, Haosen Wen, Michael L. Scott. 187-197 [doi]
• Protecting Locks Against Unbalanced Unlock()Vivek Shahare, Milind Chabbi, Nikhil Hegde. 199-211 [doi]
• Applying Hazard Pointers to More Concurrent Data StructuresJaehwang Jung, Janggun Lee, Jeonghyeon Kim, Jeehoon Kang. 213-226 [doi]
• Constant RMR System-wide Failure Resilient Durable Locks with Dynamic JoiningPrasad Jayanti, Siddhartha Jayanti, Anup Joshi. 227-237 [doi]
• Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity MaximizationAlireza Haqi, Hamid Zarrabi-Zadeh. 239-247 [doi]
• Nearly Optimal Parallel Algorithms for Longest Increasing SubsequenceNairen Cao, Shang-En Huang, Hsin-Hao Su. 249-259 [doi]
• Provably-Efficient and Internally-Deterministic Parallel Union-FindAlexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh. 261-271 [doi]
• Nearly Work-Efficient Parallel DFS in Undirected GraphsMohsen Ghaffari 0001, Christoph Grunau, Jiahao Qu. 273-283 [doi]
• The Connection Machine CM-5, Moore's Law, and the Future of Computational PerformanceBradley C. Kuszmaul, Charles E. Leiserson. 285-286 [doi]
• Brief Announcement: On Solving Recoverable Mutual Exclusion Under System-Wide FailuresSahil Dhoked, Wojciech Golab, Neeraj Mittal. 287-290 [doi]
• Brief Announcement: A Parallel Architecture for Dynamic Approximate MembershipGuy Even, Gabriel Marques Domingues, Parham Toutian. 291-294 [doi]
• Brief Announcement: Accelerate CNN Inference with Zoning Graph at Dynamic GranularityRuilong Ma, Xiang Yang, Qi Qi 0001, Jingyu Wang, Zirui Zhuang, Jing Wang, Xin Wang. 295-298 [doi]
• Brief Announcement: Optimized GPU-accelerated Feature Extraction for ORB-SLAM SystemsFilippo Muzzini, Nicola Capodieci, Roberto Cavicchioli, Benjamin Rouxel. 299-302 [doi]
• Brief Announcement: Is the Problem-Based Benchmark Suite Fearless with Rust?Javad Abdi, Guowei Zhang, Mark C. Jeffrey. 303-305 [doi]
• Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the CloudAniket Murhekar, David Arbour, Tung Mai, Anup B. Rao. 307-310 [doi]
• Brief Announcement: Streaming Balanced ClusteringHossein Esfandiari, Vahab Mirrokni, Peilin Zhong. 311-314 [doi]
• A Simple and Efficient Parallel Laplacian SolverSushant Sachdeva, Yibin Zhao. 315-325 [doi]
• Parallel Longest Increasing Subsequence and van Emde Boas TreesYan Gu 0001, Ziyang Men, Zheqi Shen, Yihan Sun 0001, Zijin Wan. 327-340 [doi]
• High-Performance and Flexible Parallel Algorithms for Semisort and Related ProblemsXiaojun Dong 0001, Yunshu Wu, Zhongqi Wang, Laxman Dhulipala, Yan Gu 0001, Yihan Sun 0001. 341-353 [doi]
• Optimal Parallel Sorting with Comparison ErrorsMichael T. Goodrich, Riko Jacob. 355-365 [doi]
• Quadratic Speedups in Parallel Sampling from Determinantal DistributionsNima Anari, Callum Burgess, Kevin Tian, Thuy Duong Vuong. 367-377 [doi]
• Multiplying 2 × 2 Sub-Blocks Using 4 MultiplicationsYoav Moran, Oded Schwartz. 379-390 [doi]
• Parallel Memory-Independent Communication Bounds for SYRKHussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse. 391-401 [doi]
• Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring DemandsHarald Räcke, Stefan Schmid 0001, Ruslan Zabrodin. 403-413 [doi]
• Partitioning Hypergraphs is Hard: Models, Inapproximability, and ApplicationsPál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman. 415-425 [doi]
• Brief Announcement: Communication Optimal Sparse LU Factorization for Planar MatricesPiyush Sao, Xiaoye Sherry Li. 427-430 [doi]
• Adaptive Massively Parallel Connectivity in Optimal SpaceRustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto. 431-441 [doi]
• Fast Dynamic Programming in Trees in the MPC ModelChetan Gupta 0002, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi 0003. 443-453 [doi]
• Coloring Fast with BroadcastsMaxime Flin, Mohsen Ghaffari 0001, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin. 455-465 [doi]
• Optimal Round and Sample-Size Complexity for Partitioning in Parallel SortingWentao Yang, Vipul Harsh, Edgar Solomonik. 467-478 [doi]
• Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and WriteLewis Tseng, Neo Zhou, Cole Dumas, Tigran Bantikyan, Roberto Palmieri. 479-488 [doi]
• Brief Announcement: List Defective Colorings: Distributed Algorithms and ApplicationsMarc Fuchs, Fabian Kuhn. 489-492 [doi]