- ACM Symposium on Theory of Computing (STOC)
The Annual ACM Symposium on Theory of Computing (STOC), is the flagship conference of SIGACT, the Special Interest Group on Algorithms and Computation Theory, a special interest group of the Association for Computing Machinery (ACM)
- STOC 2025 - 57th ACM Symposium on Theory of Computing
The 57th ACM Symposium on Theory of Computing (STOC 2025) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and will be held in Prague, Czech Republic Monday, June 23 - Friday, June 27, 2025
- STOC 2025 Call for Papers
The 57th ACM Symposium on Theory of Computing (STOC 2025), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Prague, Czech Republic from Monday, June 23 to Friday, June 27
- STOC 2025 - 57th ACM Symposium on Theory of Computing
STOC 2025 Accepted Papers On the Locality of the Lovász Local Lemma Peter Davies-Peck (Durham University) Universal SNARGs for NP from Proofs of Completeness Zhengzhong Jin (Northeastern); Yael Kalai (MIT and MSR); Alex Lombardi (Princeton); Surya Mathialagan (MIT) Positive bias makes tensor-network contraction tractable
- STOC 2026 - 58th ACM Symposium on Theory of Computing
The 58th ACM Symposium on Theory of Computing (STOC 2026) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and will be held in Salt Lake City, Utah, USA Monday, June 22 - Friday, June 26, 2026
- STOC 2024 - 56th ACM Symposium on Theory of Computing
The 56th ACM Symposium on Theory of Computing (STOC 2024) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and will be held at the Sheraton Vancouver Wall Centre in Vancouver, British Columbia, Canada Monday, June 24 - Friday, June 28, 2024
- STOC 2023 - 55th ACM Symposium on Theory of Computing
The 55th ACM Symposium on Theory of Computing (STOC 2023) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and is being held in Orlando, Florida Tuesday, June 20 - Friday, June 23, 2023
- STOC 25: Proceedings of the 57th Annual ACM Symposium on Theory of . . .
Additionally, we lift the adaptive attack of Hardt and Woodruff (STOC, 2013) for breaking any real-valued linear sketch via a sequence of real-valued queries, and show how to obtain an attack on any integer-valued linear sketch using integer-valued queries
|