default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th SPAA 2023: Orlando, FL, USA
- Kunal Agrawal, Julian Shun:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023. ACM 2023, ISBN 978-1-4503-9545-8
Session 1: Data Structures / Scheduling
- Hongbo Kang
, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-trie: A Skew-resistant Trie for Processing-in-Memory. 1-14 - Shaked Elias-Zada, Arik Rinberg, Idit Keidar:
Quancurrent: A Concurrent Quantiles Sketch. 15-25 - Kyle Singer, Kunal Agrawal, I-Ting Angelina Lee:
An Efficient Scheduler for Task-Parallel Interactive Applications. 27-38 - Rafael Custódio, Hervé Paulino, Guilherme Rito:
Efficient Synchronization-Light Work Stealing. 39-49 - Dimitrios Los, Thomas Sauerwald:
Balanced Allocations in Batches: The Tower of Two Choices. 51-61
SPAA Parallel Computing Award Keynote
- Guy E. Blelloch:
Are Parallel Algorithms Ready for Prime Time? 63
Session 2: Distributed Algorithms
- Sam Coy, Artur Czumaj, Gopinath Mishra:
On Parallel k-Center Clustering. 65-75 - AmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong:
Massively Parallel Tree Embeddings for High Dimensional Spaces. 77-88 - Manuela Fischer, Jeff Giliberti, Christoph Grunau:
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. 89-100 - Jacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin:
Location-Sensitive String Problems in MPC. 101-111 - Jacob Gilbert, MohammadTaghi Hajiaghayi:
Brief Announcement: Regular and Dyck Languages in MPC. 113-116
Session 3: Caching / Networks
- Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini:
An Associativity Threshold Phenomenon in Set-Associative Caches. 117-127 - Michael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West:
Increment - and - Freeze: Every Cache, Everywhere, All of the Time. 129-139 - Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer:
Multidimensional Approximate Agreement with Asynchronous Fallback. 141-151 - Wenkai Dai, Klaus-Tycho Foerster, Stefan Schmid:
A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible. 153-163 - Kartik Lakhotia, Kelly Isham, Laura Monroe, Maciej Besta, Torsten Hoefler, Fabrizio Petrini:
In-network Allreduce with Multiple Spanning Trees on PolarFly. 165-176
Session 4: Concurrency
- Pedro Moreno, Ricardo Rocha:
Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs. 177-186 - Wentao Cai, Haosen Wen, Michael L. Scott:
Transactional Composition of Nonblocking Data Structures. 187-197 - Vivek Shahare, Milind Chabbi, Nikhil Hegde:
Protecting Locks Against Unbalanced Unlock(). 199-211 - Jaehwang Jung, Janggun Lee, Jeonghyeon Kim, Jeehoon Kang:
Applying Hazard Pointers to More Concurrent Data Structures. 213-226 - Prasad Jayanti, Siddhartha Jayanti, Anup Joshi:
Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining. 227-237
Session 5: Best Paper Candidates
- Alireza Haqi, Hamid Zarrabi-Zadeh:
Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization. 239-247 - Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. 249-259 - Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze, Dan Alistarh:
Provably-Efficient and Internally-Deterministic Parallel Union-Find. 261-271 - Mohsen Ghaffari, Christoph Grunau, Jiahao Qu:
Nearly Work-Efficient Parallel DFS in Undirected Graphs. 273-283
SPAA Test-of-Time Award Keynote
- Bradley C. Kuszmaul, Charles E. Leiserson:
The Connection Machine CM-5, Moore's Law, and the Future of Computational Performance. 285-286
Session 6: Brief Announcements
- Sahil Dhoked, Wojciech Golab, Neeraj Mittal:
Brief Announcement: On Solving Recoverable Mutual Exclusion Under System-Wide Failures. 287-290 - Guy Even, Gabriel Marques Domingues, Parham Toutian:
Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership. 291-294 - Ruilong Ma, Xiang Yang, Qi Qi, Jingyu Wang, Zirui Zhuang, Jing Wang, Xin Wang:
Brief Announcement: Accelerate CNN Inference with Zoning Graph at Dynamic Granularity. 295-298 - Filippo Muzzini, Nicola Capodieci, Roberto Cavicchioli, Benjamin Rouxel:
Brief Announcement: Optimized GPU-accelerated Feature Extraction for ORB-SLAM Systems. 299-302 - Javad Abdi, Guowei Zhang, Mark C. Jeffrey:
Brief Announcement: Is the Problem-Based Benchmark Suite Fearless with Rust? 303-305 - Aniket Murhekar, David Arbour, Tung Mai, Anup B. Rao:
Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. 307-310 - Hossein Esfandiari, Vahab Mirrokni, Peilin Zhong:
Brief Announcement: Streaming Balanced Clustering. 311-314
Session 7: Parallel Algorithms
- Sushant Sachdeva, Yibin Zhao:
A Simple and Efficient Parallel Laplacian Solver. 315-325 - Yan Gu, Ziyang Men, Zheqi Shen, Yihan Sun, Zijin Wan:
Parallel Longest Increasing Subsequence and van Emde Boas Trees. 327-340 - Xiaojun Dong, Yunshu Wu, Zhongqi Wang, Laxman Dhulipala, Yan Gu, Yihan Sun:
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems. 341-353 - Michael T. Goodrich, Riko Jacob:
Optimal Parallel Sorting with Comparison Errors. 355-365 - Nima Anari, Callum Burgess, Kevin Tian, Thuy-Duong Vuong:
Quadratic Speedups in Parallel Sampling from Determinantal Distributions. 367-377
Session 8: Linear Algebra / Graph Partitioning
- Yoav Moran, Oded Schwartz:
Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications. 379-390 - Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse:
Parallel Memory-Independent Communication Bounds for SYRK. 391-401 - Harald Räcke, Stefan Schmid, Ruslan Zabrodin:
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. 403-413 - Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman:
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. 415-425 - Piyush Sao, Xiaoye Sherry Li:
Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices. 427-430
Session 9: Distributed Algorithms
- Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. 431-441 - Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi:
Fast Dynamic Programming in Trees in the MPC Model. 443-453 - Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. 455-465 - Wentao Yang, Vipul Harsh, Edgar Solomonik:
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. 467-478 - Lewis Tseng, Neo Zhou, Cole Dumas, Tigran Bantikyan, Roberto Palmieri:
Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and Write. 479-488 - Marc Fuchs, Fabian Kuhn:
Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications. 489-492
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-04-30 20:59 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:
