default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th SPAA 2025: Portland, OR, USA
- Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2025, Portland, OR, USA, 28 July 2025 - 1 August 2025. ACM 2025, ISBN 979-8-4007-1258-6
Session 1
- Jan van den Brand, Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos:
Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances. 1-16 - Russell Bentley, Rezaul Chowdhury, Aaron Gregory, Michael Santomauro:
Applying Fast Fourier Transforms to Accelerate Spatially and Temporally Inhomogeneous Stencil Computations. 17-33 - Adam Karczmarz, Bartlomiej Lewandowski:
A Deterministic Work-Depth Tradeoff for Strongly Connected Components. 34-45 - Rathish Das, Hao Sun:
Approximation Hardness of Resource Scheduling. 46-61 - Tengfei An, Serge Fdida, Maria Potop-Butucaru, Sébastien Tixeuil:
ABD-HFL: Byzantine-resistant Decentralized Hierarchical Federated Learning. 62-74
Session 2
- Aaron Handleman, Kyle Singer, Tao B. Schardl, I-Ting Angelina Lee:
Towards Zero Spawn Overhead: Work Stealing Without Deques. 75-88 - Mélanie Cambus, Darya Melnyk, Tijana Milentijevic, Stefan Schmid:
Approximate Agreement Algorithms for Byzantine Collaborative Learning. 89-100 - Abhishek Bhattacharjee, Quanquan C. Liu, Rajit Manohar, Raghavendra Pradyumna Pothukuchi, Muhammed Ugur:
Dataflow-Specific Algorithms for Resource-Constrained Scheduling and Memory Design. 101-115 - Guy E. Blelloch, Zachary Kent, Yuanhao Wei:
TLF: Transactional Lock Fusion. 116-130
Session 3
- Magdalen Dobson Manohar, Yuanhao Wei, Guy E. Blelloch:
CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor Search. 131-143 - Aniket Murhekar, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Non-preemptive Throughput Maximization under Time-varying Capacity. 144-157 - Kyle Berney, Nodari Sitchinava:
Eliminating Bank Conflicts in GPU Mergesort. 158-170 - Kunal Agrawal, Michael A. Bender, Kirk Pruhs, Benjamin Moseley, Clifford Stein:
Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only). 171-180 - Longyun Chen, Jingcheng Liu, Penghui Yao:
Optimal quantum sampling on distributed databases. 181-192
Session 4
- Guin Gilman, Robert J. Walls:
ReFINE: A Reactive and Fine-Grained Scheduling Framework For Concurrency on General Purpose GPUs. 193-209 - Lucas Perotin, Hongyang Sun, Padma Raghavan:
A New Algorithm for Online Scheduling of Rigid Task Graphs with Near-Optimal Competitive Ratio. 210-224 - Mohsen Ghaffari, Jaehyun Koo:
Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees. 225-239 - Harald Räcke, Stefan Schmid, Ruslan Zabrodin:
Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model. 240-254 - Thomas Smith, Raph Levien, John D. Owens:
Decoupled Fallback: A Portable Single-Pass GPU Scan. 255-268
Session 5
- Pengyu Liu, Jatin Arora, Mingkuan Xu, Umut A. Acar:
POPQC: Parallel Optimization for Quantum Circuits. 269-283 - Yuntian Xie, Chaodong Zheng:
Listening Efficient Contention Resolution for Semi-batch Arrivals without Collision Detection. 284-298 - Mohsen Ghaffari, Jaehyun Koo:
Parallel Batch-Dynamic Algorithms for Spanners, and Extensions. 299-313 - Mingzhe Du, Ziheng Su, Michael L. Scott:
Reconciling Hardware Transactional Memory and Persistent Programming with Buffered Durability. 314-327
Session 6
- Pál András Papp, Aleksandros Sobczyk, Albert-Jan Nicholas Yzelman:
The Impact of Partial Computations on the Red-Blue Pebble Game. 328-338 - Jakub Lacki, Slobodan Mitrovic, Srikkanth Ramachandran, Wen-Horng Sheu:
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs. 339-349 - Yiwei Zhao, Hongbo Kang, Yan Gu, Guy E. Blelloch, Laxman Dhulipala, Charles McGuffey, Phillip B. Gibbons:
Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications. 350-366 - Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak, Gokarna Sharma:
Dispersion is (Almost) Optimal under (A)synchrony. 367-381 - Hen Kas-Sharir, Gal Sela, Erez Petrank:
A Study of Synchronization Methods for Concurrent Size. 382-396
Session 7
- Quinten De Man, Laxman Dhulipala, Kishen N. Gowda:
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering. 397-412 - Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi:
Persistent HyTM via Fast Path Fine-Grained Locking. 413-428 - Guy E. Blelloch, Andrew C. Brady:
Parallel Batch-Dynamic Maximal Matching with Constant Work per Update. 429-442 - Slobodan Mitrovic, Wen-Horng Sheu:
A framework for boosting matching approximation: parallel, distributed, and dynamic. 443-457 - Xiaojun Dong, Andy Li, Yan Gu, Yihan Sun:
Parallel Point-to-Point Shortest Paths and Batch Queries. 458-472
Session 8
- Shaolong Li, Xiang Yang, Jiaxing Liu, Qi Qi, Jianxin Liao, Jun Huang, Jingyu Wang:
RACE: Operator Choreography for Inference Acceleration in Personalized Recommender System. 473-486 - Yaochen Han, Hongxu Jiang, Runhua Zhang, Rui She:
JOVS: Joint Optimization of Vectorization and Scheduling for DNN on AI DSPs. 487-498 - Haohong Li, Jamshed Khan, Laxman Dhulipala:
Scaling Parallel Algorithms to Massive Datasets using Multi-SSD Machines. 499-513 - Roy Nissim, Oded Schwartz, Yuval Spiizer:
Minimizing Processor Count for Fault Tolerant Toom-Cook Algorithms. 514-524
Session 9
- Humza Ikram, Andrew C. Brady, Daniel Anderson, Guy E. Blelloch:
Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments. 525-539 - Siddhartha Jayanti, Ugur Y. Yavuz:
Formal Machine-Verification of MemSnap: An Efficient, Far-Future Linearizable Snapshot Algorithm. 540-554 - Michael A. Bender, Alex Conway, Daniel DeLayo, Martin Farach-Colton, Jaehyun Han, Linfeng He, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Donald E. Porter, Evan West:
Don't Melt Your Cache: Low-Associativity with Heat-Sink. 555-565 - Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang, Wenchen Han, Dean Leitersdorf, Gregory Schwartzman:
Bounded Memory in Distributed Networks. 566-581
Brief Announcements
- Mikhail Isaev, Srinivas Eswar, Richard W. Vuduc:
Brief Announcement: Optimality Conditions for Parallel Communication-Avoiding Matrix Multiplication with Overlapped Communication. 582-586 - Yuhao Song, Manoj Franklin, Uzi Vishkin:
Brief Announcement: A Novel Integrated Parallel Accelerator for an Irregular Killer App. 587-592 - Quentin F. Stout:
Brief Announcement: Fine-Grained Computation in 3-Space: Matrix Multiplication, Paths, and Mazes. 593-597 - Aayush Gupta, Gopal Pandurangan:
Brief Announcement: A Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks. 598-602 - Md Amit Hasan Arovi, Ruslan Nikolaev:
Brief Announcement: SCOT: Fix non-blocking data structures, not memory reclamation. 603-607 - Run Yan, Su Yin, Hui Guo, Yongwen Wang, Gang Chen, Nong Xiao, Libo Huang:
Brief Announcement: LCTree: A Fast Hardware BVH Constructor for Real-Time Ray Tracing. 608-612 - Prasad Jayanti, Siddhartha Jayanti:
Δ-Snap: Snapshotting the Differential. 613-617 - Gerdus Benadè, Rathish Das, Thomas Lavastida:
Brief Announcement: Stochastic Parallel Scheduling with Bandit Feedback. 618-622 - Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla:
Brief Announcement: Distributed Butterfly Analysis using Mobile Agents. 623-627 - Vignesh Manoharan, Vijaya Ramachandran:
Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM. 628-632 - Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse, Mathieu Vérité:
Brief Announcement: Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation. 633-637 - Charles McGuffey, Bram Schuijff, Adam Snelling:
Brief Announcement: Improved Understanding of Landlord Under Suffix Analysis. 638-641 - Yossi Azar, Niv Buchbinder, Tomer Epshtein:
Brief Announcement: Load Balancing with Duration Predictions. 642-646 - Penghao Zhang:
Brief Announcement: Accelerating Distributed Search System with In-network Computation. 647-649
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-08-01 18:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
