SIGACT EC

STOC24 8 A 5 Black Box PPP is Not Turing Closed

STOC24 8 A 5 Black Box PPP is Not Turing Closed
STOC24 10 A 4 Random order Contention Resolution via Continuous Induction

STOC24 10 A 4 Random order Contention Resolution via Continuous Induction
TCS for All Inspiration Talk: Prof. Luca Trevisan

TCS for All Inspiration Talk: Prof. Luca Trevisan
STOC24 7 A 5 Dynamic O(arboricity) coloring in polylogarithmic worst case time

STOC24 7 A 5 Dynamic O(arboricity) coloring in polylogarithmic worst case time
STOC24 3 A 5 Better coloring of 3-colorable graphs

STOC24 3 A 5 Better coloring of 3-colorable graphs
STOC24 11 A 1 Proof of the density threshold conjecture for pinwheel scheduling

STOC24 11 A 1 Proof of the density threshold conjecture for pinwheel scheduling
STOC24 2 B 1 Strong Algebras and Radical Sylvester Gallai Configurations

STOC24 2 B 1 Strong Algebras and Radical Sylvester Gallai Configurations
STOC24 2 D 5 No Regret Learning in Bilateral Trade via Global Budget Balance

STOC24 2 D 5 No Regret Learning in Bilateral Trade via Global Budget Balance
STOC24 3 C 4 Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice Based SNARKs

STOC24 3 C 4 Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice Based SNARKs
STOC24 4 B 2 Quantum and classical query complexities of functions of matrices

STOC24 4 B 2 Quantum and classical query complexities of functions of matrices
STOC24 5 A 5 Explicit two sided unique neighbor expanders

STOC24 5 A 5 Explicit two sided unique neighbor expanders
STOC24 6 B 1 Commitments from Quantum One Wayness

STOC24 6 B 1 Commitments from Quantum One Wayness
STOC24 6 D 1 Local geometry of NAE SAT solutions in the condensation regime

STOC24 6 D 1 Local geometry of NAE SAT solutions in the condensation regime
STOC24 11 B 4 No distributed quantum advantage for approximate graph coloring

STOC24 11 B 4 No distributed quantum advantage for approximate graph coloring
STOC24 11 D 3 Hardness Condensation by Restriction

STOC24 11 D 3 Hardness Condensation by Restriction
STOC24 3 C 5 Batch Proofs are Statistically Hiding

STOC24 3 C 5 Batch Proofs are Statistically Hiding
STOC24 2 B 2 Black Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipo

STOC24 2 B 2 Black Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipo
STOC24 2 B 3 The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups

STOC24 2 B 3 The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups
STOC24 3 A 1 0-1 Knapsack in Nearly Quadratic Time

STOC24 3 A 1 0-1 Knapsack in Nearly Quadratic Time
STOC24 3 D 1 Approximating Maximum Matching Requires Almost Quadratic Time

STOC24 3 D 1 Approximating Maximum Matching Requires Almost Quadratic Time
STOC24 11 B 5 Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond

STOC24 11 B 5 Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond
STOC24 11 C 1 Sum of Squares Lower Bounds for Independent Set on Ultra Sparse Random Graphs

STOC24 11 C 1 Sum of Squares Lower Bounds for Independent Set on Ultra Sparse Random Graphs
STOC24 11 C 2 Semidefinite programming and linear equations vs homomorphism problems

STOC24 11 C 2 Semidefinite programming and linear equations vs homomorphism problems
STOC24 3 D 2 Structural Complexities of Matching Mechanisms

STOC24 3 D 2 Structural Complexities of Matching Mechanisms
STOC24 3 D 3 A constant factor approximation for Nash social welfare with subadditive valuations

STOC24 3 D 3 A constant factor approximation for Nash social welfare with subadditive valuations
STOC24 3 D 4 Limitations of Stochastic Selection Problems with Pairwise Independent Priors

STOC24 3 D 4 Limitations of Stochastic Selection Problems with Pairwise Independent Priors
STOC24 3 D 5 Prophet Inequalities Require Only a Constant Number of Samples

STOC24 3 D 5 Prophet Inequalities Require Only a Constant Number of Samples
STOC24 3 B 1 Testing Closeness of Multivariate Distributions via Ramsey Theory

STOC24 3 B 1 Testing Closeness of Multivariate Distributions via Ramsey Theory
STOC24 3 B 2 Semidefinite programs simulate approximate message passing robustly

STOC24 3 B 2 Semidefinite programs simulate approximate message passing robustly
STOC24 3 B 4 Robust recovery for stochastic block models, simplified and generalized

STOC24 3 B 4 Robust recovery for stochastic block models, simplified and generalized