Table of Contents

• Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense InstancesJan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos. 1-16 [doi]
• Applying Fast Fourier Transforms to Accelerate Spatially and Temporally Inhomogeneous Stencil ComputationsRussell Bentley, Rezaul Chowdhury, Aaron Gregory, Michael Santomauro. 17-33 [doi]
• A Deterministic Work-Depth Tradeoff for Strongly Connected ComponentsAdam Karczmarz, Bartlomiej Lewandowski. 34-45 [doi]
• Approximation Hardness of Resource SchedulingRathish Das, Hao Sun. 46-61 [doi]
• ABD-HFL: Byzantine-resistant Decentralized Hierarchical Federated LearningTengfei An, Serge Fdida, Maria Potop-Butucaru, Sébastien Tixeuil. 62-74 [doi]
• Towards Zero Spawn Overhead: Work Stealing Without DequesAaron Handleman, Kyle Singer, Tao B. Schardl, I-Ting Angelina Lee. 75-88 [doi]
• Approximate Agreement Algorithms for Byzantine Collaborative LearningMélanie Cambus, Darya Melnyk, Tijana Milentijevic, Stefan Schmid 0001. 89-100 [doi]
• Dataflow-Specific Algorithms for Resource-Constrained Scheduling and Memory DesignAbhishek Bhattacharjee, Quanquan C. Liu, Rajit Manohar, Raghavendra Pradyumna Pothukuchi, Muhammed Ugur. 101-115 [doi]
• TLF: Transactional Lock FusionGuy E. Blelloch, Zachary Kent, Yuanhao Wei. 116-130 [doi]
• CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor SearchMagdalen Dobson Manohar, Yuanhao Wei, Guy E. Blelloch. 131-143 [doi]
• Non-preemptive Throughput Maximization under Time-varying CapacityAniket Murhekar, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang. 144-157 [doi]
• Eliminating Bank Conflicts in GPU MergesortKyle Berney, Nodari Sitchinava. 158-170 [doi]
• Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only)Kunal Agrawal 0001, Michael A. Bender, Kirk Pruhs, Benjamin Moseley, Clifford Stein 0001. 171-180 [doi]
• Optimal quantum sampling on distributed databasesLongyun Chen, Jingcheng Liu, Penghui Yao. 181-192 [doi]
• ReFINE: A Reactive and Fine-Grained Scheduling Framework For Concurrency on General Purpose GPUsGuin Gilman, Robert J. Walls. 193-209 [doi]
• A New Algorithm for Online Scheduling of Rigid Task Graphs with Near-Optimal Competitive RatioLucas Perotin, Hongyang Sun 0001, Padma Raghavan. 210-224 [doi]
• Parallel Batch-Dynamic Coreness Decomposition with Worst-Case GuaranteesMohsen Ghaffari, Jaehyun Koo. 225-239 [doi]
• Tight Bounds for Online Balanced Partitioning in the Generalized Learning ModelHarald Räcke, Stefan Schmid 0001, Ruslan Zabrodin. 240-254 [doi]
• Decoupled Fallback: A Portable Single-Pass GPU ScanThomas Smith, Raph Levien, John D. Owens. 255-268 [doi]
• POPQC: Parallel Optimization for Quantum CircuitsPengyu Liu, Jatin Arora 0002, Mingkuan Xu, Umut A. Acar. 269-283 [doi]
• Listening Efficient Contention Resolution for Semi-batch Arrivals without Collision DetectionYuntian Xie, Chaodong Zheng. 284-298 [doi]
• Parallel Batch-Dynamic Algorithms for Spanners, and ExtensionsMohsen Ghaffari, Jaehyun Koo. 299-313 [doi]
• Reconciling Hardware Transactional Memory and Persistent Programming with Buffered DurabilityMingzhe Du, Ziheng Su, Michael L. Scott. 314-327 [doi]
• The Impact of Partial Computations on the Red-Blue Pebble GamePál András Papp, Aleksandros Sobczyk, Albert-Jan Nicholas Yzelman. 328-338 [doi]
• Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse GraphsJakub Lacki, Slobodan Mitrovic, Srikkanth Ramachandran, Wen-Horng Sheu. 339-349 [doi]
• Optimal Batch-Dynamic kd-trees for Processing-in-Memory with ApplicationsYiwei Zhao, Hongbo Kang, Yan Gu 0001, Guy E. Blelloch, Laxman Dhulipala, Charles McGuffey, Phillip B. Gibbons. 350-366 [doi]
• Dispersion is (Almost) Optimal under (A)synchronyAjay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak, Gokarna Sharma. 367-381 [doi]
• A Study of Synchronization Methods for Concurrent SizeHen Kas-Sharir, Gal Sela 0001, Erez Petrank. 382-396 [doi]
• Fully-Dynamic Parallel Algorithms for Single-Linkage ClusteringQuinten De Man, Laxman Dhulipala, Kishen N. Gowda. 397-412 [doi]
• Persistent HyTM via Fast Path Fine-Grained LockingGaetano Coccimiglio, Trevor Brown 0001, Srivatsan Ravi. 413-428 [doi]
• Parallel Batch-Dynamic Maximal Matching with Constant Work per UpdateGuy E. Blelloch, Andrew C. Brady. 429-442 [doi]
• A framework for boosting matching approximation: parallel, distributed, and dynamicSlobodan Mitrovic, Wen-Horng Sheu. 443-457 [doi]
• Parallel Point-to-Point Shortest Paths and Batch QueriesXiaojun Dong 0001, Andy Li, Yan Gu, Yihan Sun 0001. 458-472 [doi]
• RACE: Operator Choreography for Inference Acceleration in Personalized Recommender SystemShaolong Li, Xiang Yang, Jiaxing Liu, Qi Qi 0001, Jianxin Liao, Jun Huang, Jingyu Wang 0001. 473-486 [doi]
• JOVS: Joint Optimization of Vectorization and Scheduling for DNN on AI DSPsYaochen Han, Hongxu Jiang, Runhua Zhang 0002, Rui She. 487-498 [doi]
• Scaling Parallel Algorithms to Massive Datasets using Multi-SSD MachinesHaohong Li, Jamshed Khan, Laxman Dhulipala. 499-513 [doi]
• Minimizing Processor Count for Fault Tolerant Toom-Cook AlgorithmsRoy Nissim, Oded Schwartz, Yuval Spiizer. 514-524 [doi]
• Parallel Batch Queries on Dynamic Trees: Algorithms and ExperimentsHumza Ikram, Andrew C. Brady, Daniel Anderson, Guy E. Blelloch. 525-539 [doi]
• Formal Machine-Verification of MemSnap: An Efficient, Far-Future Linearizable Snapshot AlgorithmSiddhartha Jayanti, Ugur Y. Yavuz. 540-554 [doi]
• Don't Melt Your Cache: Low-Associativity with Heat-SinkMichael A. Bender, Alex Conway 0001, Daniel DeLayo, Martin Farach-Colton, Jaehyun Han, Linfeng He, Rob Johnson 0001, Sudarsun Kannan, William Kuszmaul, Donald E. Porter, Evan West. 555-565 [doi]
• Bounded Memory in Distributed NetworksRan Ben-Basat, Keren Censor Hillel, Yi-Jun Chang, Wenchen Han, Dean Leitersdorf, Gregory Schwartzman. 566-581 [doi]
• Brief Announcement: Optimality Conditions for Parallel Communication-Avoiding Matrix Multiplication with Overlapped CommunicationMikhail Isaev, Srinivas Eswar, Richard W. Vuduc. 582-586 [doi]
• Brief Announcement: A Novel Integrated Parallel Accelerator for an Irregular Killer AppYuhao Song, Manoj Franklin, Uzi Vishkin. 587-592 [doi]
• Brief Announcement: Fine-Grained Computation in 3-Space: Matrix Multiplication, Paths, and MazesQuentin F. Stout. 593-597 [doi]
• Brief Announcement: A Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer NetworksAayush Gupta, Gopal Pandurangan. 598-602 [doi]
• Brief Announcement: SCOT: Fix non-blocking data structures, not memory reclamationMd Amit Hasan Arovi, Ruslan Nikolaev 0001. 603-607 [doi]
• Brief Announcement: LCTree: A Fast Hardware BVH Constructor for Real-Time Ray TracingRun Yan, Su Yin, Hui Guo 0004, Yongwen Wang, Gang Chen 0023, Nong Xiao 0001, Libo Huang. 608-612 [doi]
• Δ-Snap: Snapshotting the DifferentialPrasad Jayanti, Siddhartha Jayanti. 613-617 [doi]
• Brief Announcement: Stochastic Parallel Scheduling with Bandit FeedbackGerdus Benadè, Rathish Das, Thomas Lavastida. 618-622 [doi]
• Brief Announcement: Distributed Butterfly Analysis using Mobile AgentsPrabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla. 623-627 [doi]
• Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAMVignesh Manoharan, Vijaya Ramachandran. 628-632 [doi]
• Brief Announcement: Minimizing Communication for Parallel Symmetric Tensor Times Same Vector ComputationHussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse, Mathieu Vérité. 633-637 [doi]
• Brief Announcement: Improved Understanding of Landlord Under Suffix AnalysisCharles McGuffey, Bram Schuijff, Adam Snelling. 638-641 [doi]
• Brief Announcement: Load Balancing with Duration PredictionsYossi Azar, Niv Buchbinder, Tomer Epshtein. 642-646 [doi]
• Brief Announcement: Accelerating Distributed Search System with In-network ComputationPenghao Zhang. 647-649 [doi]