Stoc 2022 An Extendable Data

Quick Overview: Five institutional risk gauges are simultaneously flashing extreme euphoria — BofA's Bull & Bear indicator just triggered a sell ... Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary Adam Karczmarz (University of Warsaw ... Tom Gur (University of Warwick), Noam Lifshitz (Hebrew University of Jerusalem) and Siqi Liu (UC Berkeley)

Stoc 2022 An Extendable Data - Detailed Overview & Context

Five institutional risk gauges are simultaneously flashing extreme euphoria — BofA's Bull & Bear indicator just triggered a sell ... Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary Adam Karczmarz (University of Warsaw ... Tom Gur (University of Warwick), Noam Lifshitz (Hebrew University of Jerusalem) and Siqi Liu (UC Berkeley) Worst-Case to Average-Case Reductions via Additive Combinatorics Vahid R. Asadi (University of Waterloo), Alexander Golovnev ... An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem Anna Karlin (University of ... The Power of Two Choices in Graphical Allocation Nikhil Bansal (University of Michigan) and Ohad N. Feldheim (Hebrew ...

Directed flow-augmentation Eun Jung Kim (Université Paris-Dauphine, PSL Research University, CNRS), Stefan Kratsch ... Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers Jan van den Brand (Simons Institute and UC Berkeley), Yu Gao ... The Shortest Even Cycle Problem is Tractable Andreas Björklund (Lund, Sweden), Thore Husfeldt (Lund University and Basic ... Approximately Efficient Bilateral Trade Yuan Deng (Google Research), Jieming Mao (Google Research), Balasubramanian Sivan ... Edge Sampling and Graph Parameter Estimation via Vertex Neighborhood Accesses Jakub Tětek (Basic Algorithms Research ... Counting Small Induced Subgraphs with Hereditary Properties Jacob Focke (CISPA Helmholtz Center for Information Security) ...

The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in ... Near-Optimal Distributed Degree+1 Coloring Magnus M. Halldorsson (Reykjavik University), Fabian Kuhn (University of Freiburg), ... Improved Approximations for Euclidean k-means and k-median, via Nested Quasi-Independent Sets Vincent Cohen-Addad ... Title: Deterministic Massively Parallel Connectivity Authors: Sam Coy (University of Warwick) and Artur Czumaj (University of ... Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds Amos Beimel (Ben-Gurion ...