Quick Overview: Marcin Pilipczuk: Directed flow-augmentation The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in ... Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV ...
Stoc 2022 Directed Flow Augmentation - Detailed Overview & Context
Marcin Pilipczuk: Directed flow-augmentation The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in ... Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV ... Constant Inapproximability for PPA Argyrios Deligkas (Royal Holloway, University of London), John Fearnley (University of ... The Power of Two Choices in Graphical Allocation Nikhil Bansal (University of Michigan) and Ohad N. Feldheim (Hebrew ... Tom Gur (University of Warwick), Noam Lifshitz (Hebrew University of Jerusalem) and Siqi Liu (UC Berkeley)
Mitali Bafna (Harvard), Max Hopkins (UCSD), Tali Kaufman (Bar Ilan University) and Shachar Lovett (UCSD) The Shortest Even Cycle Problem is Tractable Andreas Björklund (Lund, Sweden), Thore Husfeldt (Lund University and Basic ... Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor Daniel Lokshtanov (University of California ... Approximately Efficient Bilateral Trade Yuan Deng (Google Research), Jieming Mao (Google Research), Balasubramanian Sivan ... Matrix anti-concentration inequalities with applications Zipei Nie (Lagrange Mathematics and Computing Research Center) Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers Jan van den Brand (Simons Institute and UC Berkeley), Yu Gao ...
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds Amos Beimel (Ben-Gurion ... Breaking the n^k Barrier for Minimum k-cut on Simple Graphs Zhiyang He (MIT) and Jason Li (UC Berkeley)
