Table of Contents

• Faster EPTAS for Scheduling on Uniform MachinesKlaus Jansen, Björn Schumacher, Roberto Solis-Oba. 1-12 [doi]
• Lossless Robustification of Packet Scheduling AlgorithmsYossi Azar, Or Vardi. 13-25 [doi]
• Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster SchedulingBennet Edler, Klaus Jansen, Felix Ohnesorge, Lis Pirotton. 26-36 [doi]
• Online Span Minimization for Flexible Uniform JobsMozhengfu Liu, Samir Khuller, Xueyan Tang. 37-49 [doi]
• A Practical Parallel Algorithm for Expander DecompositionsRobin Münk. 50-61 [doi]
• Efficient Parallel (Δ + 1)-Edge-ColoringAriel Khuzman, Michael Elkin. 62-74 [doi]
• Parallel Spectral Graph Sparsification via Low Diameter DecompositionsYves Baumann, Gernot Zöcklein. 75-86 [doi]
• Brief Announcement: Asynchronous Dispersion with Optimal Time ComplexityDebasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar 0014, Anisur Rahaman Molla, Gokarna Sharma. 87-90 [doi]
• Brief Announcement: An improved lower bound for local failover routing on directed networksErik van den Akker 0002, Klaus-Tycho Foerster. 91-93 [doi]
• Brief Announcement: Byzantine Generals with Stuttering MadnessBo Pan, Maria Potop-Butucaru. 94-97 [doi]
• Brief Announcement: Discrete Incremental Voting - New Bounds for General Graphs and ExpandersPetra Berenbrink, Colin Cooper, Thorsten Götte, Lukas Hintze, Tomasz Radzik. 98-101 [doi]
• uSTM: A Lightweight and Efficient STM Supporting General Types and Deferred AbortsZachary Kent, Guy E. Blelloch, André Costa. 102-115 [doi]
• KDB: A Scalable Persistent Key-Value Store with Atomic Batches and SnapshotsTadeusz Kobus, Maciej Kokocinski, Krzysztof Kortas, Pawel T. Wojciechowski. 116-128 [doi]
• Big Atomics: Non-Blocking Algorithms with a Direct Fast PathDaniel Anderson, Guy E. Blelloch, Zachary Kent, Siddhartha Jayanti. 129-142 [doi]
• Asynchronous Verifiable Information Dispersal with Low Space and Communication ComplexityThomas Locher, Yvonne Anne Pignolet. 143-154 [doi]
• Towards Reliable Broadcast with Optimal Communication and Round ComplexityThomas Locher, Victor Shoup. 155-166 [doi]
• Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive AdversariesDariusz Rafal Kowalski, Jan Olkowski. 167-179 [doi]
• Keynote Talk: Parallel Algorithm Engineering ReconsideredPeter Sanders 0001. 180-181 [doi]
• Parallel Metric Skip Lists and Nearest Neighbor SearchXiangyun Ding, Rohin Garg, Yan Gu 0001, Yihan Sun 0001. 182-195 [doi]
• Fast Concurrent Primitives Despite ContentionMichael A. Bender, Guy E. Blelloch, Martin Farach-Colton, Yang Hu, Rob Johnson 0001, Rotem Oshman, Renfei Zhou. 196-233 [doi]
• Fast and Theoretically Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and TreapsQuinten De Man, Laxman Dhulipala. 234-246 [doi]
• CleanANN: Efficient and Robust Full Dynamism in Graph-based Approximate Nearest Neighbor SearchZiyu Zhang 0002, Yuanhao Wei, Joshua Engels, Julian Shun. 247-260 [doi]
• Exponential Energy Savings in Local Distributed Graph AlgorithmsMohsen Ghaffari, Zi Song Yeoh. 261-287 [doi]
• Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio NetworksYi-Jun Chang, Yang Ze Guan. 288-300 [doi]
• Minimizing Total Flow Time in the Online Active-Time Scheduling ModelSusanne Albers, Gorsha Wessel van der Heijden. 301-311 [doi]
• Brief Announcement: An Automatic Framework for High Performance Alternative Basis Fast Matrix MultiplicationNiv Bruker, Oded Schwartz, Noa Vaknin. 312-316 [doi]
• Brief Announcement: An I/O-Efficient Parallel FFT for Heterogeneous Architectures via a Single Global ExchangeShina Guo, Weiguo Gao, Yuan Tang. 317-320 [doi]
• Brief Announcement: PRESERVE: Prefetching Model Weights and KV-Cache in Distributed LLM ServingAhmet Caner Yüzügüler, Jiawei Zhuang, Lukas Cavigelli. 321-324 [doi]
• Brief Announcement: Tiered Memory ComputationMarcos K. Aguilera, Naama Ben-David, N. Efe Çekirge, Siddhartha Jayanti. 325-328 [doi]
• Brief Announcement: Energy-Time Trajectories: A Tool to Understand Complex Parallel EfficiencyPeter Michael Kogge. 329-332 [doi]
• Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity GraphsSharareh Alipour, Ermiya Farokhnejad. 333-340 [doi]
• Time-, Message- and Memory-Efficient Distributed Minimum Spanning Tree and Partwise AggregationMichael Elkin, Tanya Goldenfeld. 341-354 [doi]
• Near-Optimal Bounds for Adversarial Wake-up in Distributed NetworksPeter Robinson 0002, Ming Ming Tan. 355-365 [doi]
• Deterministic Distance Approximation in MPC via Improved Hitting SetsKyungjin Cho, Michal Dory, Yannic Maus, Tijn de Vos. 366-379 [doi]
• Tight Latency Guarantees for Weighted Caching with Delayed HitsTomer Tsachor, Joseph (Seffi) Naor. 380-391 [doi]
• Non-Clairvoyant Scheduling for Processing-in-MemoryHongbo Kang, Yiwei Zhao, Kunal Agrawal, Yongwei Wu 0001, Phillip B. Gibbons. 392-404 [doi]
• The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage EconomicallyMichael A. Bender, Philip Bille, Martín Farach-Colton, Jeremy T. Fineman, Inge Li Gørtz, Michael T. Goodrich, Hanna Komlós, Bradley C. Kuszmaul, William Kuszmaul, Rose Silver, Todd Veldhuizen, Renfei Zhou. 405-415 [doi]
• Reducing Off-Chip Prefetch Request Latency of LLC Hardware Prefetchers via Neural PredictionZhengwei Huang, Wei Guo, Yongwen Wang. 416-429 [doi]
• PaHiS: A Hierarchical Synchronous Parallel Model for Irregular WorkloadsPetros Anastasiadis, Denis Jelovina, Albert-Jan Nicholas Yzelman. 430-444 [doi]
• Design Tradeoffs in Backend Organization in Out-Of-Order RISC-V ProcessorsEsther Alonso, Pablo Prieto, Pablo Abad, Valentin Puente. 445-456 [doi]
• Scheduler Augmentation: A Lightweight, Customizable, Low-Cost Profiling Technique for Fork-Join Parallel ProgramsSam Westrick, Darshan Dinesh Kumar, Seong-Heon Jung. 457-472 [doi]
• Keynote Talk: Lessons Learned from Four Decades of Parallel ComputingPhillip B. Gibbons. 473 [doi]
• Brief Announcement: QPID: A Scalable, Strict Concurrent Priority QueueOlivia Grimes, Matthew Rodriguez, Ahmed Hassan, Michael F. Spear, Roberto Palmieri. 474-477 [doi]
• Brief Announcement: Recyclable Optimistic-Traversal Data StructuresMd Amit Hasan Arovi, Ruslan Nikolaev 0001. 478-481 [doi]
• Brief Announcement: Direction-Incentivized Spectral Partitioning for Acyclic GraphsDimosthenis Pasadakis, Raphael S. Steiner, Pál András Papp, Toni Böhnlein, Albert-Jan Nicholas Yzelman. 482-485 [doi]
• Brief Announcement: Scheduling Problems with Constrained RejectionsSami Davies, Venkatesan Guruswami, Xuandi Ren. 486-489 [doi]
• Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous RingsJérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou. 490-502 [doi]
• Universal Deterministic Symmetry Breaking Between Anonymous Agents in NetworksBibhuti Das 0001, Andrzej Pelc. 503-523 [doi]
• Cell-Probe Lower Bounds for Data Structures in CRCW PRAMPeyman Afshani, Magnus Christian Ring Merrild. 524-536 [doi]
• Communication Lower Bounds and Algorithms for Sketching with Random Dense MatricesHussam Al Daas, Grey Ballard, Laura Grigori, Md Taufique Hussain, Suraj Kumar, Mohammad Marufur Rahman, Kathryn Rouse. 537-549 [doi]
• Near-Optimal Parallel Approximate Counting via SamplingDavid G. Harris 0001, Vladimir Kolmogorov, Hongyang Liu, Yitong Yin, Yiyao Zhang. 550-559 [doi]
• Keynote Talk: Highly Asynchronous Concurrency in Data StructuresRobert E. Tarjan. 560 [doi]
• Composable Coresets for Fair Diversity MaximizationAli Ahmadvand, Mohammad Ansari, Mobin Razavi, Hamid Zarrabi-Zadeh. 561-570 [doi]