25:00 Session 1A - Bipartite TSP in O(1.9999ⁿ) Time, Assuming Quadratic Time Matrix Multiplication Association for Computing…
20:10 Session 2B - Concentration on the Boolean hypercube via pathwise stochastic analysis Association for Computing…
24:48 Session 2A - Fully-dynamic Planarity Testing in Polylogarithmic Time Association for Computing…
32:47 Session 6B - Efficient sampling and counting algorithms for the Potts model Association for Computing…
25:49 Session 4B - Arikan meets Shannon: Polar codes with near-optimal convergence to channel capacity Association for Computing…
20:48 Session 3B - Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing ... Association for Computing…
25:01 Session 3A -Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization Association for Computing…
25:50 Session 3A - Faster Parallel Algorithm for Approximate Shortest Path Association for Computing…
25:00 Session 7C - Does Learning Require Memorization? A Short Tale about a Long Tail Association for Computing…
26:02 Session 5 - Improved Bounds for perfect sampling of k-colorings in graphs Association for Computing…
17:54 Session 4B - Combinatorial List Decoding of Reed-Solomon Codes beyond the Johnson Radius Association for Computing…
25:02 Session 1A - An Improved Approximation Algorithm for TSP in the Half Integral Case Association for Computing…
19:23 Session 10C - Coresets for Clustering in Euclidean Spaces: Importance Sampling is Nearly Optimal Association for Computing…
22:41 Session 2A - New Algorithms and Hardness for Incremental SSSP in Directed Graphs Association for Computing…
22:24 Session 2C - One-shot Signatures and Applications to Hybrid Quantum/Classical Authentication Association for Computing…
20:29 Session 4C - Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond Association for Computing…
20:05 Session 4A - Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms Association for Computing…
24:33 Session 4C - Learning Mixtures of Linear Regressions in Subexponential Time via Fourier Moments Association for Computing…
25:21 Session 1C - Optimal Time and Space Leader Election in Population Protocols Association for Computing…
24:28 Session 3C - Private Stochastic Convex Optimization: Optimal Rates in Linear Time Association for Computing…
23:52 Session 3B - Classical algorithms, correlation decay, and complex zeros of partition functions of... Association for Computing…
24:00 Session 1C - A polynomial lower bound on adaptive complexity of submodular maximization Association for Computing…
22:50 Session 8C - Towards a Better Understanding of Randomized Greedy Matching Association for Computing…
22:17 Session 8B - Smoothed Complexity of Local Max-Cut and Binary Max-CSP Association for Computing…
23:47 Session 6A - Dynamic Algorithms for LIS and Distance to Monotonicity Association for Computing…
26:28 Session 2C - Data Structures Meet Cryptography: 3SUM with Preprocessing Association for Computing…
21:08 Session 7A - Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime Association for Computing…
18:12 Session 6C - Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent Association for Computing…
28:16 Session 9B - Extractors for Adversarial Sources via Extremal Hypergraphs Association for Computing…
20:43 Session 10B - Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization Association for Computing…
22:01 Session 3B - Quadratic speedup for finding marked vertices by quantum walks Association for Computing…
24:06 Session 9C - Exploration with limited memory: streaming algorithms for coin tossing, noisy compariso Association for Computing…
26:11 Session 4C - Estimating Normalizing Constants for Log-Concave Distributions Association for Computing…
26:06 Session 9C - Separations and equivalences between turnstile streaming and linear sketching Association for Computing…
29:26 Session 1B - Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture Association for Computing…
24:27 Session 6A - Constant factor approximations to edit distance on in nearly linear time Association for Computing…
20:42 Session 3A - Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths Association for Computing…
25:01 Session 2A - Rounding Dynamic Matchings Against an Adaptive Adversary Association for Computing…
28:00 Session 7B - Computations with Greater Quantum Depth Are Strictly More Powerful (Rel to an Oracle) Association for Computing…
19:46 Session 9A - Online Primal Dual Meets Online Matching with Stochastic Rewards Using Configuration LP Association for Computing…
18:36 Session 3C - The Power of Factorization Mechanisms in Local and Central Differential Privacy Association for Computing…
23:50 Session 8C - Stochastic Matching with Few Queries: (1-epsilon) Approximation Association for Computing…
23:51 Session 7C - An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games Association for Computing…
23:50 Session 6C - A scaling-invariant LP solver whose running time depends only on the constraint matrix Association for Computing…
28:13 Session 9B - Improved Analysis of Higher Order Random Walks and Applications Association for Computing…
23:59 Session 7C - On the Computability of Continuous Maximum Entropy Distributions with Applications Association for Computing…
24:43 Session 9A - Unbounded lower bound for k-server against weak adversaries Association for Computing…
25:50 Session 2C - Better Secret Sharing via Robust Conditional Disclosure of Secrets Association for Computing…
26:25 Session 7B - Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond Association for Computing…
24:58 Session 10B - The One-way Communication Complexity of Submodular Maximization with Applications ... Association for Computing…
22:20 Session 8B - Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions Association for Computing…
32:08 Session 4A - A Phase Transition and Quadratic Time Estimator for Network Reliability Association for Computing…
23:42 Session 10A - An Exponential Time Parameterized Algorithm for Planar Disjoint Paths Association for Computing…
25:47 Session 7A - Lifting Sum-of-Squares Lower Bounds: Degree-2 to Degree-4 Association for Computing…
29:37 Session 8A - New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut Association for Computing…
20:07 Session 7A - Breaching the 2-Approximation Barrier for Connectivity Augmentation Association for Computing…
23:17 Session 6C - Solving Tall Dense Linear Programs in Nearly Linear Time Association for Computing…
21:39 Session 3A - Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators Association for Computing…
21:47 Session 8A - Constant Girth Approximation for Directed Graphs in Subquadratic Time Association for Computing…
23:44 Session 3C - Interaction is necessary for distributed learning with privacy or communication constr… Association for Computing…
19:36 Session 10B - A Robust Version of Hegedus's Lemma, with Applications Association for Computing…
21:59 Session 8C - The Communication Complexity of Truthful vs Non-Truthful Combinatorial Auctions Association for Computing…
21:03 Session 4B - Optimally Resilient Codes for List-Decoding from Insertions and Deletions Association for Computing…
24:38 Session 7C - Efficiently Learning Structured Distributions from Untrusted Batches Association for Computing…
