Media Summary: Constant Inapproximability for PPA Argyrios Deligkas (Royal Holloway, University of London), John Fearnley (University of ... Worst-Case to Average-Case Reductions via Additive Combinatorics Vahid R. Asadi (University of Waterloo), Alexander Golovnev ... On Inapproximability of Satisfiable 3-CSPs Amey Bhangale (University of California, Riverside), Subhash Khot (New York ...
Stoc 2022 Deterministic Massively Parallel - Detailed Analysis & Overview
Constant Inapproximability for PPA Argyrios Deligkas (Royal Holloway, University of London), John Fearnley (University of ... Worst-Case to Average-Case Reductions via Additive Combinatorics Vahid R. Asadi (University of Waterloo), Alexander Golovnev ... On Inapproximability of Satisfiable 3-CSPs Amey Bhangale (University of California, Riverside), Subhash Khot (New York ... An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem Anna Karlin (University of ... DISC 2021 — 35th International Symposium on Distributed Computing Presenter: Sung Kook Kim Presented at POPL'20.
Approximately Efficient Bilateral Trade Yuan Deng (Google Research), Jieming Mao (Google Research), Balasubramanian Sivan ... Hi i'm peter davies and i'm going to be talking about component stability in low space Expanders via Local Edge Flips in Quasilinear Time George Giakkoupis (Inria, Rennes, France)
