STOC 2023 - Session 10A - Finding a Small Vertex Cut on Distributed Networks.
STOC 2023 - Session 1C - Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions
STOC 2023 - Session1A - Sampling from convex sets with a cold start using multiscale decompositions.
STOC 2023 - 4B - Computing better approximate pure Nash equilibria in cut games via SDPs.
STOC 2023 - Session 9B - Quantum Advantage from Any Non-Local Game
STOC 2023 - Session 7C - A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths
STOC 2023 - 5A - Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees.
STOC 2023 - Session 1B - Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.
STOC 2023 - 4B - Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules.
STOC 2023 - Session10C - The Smoothed Complexity of Policy Iteration for Markov Decision Processes.
STOC 2023 - 5B - A polynomial-time classical algorithm for noisy random circuit sampling.
STOC 2023 - Session 8C - Tight Conditional Lower Bounds for Vertex Connectivity Problems.
STOC 2023 - 5A - Optimal Explicit Small-Depth Formulas for the Coin Problem.
STOC 2023 - 4B - On the Optimal Fixed-Price Mechanism in Bilateral Trade.
STOC 2023 - Session 8A - Shellability is hard even for balls
STOC 2023 - Session 10A - Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank.
STOC 2023 - 4C - Local and global expansion in random geometric graphs.
STOC 2023 - Session1B -Sublinear Algorithms for (1.5+ε)- Approximate Matching.
STOC 2023 - Session 1A - When Arthur has Neither Random Coins nor Time to Spare
STOC 2023 - Session 9C - Hausdorff and Gromov-Hausdorff stable subsets of the medial axis
