Media Summary: Interior Point Methods with a Gradient Oracle. Adrian Vladu (CNRS, IRIF, Université Paris Cité) Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. Sophie Huiberts (Columbia University); Yin Tat ... When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Lijie Chen (Miller ...
Stoc 2023 Session 10c Algorithms - Detailed Analysis & Overview
Interior Point Methods with a Gradient Oracle. Adrian Vladu (CNRS, IRIF, Université Paris Cité) Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. Sophie Huiberts (Columbia University); Yin Tat ... When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Lijie Chen (Miller ... The Smoothed Complexity of Policy Iteration for Markov Decision Processes. Miranda Christ, Mihalis Yannakakis (Columbia ... Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast. Bernhard Haeupler (Carnegie Mellon ... Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. Vaclav Rozhon (ETH ...
Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ... On Regularity Lemma and Barriers in Streaming and Dynamic Matching. Sepehr Assadi (Rutgers University); Soheil Behnezhad ... Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. Elchanan Mossel (MIT); Allan Sly (Princeton); ...
