Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs by Jain, Vishesh, Sah, Ashwin, Sawhney, Mehtaab

“…ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Discrepancy Minimization via a Self-Balancing Walk by Alweiss, Ryan, Liu, Yang P., Sawhney, Mehtaab

“…ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

How Asymmetry Helps Buffer Management: Achieving Optimal Tail Size in Cup Games by Kuszmaul, William

“…ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs by Dalirrooyfard, Mina, Wein, Nicole

“…ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Walking Randomly, Massively, and Efficiently by Lacki, Jakub, Onak, Krzysztof, Sankowski, Piotr, Mitrovic, Slobodan

“…ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Contention Resolution without Collision Detection by Bender, Michael A., Kopelowitz, Tsvi, Kuszmaul, William, Pettie, Seth

“…ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Strong Average-Case Lower Bounds from Non-trivial Derandomization by Chen, Lijie, Ren, Hanlin

“…ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

A Phase Transition and a Quadratic Time Unbiased Estimator for Network Reliability by Karger, David R.

“…ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Learning Mixtures of Linear Regressions in Subexponential Time via Fourier Moments by Chen, Sitan, Li, Jerry, Song, Zhao

“…ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Classical Algorithms, Correlation Decay, and Complex Zeros of Partition Functions of Quantum Many-Body Systems by Harrow, Aram W., Mehraban, Saeed, Soleimanifar, Mehdi

“…ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

No-Signaling Proofs with O(sqrt(log n)) Provers Is in PSPACE by Holden, Dhiraj, Kalai, Yael Tauman

“…ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Improved Approximations for Euclidean k-Means and k-Median, via Nested Quasi-Independent Sets by Cohen-Addad, Vincent, Esfandiari, Hossein, Mirrokni, Vahab, Narayanan, Shyam

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV by Chan, Timothy, Vassilevska Williams, Virginia, Xu, Yinzhan

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

On the Optimal Time/Space Tradeoff for Hash Tables by Bender, Michael A., Farach-Colton, Mart?n, Kuszmaul, John, Kuszmaul, William, Liu, Mingmou

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Online Edge Coloring via Tree Recurrences and Correlation Decay by Kulkarni, Janardhan, Liu, Yang P., Sawhney, Mehtaab, Sah, Ashwin, Tarnawski, Jakub

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Approximate Counting and Sampling via Local Central Limit Theorems by Jain, Vishesh, Perkins, Will, Sah, Ashwin, Sawhney, Mehtaab

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Circuits Resilient to Short-Circuit Errors by Efremenko, Klim, Haeupler, Bernhard, Kalai, Yael Tauman, Kamath, Pritish, Kol, Gillat, Resch, Nicolas, Saxena, Raghuvansh R.

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-player General-Sum Games by Anagnostides, Ioannis, Daskalakis, Constantinos, Farina, Gabriele, Fishelson, Maxwell, Golowich, Noah, Sandholm, Tuomas

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Breaking the nk barrier for minimum k-cut on simple graphs by He, Zhiyang, Li, Jason

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text

Clustering Mixtures with Almost Optimal Separation in Polynomial Time by Liu, Allen, Li, Jerry

“…ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing…”
Get full text