학회 정보

SPAA 2027: ACM Symposium on Parallelism in Algorithms and Architectures

학회 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
회원가입 로그인
마감 카운트다운 배지 삽입
SPAA
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.
투고 마감일:
2027-01-22 117일 남음
통보일:
2027-04-10
개최일:
2027-06-05
개최지:
Atlanta, Georgia, USA
개최 횟수:
CCF: B   ICORE: B   QUALIS: A2   조회: 130394   팔로우: 91   참가: 5

회반 지수 (CP-I)

79.0 / 100
전체 5,687개 중 212위 · 상위 4%

이론·알고리즘 분야 142개 중 14위

학술적 인정 (35%)
92
투고 선별성 (20%) 데이터 없음 — 중립 기준값 50점으로 계산 —
개최 횟수 (20%)
99
커뮤니티 관심도 (10%)
64
공개 자료 충실도 (15%)
70

사용한 입력: 수록 등급: CCF B, ICORE B, QUALIS A2 · 확인되는 개최 횟수: 39 · 회반에서 팔로우 중인 연구자: 91명 · 지난 24개월 동안 이 페이지를 연 연구자: 14명

공개 자료에서 빠진 항목: 역대 게재율 (+4.5)
주최자는 학회를 인증 신청한 뒤 이 페이지에서 바로 추가할 수 있습니다. 점수는 매일 밤 다시 계산됩니다. 이 점수를 올리는 방법

신뢰도 80% — 점수 중 중립 기준값이 아니라 실제 관측된 데이터에 근거한 비율. 이 점수는 어떻게 계산되나 · 전체 순위 보기 · 알고리즘 버전 1.1 · 산출일 2026-09-27

논문 모집

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
최종 수정: Admin Agent ()

베스트 페이퍼

연도베스트 페이퍼
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

이 항목을 본 사람들이 함께 본 항목

CCFICORECP-I약칭정식 명칭투고 마감개최일
BA71.4ICWSMInternational AAAI Conference on Web and Social Media2027-01-152027-05-27
BB61.0DCCData Compression Conference2026-10-022027-03-23

관련 학회

CCFICORECP-I약칭정식 명칭투고 마감개최일
BA*89.7ICRAInternational Conference on Robotics and Automation2026-09-152027-05-24
BA*94.1IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
B91.2ICASSPInternational Conference on Acoustics, Speech and Signal Processing2026-09-162027-05-16
BA*79.6PODSACM SIGMOD Conference on Principles of DB Systems2026-12-032027-06-13
BA76.5ICMEInternational Conference on Multimedia and Expo2025-12-312026-07-05
B84.4BIBMInternational Conference on Bioinformatics & Biomedicine2026-07-052026-12-01
BA*94.1ICDMInternational Conference on Data Mining2026-06-062026-11-12
BA*89.0ECCVEuropean Conference on Computer Vision2026-03-062026-09-08
BA92.9DATEDesign, Automation and Test in Europe2026-09-072027-03-22
BA*83.8KRInternational Conference on the Principles of Knowledge Representation and Reasoning2026-02-082026-07-20

관련 저널

CCF정식 명칭영향력 지수출판사ISSN
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition7.6Elsevier0031-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

댓글 0

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요