Media Summary: Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. Amir Abboud (Weizmann Institute of ... Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. Timothy ... Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Gil Cohen (Tel Aviv University); Dean Doron (Ben ...
Stoc 2023 Session 1c Parallel - Detailed Analysis & Overview
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. Amir Abboud (Weizmann Institute of ... Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. Timothy ... 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 ... Streaming Euclidean Max-Cut: Dimension vs Data Reduction. Xiaoyu Chen, Shaofeng H.-C. Jiang (Peking University); Robert ... Certified Randomness from Quantum Supremacy. Scott Aaronson, Shih-Han Hung (UT Austin)
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning. Ilias Diakonikolas ... New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. David P. Woodruff, Taisuke Yasuda (Carnegie ... The Power of Multi-Step Vizing chains. Aleksander Bjørn Grodt Christiansen (Technical University of Denmark, DTU) Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ... Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. Ravishankar Krishnaswamy (Microsoft ...
