Media Summary: Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Gil Cohen (Tel Aviv University); Dean Doron (Ben ... Algorithms approaching the threshold for semi-random planted clique. Rares-Darius Buhai (ETH Zurich); Pravesh K. Kothari ... Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ...
Stoc 2023 Session 1c Parallel - Detailed Analysis & Overview
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Gil Cohen (Tel Aviv University); Dean Doron (Ben ... Algorithms approaching the threshold for semi-random planted clique. Rares-Darius Buhai (ETH Zurich); Pravesh K. Kothari ... Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ... Certified Randomness from Quantum Supremacy. Scott Aaronson, Shih-Han Hung (UT Austin) Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. Ravishankar Krishnaswamy (Microsoft ... Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. Elchanan Mossel (MIT); Allan Sly (Princeton); ...
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. Qipeng Liu (Simons Institute); Ran Raz, Wei ... Stochastic Minimum Vertex Cover in General Graphs: a 3/2-Approximation. Mahsa Derakhshan (Northeastern University); Naveen ... Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. Pooya Hatami (Ohio State University); William Hoza (Simons Institute ... Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. Jiatu Li (Tsinghua University); Igor C. Oliveira ... A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. Julia Chuzhoy (Toyota Technological Institute at ...
