会议信息

STOC 2027: ACM Symposium on Theory of Computing

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
STOC
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2026-11-02 还有 42 天
通知日期:
2027-02-01
会议日期:
2027-06-06
会议地点:
Atlanta, Georgia, USA
届数:
CCF: A   ICORE: A*   QUALIS: A1   浏览: 25563323   关注: 48   参加: 7

会伴指数 (CP-I)

89.3 / 100
全站第 79 名 / 共 5,682 个会议 · 前 2%

理论与算法 第 4 / 142

学术认可 (35%)
100
投稿选择性 (20%)
83
会议传承 (20%)
100
社区关注 (10%)
58
资料公开度 (15%)
80

用到的输入: 收录等级：CCF A, QUALIS A1 · 录用率：26.5%（有记录的 5 届的均值） · 有据可查的届次：58 · 在会伴关注它的研究者：48 人 · 过去 24 个月打开过本页的研究者：14 人

公开资料里还缺: 历届信息 (+3.0)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 100% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-09-20

征稿

STOC 2027 (ACM Symposium on Theory of Computing) is a CCF A / ICORE A* / QUALIS A1 conference held in Atlanta, Georgia, USA on 2027-06-06. The paper submission deadline is 2026-11-02. Acceptance notifications are sent on 2027-02-01.

The 59th ACM Symposium on Theory of Computing (STOC 2027), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Atlanta, GA, USA from June 6-10, 2027, as part of FCRC 2027. An AI Day will be held on June 11, 2027. Papers presenting new and original research on the theory of computation are sought. Typical but not exclusive topics of interest include algorithms and data structures, computational complexity, randomness in computing, algorithmic graph theory and combinatorics, analysis of Boolean functions, approximation algorithms, cryptography, computational learning theory, continuous and discrete optimization, economics and computation, parallel and distributed algorithms, quantum computing, algorithmic coding theory, computational geometry and topology, computational applications of logic, algebraic computation, and computational and foundational aspects of areas such as machine learning, fairness, privacy, networks, data management, databases, and computational biology. Papers that extend the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged. The program committee will make every effort to consider a broad range of areas. Policy experiments for STOC 2027: In light of rapid advances in generative AI and their impact on research and scientific communication, STOC 2027 is experimenting with several new policies intended to encourage high-quality submissions and promote clear and effective communication of research. The policies below include mandatory public posting and mandatory video submission. Detailed instructions for these two requirements will be released closer to the paper submission deadline. At a high level, authors should be aware of the following changes: STOC 2027 submissions will not be anonymous; all listed authors must be human and are responsible for the submission. Each author may appear on at most five submissions. Every paper must be submitted to arXiv before the STOC paper submission deadline. Authors must provide a public arXiv URL or proof of arXiv submission along with their submission PDF, which must be identical to the arXiv version. Authors must submit a video explaining the work, its context, and its innovations relative to prior work. The video should be 20–30 minutes long and will be due 1–2 weeks after the paper submission deadline. Authors may use large language models (LLMs) and other generative AI tools in preparing papers. Substantive use must be disclosed in the paper; minor copy-editing and grammar or clarity improvements to the authors’ own text do not require disclosure, as detailed below. Program committee (PC) members and external reviewers (sub-reviewers) may use LLMs to assist with reviewing. All reviews and decisions remain the responsibility of the PC members and sub-reviewers. STOC 2027 is also exploring private LLM-based tools to assist authors before submission and reviewers during evaluation; details will be announced later.
由 Admin Agent 最后更新于

录用率

平均录用率: 26.7% 13 年间 (2005–2017).

年份提交数录用数录用率(%)
201742210324.4%
20163709224.9%
20153479326.8%
20143199128.5%
201336010027.8%
20123039029.7%
20113048427.6%
20102797828%
20093297723.4%
20083258024.6%
20073127724.7%
20062887827.1%
20052898429.1%

最佳论文

年份最佳论文
2026Separating QMA from QCMA with a Classical Oracle
2026Boolean Function Monotonicity Testing Requires (Almost) n^1/2 Queries
2025Quasi-Linear Size PCPs with Small Soundness from HDX
2025Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
2025Vizing's Theorem in Near-Linear Time
2025Simulating Time with Square-Root Space
2024Near Optimal Alphabet-Soundness Tradeoff PCPs
2024Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
2024Relaxed Local Correctability from Local Testing
2024Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
2024Single-Source Shortest Paths with Negative Real Weights in Õ(mn8/9) Time
2023The Randomized k-Server Conjecture Is False!
2023Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
2022Asymptotically good Quantum and locally testable classical LDPC codes
2022Locally testable codes with constant rate, distance, and locality
2021Indistinguishability Obfuscation from Well-Founded Assumptions
2021The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
2021A (Slightly) Improved Approximation Algorithm for Metric TSP
2020Improved Bounds for The Sunflower Lemma
2019The Reachability Problem for Petri Nets is Not Elementary
2018A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
2018An Almost-linear Time Algorithm for Uniform Random Spanning Tree Generation
2017Almost-polynomial Ratio Eth-hardness of Approximating Densest K-subgraph
2017Deciding Parity Games in Quasipolynomial Time
2017Explicit, Almost Optimal, Epsilon-Balanced Codes
2017A Weighted Linear Matroid Parity Algorithm
2016Graph Isomorphism in Quasipolynomial Time
2016The 4/3 Additive Spanner Exponent is Tight
2016A Tight Space Bound for Consensus
2016Explicit Two-Source Extractors and Resilient Functions
2016Reed-Muller Codes Achieve Capacity on Erasure Channels
2015Lower Bounds on the Size of Semidefinite Programming Relaxations
20152-Server PIR with sub-polynomial communication
2015Exponential Separation of Information and Communication for Boolean Functions
2014The matching polytope has exponential extension complexity
2013Low Rank Approximation and Regression in Input Sparsity Time
2013Approximation Resistance from Pairwise Independent Subgroups
2012Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds
2012The Cell Probe Complexity of Dynamic Range Counting
2011Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
2011Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
2010An improved LP-based approximation for steiner tree
2010QIP = PSPACE
2009A constructive proof of the Lovasz local lemma
2009Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
2008Optimal hierarchical decompositions for congestion minimization in networks
2008Optimal algorithms and inapproximability results for every CSP?
2007Towards 3-query locally decodable codes of subexponential length
2007Faster integer multiplication
2006The PCP theorem by gap amplification
2005Undirected ST-connectivity in log-space
2004Multi-linear formulas for permanent and determinant are of super-polynomial size
2004Expander flows, geometric embeddings and graph partitioning
2003New lattice based cryptographic constructions
2003Derandomizing polynomial identity tests means proving circuit lower bounds

看过这个的人也在看

CCFICORECP-I简称全称截稿日期会议日期
AA*96.8The Web ConferenceThe ACM Web Conference2026-10-182027-05-10
AA*92.4SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-07-20

相关会议

相关期刊

评论 0

暂无评论。

请登录后发表评论