Conference Information

SPAA 2027: ACM Symposium on Parallelism in Algorithms and Architectures

Submission Date:
2027-01-22 Due in 70 days
Notification Date:
2027-04-10
Conference Date:
2027-06-05
Location:
Atlanta, Georgia, USA
Years:
Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Add to calendar: Google Calendar · Outlook / Apple (.ics)
CCF: B   ICORE: B   QUALIS: A2   Viewed: 132032   Tracked: 93   Attend: 5
Something wrong with this page? Tell us
Embed deadline badge
SPAA
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.

Conference Partner Index (CP-I)

79.3 / 100
Ranked #212 of 5,776 conferences · Top 4%

#13 of 142 in Theory & Algorithms

Academic recognition (35%)
92
Submission selectivity (20%) No data - scored at the neutral baseline of 50 —
Editions held (20%)
99
Community attention (10%)
67
Public record completeness (15%)
70

Inputs used: Listed as CCF B, ICORE B, QUALIS A2 · Editions on record: 39 · Researchers following it here: 93 · Researchers who opened this page in the past 24 months: 22

Missing from the public record: Historical acceptance rates (+4.5)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 80% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.2 · Computed 2026-11-13

Call For Papers

SPAA 2027 (ACM Symposium on Parallelism in Algorithms and Architectures) is a CCF B / ICORE B / QUALIS A2 conference held in Atlanta, Georgia, USA on 2027-06-05. The paper submission deadline is 2027-01-22. Acceptance notifications are sent on 2027-04-10.

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 Admin Agent on

Best Papers

YearBest Papers
2023Nearly Work-Efficient Parallel DFS in Undirected Graphs
2022Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems
2021Parallel Minimum Cuts in O(m log2n) Work and Low Depth
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
2016On Lower Bounds for Modern Parallel Computation
2016Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
2016Robust and Probabilistic Failure-Aware Placement
2016Lock-free Transactions without Aborts for Linked Data Structures
2015Speed Scaling in the Non-clairvoyant Model
2014Parallel Peeling Algorithms
2013Fast Greedy Algorithms in MapReduce and Streaming
2013IRIS: A Robust Information System Against Insider DoS-Attacks
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
2007Tight Bounds for Distributed Selection
2007Universal Augmentation Schemes for Network Navigability: Overcoming the √n-Barrier

People who viewed this also viewed

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition9.1Elsevier0031-3203
BIEEE Transactions on Neural Networks and Learning Systems8.9IEEE1045-9227
BInformation Sciences6.0Elsevier0020-0255
BComputer Networks4.7Elsevier1389-1286
BComputers & Security5.4Elsevier0167-4048
BIEEE Transactions on Intelligent Transportation Systems8.4IEEE1524-9050
BJournal of Systems and Software3.8Elsevier0164-1212
BInformation Processing & Management6.9Elsevier0306-4573
BIEEE Transactions on Robotics10.5IEEE1552-3098

Comments 0

No comments yet.

Please Login to post a comment