LIPIcs, Volume 245, APPROX/RANDOM 2022

• Amit Chakrabarti and Chaitanya Swamy LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume 10.4230/LIPIcs.APPROX/RANDOM.2022
• Amit Chakrabarti and Chaitanya Swamy Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX/RANDOM.2022.0
• Nikhil Bansal, Aditi Laddha, and Santosh Vempala A Unified Approach to Discrepancy Minimization 10.4230/LIPIcs.APPROX/RANDOM.2022.1
• Chin Ho Lee, Edward Pyne, and Salil Vadhan Fourier Growth of Regular Branching Programs 10.4230/LIPIcs.APPROX/RANDOM.2022.2
• Tali Kaufman and David Mass Double Balanced Sets in High Dimensional Expanders 10.4230/LIPIcs.APPROX/RANDOM.2022.3
• Antonio Blanca, Sarah Cannon, and Will Perkins Fast and Perfect Sampling of Subgraphs and Polymer Systems 10.4230/LIPIcs.APPROX/RANDOM.2022.4
• Tali Kaufman and Izhar Oppenheim High Dimensional Expansion Implies Amplified Local Testability 10.4230/LIPIcs.APPROX/RANDOM.2022.5
• Uma Girish, Kunal Mittal, Ran Raz, and Wei Zhan Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs 10.4230/LIPIcs.APPROX/RANDOM.2022.6
• Hermish Mehta and Daniel Reichman Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks 10.4230/LIPIcs.APPROX/RANDOM.2022.7
• Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, and Ke Wu Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions 10.4230/LIPIcs.APPROX/RANDOM.2022.8
• Xuangui Huang, Peter Ivanov, and Emanuele Viola Affine Extractors and AC0-Parity 10.4230/LIPIcs.APPROX/RANDOM.2022.9
• Zhao Song and Ruizhe Zhang Hyperbolic Concentration, Anti-Concentration, and Discrepancy 10.4230/LIPIcs.APPROX/RANDOM.2022.10
• Dan Karliner and Amnon Ta-Shma Improved Local Testing for Multiplicity Codes 10.4230/LIPIcs.APPROX/RANDOM.2022.11
• Itay Kalev and Amnon Ta-Shma Unbalanced Expanders from Multiplicity Codes 10.4230/LIPIcs.APPROX/RANDOM.2022.12
• Yi Li, Honghao Lin, David P. Woodruff, and Yuheng Zhang Streaming Algorithms with Large Approximation Factors 10.4230/LIPIcs.APPROX/RANDOM.2022.13
• Hridesh Kedia, Shunhao Oh, and Dana Randall Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems 10.4230/LIPIcs.APPROX/RANDOM.2022.14
• Maciej Skorski Tight Chernoff-Like Bounds Under Limited Independence 10.4230/LIPIcs.APPROX/RANDOM.2022.15
• Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, and Ruizhe Zhang Eigenstripping, Spectral Decay, and Edge-Expansion on Posets 10.4230/LIPIcs.APPROX/RANDOM.2022.16
• Iwan Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, and Hsin-Po Wang Accelerating Polarization via Alphabet Extension 10.4230/LIPIcs.APPROX/RANDOM.2022.17
• Louis Esperet, Nathaniel Harms, and Andrey Kupavskii Sketching Distances in Monotone Graph Classes 10.4230/LIPIcs.APPROX/RANDOM.2022.18
• Mika Göös and Siddhartha Jain Communication Complexity of Collision 10.4230/LIPIcs.APPROX/RANDOM.2022.19
• Venkatesan Guruswami, Xin Lyu, and Xiuhan Wang Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness 10.4230/LIPIcs.APPROX/RANDOM.2022.20
• Vishwas Bhargava, Ankit Garg, Neeraj Kayal, and Chandan Saha Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case 10.4230/LIPIcs.APPROX/RANDOM.2022.21
• Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, and Rosie Zhao Lower Bound Methods for Sign-Rank and Their Limitations 10.4230/LIPIcs.APPROX/RANDOM.2022.22
• V. Arvind, Abhranil Chatterjee, and Partha Mukhopadhyay Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time 10.4230/LIPIcs.APPROX/RANDOM.2022.23
• Antonio Blanca and Reza Gheissari Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster Dynamics 10.4230/LIPIcs.APPROX/RANDOM.2022.24
• Weiming Feng, Heng Guo, and Jiaheng Wang Improved Bounds for Randomly Colouring Simple Hypergraphs 10.4230/LIPIcs.APPROX/RANDOM.2022.25
• Yahel Manor and Or Meir Lifting with Inner Functions of Polynomial Discrepancy 10.4230/LIPIcs.APPROX/RANDOM.2022.26
• Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, and Sayantan Sen Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing 10.4230/LIPIcs.APPROX/RANDOM.2022.27
• Peter Mörters, Christian Sohler, and Stefan Walzer A Sublinear Local Access Implementation for the Chinese Restaurant Process 10.4230/LIPIcs.APPROX/RANDOM.2022.28
• Pu Gao, Calum MacRury, and Paweł Prałat A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process 10.4230/LIPIcs.APPROX/RANDOM.2022.29
• Marcos Kiwi, Markus Schepers, and John Sylvester Cover and Hitting Times of Hyperbolic Random Graphs 10.4230/LIPIcs.APPROX/RANDOM.2022.30
• Sepideh Mahabadi, David P. Woodruff, and Samson Zhou Adaptive Sketches for Robust Regression with Importance Sampling 10.4230/LIPIcs.APPROX/RANDOM.2022.31
• Simon Apers, Paweł Gawrychowski, and Troy Lee Finding the KT Partition of a Weighted Graph in Near-Linear Time 10.4230/LIPIcs.APPROX/RANDOM.2022.32
• Moran Feldman and Ariel Szarf Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model 10.4230/LIPIcs.APPROX/RANDOM.2022.33
• Shichuan Deng and Qianfan Zhang Ordered k-Median with Outliers 10.4230/LIPIcs.APPROX/RANDOM.2022.34
• Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, and Santhoshini Velusamy Sketching Approximability of (Weak) Monarchy Predicates 10.4230/LIPIcs.APPROX/RANDOM.2022.35
• Takuro Fukunaga Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling 10.4230/LIPIcs.APPROX/RANDOM.2022.36
• Roy Schwartz and Roded Zats Fair Correlation Clustering in General Graphs 10.4230/LIPIcs.APPROX/RANDOM.2022.37
• Joanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, and Santhoshini Velusamy On Sketching Approximations for Symmetric Boolean CSPs 10.4230/LIPIcs.APPROX/RANDOM.2022.38
• Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, and Slobodan Mitrović Massively Parallel Algorithms for Small Subgraph Counting 10.4230/LIPIcs.APPROX/RANDOM.2022.39
• Daniel A. Spielman and Peng Zhang Hardness Results for Weaver’s Discrepancy Problem 10.4230/LIPIcs.APPROX/RANDOM.2022.40
• Michael Dinitz, Ama Koranteng, and Guy Kortsarz Relative Survivable Network Design 10.4230/LIPIcs.APPROX/RANDOM.2022.41
• Venkatesan Guruswami, Pravesh K. Kothari, and Peter Manohar Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number 10.4230/LIPIcs.APPROX/RANDOM.2022.42
• Suprovat Ghoshal and Anand Louis Approximating CSPs with Outliers 10.4230/LIPIcs.APPROX/RANDOM.2022.43
• Frederick Qiu and Sahil Singla Submodular Dominance and Applications 10.4230/LIPIcs.APPROX/RANDOM.2022.44
• Marcin Bienkowski, Martin Böhm, Jarosław Byrka, and Jan Marcinkowski Online Facility Location with Linear Delay 10.4230/LIPIcs.APPROX/RANDOM.2022.45
• Allan Borodin, Calum MacRury, and Akash Rakheja Prophet Matching in the Probe-Commit Model 10.4230/LIPIcs.APPROX/RANDOM.2022.46
• Suprovat Ghoshal The Biased Homogeneous r-Lin Problem 10.4230/LIPIcs.APPROX/RANDOM.2022.47
• Sepehr Assadi and Hoai-An Nguyen Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting 10.4230/LIPIcs.APPROX/RANDOM.2022.48
• Max Klimm and Martin Knaack Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint 10.4230/LIPIcs.APPROX/RANDOM.2022.49
• Aleksa Stanković Some Results on Approximability of Minimum Sum Vertex Cover 10.4230/LIPIcs.APPROX/RANDOM.2022.50
• Michael Elkin and Chhaya Trehan (1+ε)-Approximate Shortest Paths in Dynamic Streams 10.4230/LIPIcs.APPROX/RANDOM.2022.51
• Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang Caching with Reserves 10.4230/LIPIcs.APPROX/RANDOM.2022.52
• Kheeran K. Naidu and Vihan Shah Space Optimal Vertex Cover in Dynamic Streams 10.4230/LIPIcs.APPROX/RANDOM.2022.53
• Debarati Das and Barna Saha Approximating LCS and Alignment Distance over Multiple Sequences 10.4230/LIPIcs.APPROX/RANDOM.2022.54
• Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, and Ziena Zeif A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs 10.4230/LIPIcs.APPROX/RANDOM.2022.55