Conference Information
SPAA 2026: ACM Symposium on Parallelism in Algorithms and Architectures
Please Login to view website of conference

Submission Date:
2026-02-20
Notification Date:
2026-05-15
Conference Date:
2026-07-06
Location:
London, UK
Years:
38
CCF: b   CORE: a   QUALIS: a2   Viewed: 112027   Tracked: 91   Attend: 5

Call For Papers
Topics of Interest

Topics of interest include, but are not limited to:

Parallel and distributed algorithms
Parallel, concurrent, and distributed data structures
Parallel complexity theory
Scheduling algorithms for parallel machines
Computational models for parallel and distributed computing
Interplay between algorithmic parallelism, programming, and architecture
Parallel programming languages
Parallel programming frameworks and domain-specific languages
System software for parallel and concurrent programming, including (but not limited) to runtime systems, compilers, and tools
Parallel and distributed architectures
Supercomputer architecture and high-performance computing
Instruction-level parallelism and VLSI
Parallelism in emerging hardware platforms, including AI accelerators, processing-in-memory, and quantum computing
Energy-efficient (“green”) computing and power-aware architectures
Transactional memory: hardware and software
Management and processing of massive data sets
Memory or I/O-efficient algorithms
Parallelism in machine learning
Routing and information dissemination
Peer-to-peer systems
Mobile, ad hoc, and sensor networks
Last updated by Dou Sun in 2025-11-06
Best Papers
YearBest Papers
2020Sublinear Algorithms in T-interval Dynamic Networks
2020A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence
2020Parallel Planar Subgraph Isomorphism and Vertex Connectivity
2020Faster Deterministic All Pairs Shortest Paths in Congest Model
2020Optimal Parallel Algorithms in the Binary-Forking Model
2019Constant-Length Labeling Schemes for Deterministic Radio Broadcast
2018Parallel Minimum Cuts in Near-linear Work and Low Depth
2018Theoretically Efficient Parallel Graph Algorithms Can be Fast and Scalable
2017Randomized Composable Coresets for Matching and Vertex Cover
2017Distributed Partial Clustering
2016Lock-free Transactions without Aborts for Linked Data Structures
2016On Lower Bounds for Modern Parallel Computation
2016Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
2016Robust and Probabilistic Failure-Aware Placement
2015Speed Scaling in the Non-clairvoyant Model
2014Parallel Peeling Algorithms
2013IRIS: A Robust Information System Against Insider DoS-Attacks
2013Fast Greedy Algorithms in MapReduce and Streaming
2012Memory-Mapping Support for Reducer Hyperobjects
2011Graph Expansion and Communication Costs of Fast Matrix Multiplication
2010Basic Network Creation Games
2009Reducers and Other Cilk++ Hyperobjects
2008Utilizing Shared Data in Chip Multiprocessors with the Nahalal Architecture
2007Universal Augmentation Schemes for Network Navigability: Overcoming the √n-Barrier
2007Tight Bounds for Distributed Selection
Related Conferences