Volume 22 (2026, in progress)
Vol 22, Article 2272 (pp 1-16) [APRX-RND25 Spec Issue]
Equality is Far Weaker than Constant-Cost Communication
by Mika Göös, Nathaniel Harms, and Artur Riazanov
Vol 22, Article 2175 (pp 1-38)
Deterministic Identity Testing Paradigms for Bounded Top-fanin Depth-4 Circuits
by Pranjal Dutta, Prateek Dwivedi, and Nitin Saxena
Vol 22, Article 2168 (pp 1-58)
Hardness of Maximum Likelihood Learning of DPPs
by Elena Grigorescu, Brendan Juba, Karl Wimmer, and Ning Xie
Vol 22, Article 2140 (pp 1-30)
Computing the Theta Series
by Alexander Barvinok
Vol 22, Article 2111 (pp 1-25)
A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent
by Daniel Dadush, Haotian Jiang, and Victor Reis
Vol 22, Article 2098 (pp 1-32)
Visible Rank and Codes with Locality
by Omar Alrabiah and Venkatesan Guruswami
Vol 22, Article 2091 (pp 1-38)
An Algorithmic Framework for Colouring Locally Sparse Graphs
by Ewan Davies, Ross J. Kang, François Pirot, and Jean-Sébastien Sereni
Vol 22, Article 2077 (pp 1-53)
Online Directed Spanners and Steiner Forests
by Elena Grigorescu, Young-San Lin, and Kent Quanrud
Vol 22, Article 2072 (pp 1-27)
On the Probabilistic Degree of an $n$-variate Boolean Function
by Srikanth Srinivasan and S. Venkitesh
Vol 22, Article 2064 (pp 1-74) [CCC21 Spec Issue]
Hardness of KT Characterizes Parallel Cryptography
by Hanlin Ren and Rahul Santhanam
Vol 22, Article 1172 (pp 1-38) [APRX-RND19 Spec Issue]
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint
by Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, and Nabil H. Mustafa
Vol 22, Article 8 (pp 1-33)
Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions
by Hadley Black
Vol 22, Article 7 (pp 1-31)
New Lower Bounds for Probabilistic Degree and AC$0$ with Parity Gates
by Emanuele Viola
Vol 22, Article 6 (pp 1-48)
Training Fully Connected Neural Networks is ∃ℝ-Complete
by Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, and Simon Weber
Vol 22, Article 5 (pp 1-40)
PAC Verification of Statistical Algorithms
by Saachi Mutreja and Jonathan Shafer
Vol 22, Article 4 (pp 1-29) [CCC21 Spec Issue]
A Lower Bound for Polynomial Calculus with Extension Rule
by Yaroslav Alekseev
Vol 22, Article 3 (pp 1-63) [CCC21 Spec Issue]
Pseudodistributions That Beat All Pseudorandom Generators
by Edward Pyne and Salil Vadhan
Vol 22, Article 2 (pp 1-38) [CCC21 Spec Issue]
On The Power and Limitations of Branch and Cut
by Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, and Avi Wigderson
Vol 22, Article 1 (pp 1-4) [CCC21 Spec Issue]
Special Issue: CCC 2021: Guest Editors' Foreword
by Nutan Limaye and Igor C. Oliveira
List of Editors