Where is SPAA 2026 held?

SPAA 2026 is held in London, UK.

When does SPAA 2026 take place?

SPAA 2026 takes place on 2026-07-06.

What is the ranking of SPAA?

SPAA is ranked CCF B, CORE A, QUALIS A2. These are categorical rankings maintained by the respective bodies (China Computer Federation, CORE Inc., and Brazilian CAPES).

Conference Information

SPAA 2026: ACM Symposium on Parallelism in Algorithms and Architectures

Q: What is the submission deadline for SPAA 2026?

The paper submission deadline for SPAA 2026 (ACM Symposium on Parallelism in Algorithms and Architectures) is 2026-02-20.

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: 121692 Tracked: 91 Attend: 5

Call For Papers

SPAA 2026 (ACM Symposium on Parallelism in Algorithms and Architectures) is a CCF B / CORE A / QUALIS A2 conference held in London, UK on 2026-07-06. The paper submission deadline is 2026-02-20. Acceptance notifications are sent on 2026-05-15.

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

Year	Best Papers
2023	Nearly Work-Efficient Parallel DFS in Undirected Graphs
2022	Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems
2021	Parallel Minimum Cuts in O(m log2n) Work and Low Depth
2020	Sublinear Algorithms in T-interval Dynamic Networks
2020	A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence
2020	Parallel Planar Subgraph Isomorphism and Vertex Connectivity
2020	Faster Deterministic All Pairs Shortest Paths in Congest Model
2020	Optimal Parallel Algorithms in the Binary-Forking Model
2019	Constant-Length Labeling Schemes for Deterministic Radio Broadcast
2018	Parallel Minimum Cuts in Near-linear Work and Low Depth
2018	Theoretically Efficient Parallel Graph Algorithms Can be Fast and Scalable
2017	Randomized Composable Coresets for Matching and Vertex Cover
2017	Distributed Partial Clustering
2016	On Lower Bounds for Modern Parallel Computation
2016	Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
2016	Robust and Probabilistic Failure-Aware Placement
2016	Lock-free Transactions without Aborts for Linked Data Structures
2015	Speed Scaling in the Non-clairvoyant Model
2014	Parallel Peeling Algorithms
2013	Fast Greedy Algorithms in MapReduce and Streaming
2013	IRIS: A Robust Information System Against Insider DoS-Attacks
2012	Memory-Mapping Support for Reducer Hyperobjects
2011	Graph Expansion and Communication Costs of Fast Matrix Multiplication
2010	Basic Network Creation Games
2009	Reducers and Other Cilk++ Hyperobjects
2008	Utilizing Shared Data in Chip Multiprocessors with the Nahalal Architecture
2007	Tight Bounds for Distributed Selection
2007	Universal Augmentation Schemes for Network Navigability: Overcoming the √n-Barrier

Related Conferences

CCF	CORE	QUALIS	Short	Full Name	Submission	Notification	Conference
c	a	b1	ICSA	IEEE International Conference on Software Architecture	2026-10-30	2026-12-15	2027-03-08
c	b	b3	ICA3PP	International Conference on Algorithms and Architectures for Parallel Processing	2026-07-10	2026-08-30	2026-10-26
b	a	a2	PACT	International Conference on Parallel Architectures and Compilation Techniques	2026-04-17	2026-08-05	2026-10-19
c			WASA	International Conference on Wireless Algorithms, Systems, and Applications	2026-03-15	2026-05-01	2026-07-06
b	a	a2	SPAA	ACM Symposium on Parallelism in Algorithms and Architectures	2026-02-20	2026-05-15	2026-07-06
b	a	a2	PPSN	International Conference on Parallel Problem Solving from Nature	2024-04-18	2024-05-31	2024-09-14
		b5	PAAP	International Symposium on Parallel Architectures, Algorithms and Programming	2022-07-30	2022-09-30	2022-11-04
	b	b1	WADS	Algorithms and Data Structures Symposium	2019-02-20	2019-04-13	2019-08-05
	c		WCOP	International Doctoral Symposium on Components and Architecture	2015-01-25	2015-02-16	2015-05-04
		b3	RAW	Reconfigurable Architectures Workshop		2013-02-01	2013-05-20

Related Journals

CCF	Full Name	Impact Factor	Publisher	ISSN
a	IEEE Transactions on Parallel and Distributed Systems	6.0	IEEE	1045-9219
b	The Journal of Systems Architecture: Embedded Software Design	4.1	Elsevier	1383-7621
b	Journal of Parallel and Distributed Computing	4.0	Elsevier	0743-7315
	Algorithms for Molecular Biology	1.7	Springer	1748-7188
	ACM Transactions on Spatial Algorithms and Systems	1.6	ACM	2374-0353
	IEEE Computer Architecture Letters	1.4	IEEE	1556-6056
	Annals of Mathematics and Artificial Intelligence	1.0	Springer	1012-2443
	Random Structures & Algorithms	0.900	Wiley-Blackwell	1042-9832
b	ACM Transactions on Algorithms	0.900	ACM	1549-6325
	Applied Categorical Structures	0.600	Springer	0927-2852