Información de la conferencia

STOC 2026: ACM Symposium on Theory of Computing

Por favor Iniciar sesión para ver el sitio web de la conferencia
Cuenta gratuita: consulta los sitios oficiales, sigue las fechas límite y recibe recordatorios por correo.
Iniciar sesión Registrarse

Día de Entrega:
2025-11-04
Fecha de Notificación:
2026-02-01
Fecha de conferencia:
2026-06-22
Ubicación:
Salt Lake City, Utah, USA
Ediciones:
58
CCF: a   CORE: a*   QUALIS: a1   Vistas: 25360165   Seguidores: 48   Asistentes: 7

Solicitud de Artículos

STOC 2026 (ACM Symposium on Theory of Computing) is a CCF A / CORE A* / QUALIS A1 conference held in Salt Lake City, Utah, USA on 2026-06-22. The paper submission deadline is 2025-11-04. Acceptance notifications are sent on 2026-02-01.

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. Double-blind reviewing will be used, and therefore submissions should not contain the authors' names or identifying information. A detailed Call for Papers will be made available here shortly.
Última actualización por Dou Sun el

Tasa de aceptación

Tasa de aceptación media: 26.7% en 13 años (2005–2017).

AñoEnviadosAceptadosAceptados(%)
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%

Los Mejores Artículos

AñoLos Mejores Artículos
2024Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
2024Relaxed Local Correctability from Local Testing
2024Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
2024Near Optimal Alphabet-Soundness Tradeoff PCPs
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
2018An Almost-linear Time Algorithm for Uniform Random Spanning Tree Generation
2018A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
2017Almost-polynomial Ratio Eth-hardness of Approximating Densest K-subgraph
2017Deciding Parity Games in Quasipolynomial Time
2017A Weighted Linear Matroid Parity Algorithm
2017Explicit, Almost Optimal, Epsilon-Balanced Codes
2016The 4/3 Additive Spanner Exponent is Tight
2016A Tight Space Bound for Consensus
2016Explicit Two-Source Extractors and Resilient Functions
2016Graph Isomorphism in Quasipolynomial Time
2016Reed-Muller Codes Achieve Capacity on Erasure Channels
2015Exponential Separation of Information and Communication for Boolean Functions
2015Lower Bounds on the Size of Semidefinite Programming Relaxations
20152-Server PIR with sub-polynomial communication
2014The matching polytope has exponential extension complexity
2013Low Rank Approximation and Regression in Input Sparsity Time
2013Approximation Resistance from Pairwise Independent Subgroups
2012The Cell Probe Complexity of Dynamic Range Counting
2012Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds
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
2009Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
2009A constructive proof of the Lovasz local lemma
2008Optimal algorithms and inapproximability results for every CSP?
2008Optimal hierarchical decompositions for congestion minimization in networks
2007Faster integer multiplication
2007Towards 3-query locally decodable codes of subexponential length
2006The PCP theorem by gap amplification
2005Undirected ST-connectivity in log-space
2004Expander flows, geometric embeddings and graph partitioning
2004Multi-linear formulas for permanent and determinant are of super-polynomial size
2003New lattice based cryptographic constructions
2003Derandomizing polynomial identity tests means proving circuit lower bounds

Las personas que vieron esto también vieron

CCFCOREQUALISAbreviaciónNombre CompletoEntregaNotificaciónFecha de conferencia
aa*a1UbicompACM International Joint Conference on Pervasive and Ubiquitous Computing2026-05-172026-07-012026-10-13
baa2RAIDInternational Symposium on Research in Attacks, Intrusions and Defenses2026-04-162026-07-102026-10-11
ScalComIEEE International Conference on Scalable Computing and Communications2026-05-312026-07-012026-09-07
aa*a1PLDIACM SIGPLAN conference on Programming Language Design and Implementation2025-11-132026-03-052026-06-15
baa1COLINGInternational Conference on Computational Linguistics2024-09-162024-11-292025-01-19
aa*SIGGRAPHInternational Conference and Exhibition on Computer Graphics and Interactive Techniques2026-01-152026-07-19
bbb4SGPSymposium on Geometry Processing2026-04-152026-05-252026-07-01
aa*a1SODAACM-SIAM Symposium on Discrete Algorithms2025-12-082026-01-11
bab1CCCIEEE Conference on Computational Complexity2026-02-062026-05-012026-08-03
baa2ESAEuropean Symposium on Algorithms2026-04-212026-06-262026-08-31

Conferencias Relacionadas

CCFCOREQUALISAbreviaciónNombre CompletoEntregaNotificaciónFecha de conferencia
aa*a1SIGIRInternational Conference on Research and Development in Information Retrieval2026-01-152026-04-022026-07-20
aa*a1AAAIAAAI Conference on Artificial Intelligence2026-07-212026-11-302027-02-16
aa*a1CVPRIEEE Conference on Computer Vision and Pattern Recognition2025-11-062026-02-202026-06-03
aa*a1IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
aa*a1OSDIUSENIX Symposium on Operating Systems Design and Implementation2025-12-042026-03-262026-07-13
aa*a1ICMLInternational Conference on Machine Learning2026-01-232026-07-06
aa*a1INFOCOMInternational Conference on Computer Communications2025-07-242025-12-082026-05-18
aa*a1ICCVInternational Conference on Computer Vision2025-03-072025-06-252025-10-19
aa*a1CHIACM Conference on Human Factors in Computing Systems2025-09-042026-01-152026-04-13
aaa2ISSTAInternational Symposium on Software Testing and Analysis2026-01-292026-06-252026-10-03

Revistas Relacionadas

Comentarios 0

Aún no hay comentarios.

Por favor Iniciar sesión para publicar un comentario

Publicidad