2024 Proceeding- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
The papers in this volume were presented at the 56th Annual ACM Symposium on Theory of Computing (STOC 2024), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Vancouver, Canada, June 24--28, 2024, with the papers being presented as live talks.
Generalized GM-MDS: Polynomial Codes Are Higher Order MDS
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows that the generator matrices of Reed-Solomon codes can attain every possible configuration of zeros for an MDS code. The recently emerging theory of ...
AG Codes Achieve List Decoding Capacity over Constant-Sized Fields
The recently-emerging field of higher order MDS codes has sought to unify a number of concepts in coding theory. Such areas captured by higher order MDS codes include maximally recoverable (MR) tensor codes, codes with optimal list-decoding guarantees, ...
Constant Query Local Decoding against Deletions Is Impossible
Locally decodable codes (LDC’s) are error-correcting codes that allow recovery of individual message indices by accessing only a constant number of codeword indices. For substitution errors, it is evident that LDC’s exist – Hadamard codes are examples of ...
Local Correction of Linear Functions over the Boolean Cube
We consider the task of locally correcting, and locally list-correcting, multivariate linear functions over the domain {0,1}n over arbitrary fields and more generally Abelian groups. Such functions form error-correcting codes of relative distance 1/2 and ...
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
We prove that the blocklength n of a linear 3-query locally correctable code (LCC) L ∶ Fk → Fn with distance δ must be at least n ≥ 2Ω((δ2 k/(|F|−1)2)1/8). In particular, the blocklength of a linear 3-query LCC with constant distance over any small field ...
Explicit Two-Sided Unique-Neighbor Expanders
We study the problem of constructing explicit sparse graphs that exhibit strong vertex expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor expanders, meaning bipartite graphs where small sets contained in both the ...
Index Terms
- Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| STOC '15 | 347 | 93 | 27% |
| STOC '14 | 319 | 91 | 29% |
| STOC '13 | 360 | 100 | 28% |
| STOC '11 | 304 | 84 | 28% |
| STOC '08 | 325 | 80 | 25% |
| STOC '03 | 270 | 80 | 30% |
| STOC '02 | 287 | 91 | 32% |
| STOC '01 | 230 | 83 | 36% |
| STOC '00 | 182 | 85 | 47% |
| STOC '98 | 169 | 75 | 44% |
| STOC '97 | 211 | 75 | 36% |
| STOC '96 | 201 | 74 | 37% |
| STOC '89 | 196 | 56 | 29% |
| STOC '88 | 192 | 53 | 28% |
| STOC '87 | 165 | 50 | 30% |
| STOC '80 | 125 | 47 | 38% |
| STOC '79 | 111 | 37 | 33% |
| STOC '78 | 120 | 38 | 32% |
| STOC '77 | 87 | 31 | 36% |
| STOC '76 | 83 | 30 | 36% |
| STOC '75 | 87 | 31 | 36% |
| STOC '74 | 95 | 35 | 37% |
| STOC '71 | 50 | 23 | 46% |
| STOC '70 | 70 | 27 | 39% |
| Overall | 4,586 | 1,469 | 32% |