LIPIcs, Volume 176, APPROX/RANDOM 2020

• Jarosław Byrka and Raghu Meka LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume 10.4230/LIPIcs.APPROX/RANDOM.2020
• Jarosław Byrka and Raghu Meka Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX/RANDOM.2020.0
• Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, and Noah Stephens-Davidowitz Extractor Lower Bounds, Revisited 10.4230/LIPIcs.APPROX/RANDOM.2020.1
• Kwangjun Ahn A Simpler Strong Refutation of Random k-XOR 10.4230/LIPIcs.APPROX/RANDOM.2020.2
• Sarah Miracle, Amanda Pascoe Streib, and Noah Streib Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains 10.4230/LIPIcs.APPROX/RANDOM.2020.3
• Zeyu Guo and Rohit Gurjar Improved Explicit Hitting-Sets for ROABPs 10.4230/LIPIcs.APPROX/RANDOM.2020.4
• Nader H. Bshouty Almost Optimal Testers for Concise Representations 10.4230/LIPIcs.APPROX/RANDOM.2020.5
• Noga Alon and Sepehr Assadi Palette Sparsification Beyond (Δ+1) Vertex Coloring 10.4230/LIPIcs.APPROX/RANDOM.2020.6
• Dean Doron, Amnon Ta-Shma, and Roei Tell On Hitting-Set Generators for Polynomials That Vanish Rarely 10.4230/LIPIcs.APPROX/RANDOM.2020.7
• Markus Bläser and Anurag Pandey Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness 10.4230/LIPIcs.APPROX/RANDOM.2020.8
• Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, and Mary Wootters Bounds for List-Decoding and List-Recovery of Random Linear Codes 10.4230/LIPIcs.APPROX/RANDOM.2020.9
• Ronen Shaltiel Is It Possible to Improve Yao’s XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle? 10.4230/LIPIcs.APPROX/RANDOM.2020.10
• Catherine Greenhill, Bernard Mans, and Ali Pourmiri Balanced Allocation on Dynamic Hypergraphs 10.4230/LIPIcs.APPROX/RANDOM.2020.11
• Jeff M. Phillips and Wai Ming Tai The GaussianSketch for Almost Relative Error Kernel Distance 10.4230/LIPIcs.APPROX/RANDOM.2020.12
• Eric Price and Jonathan Scarlett A Fast Binary Splitting Approach to Non-Adaptive Group Testing 10.4230/LIPIcs.APPROX/RANDOM.2020.13
• Jan Dreier, Philipp Kuinke, and Peter Rossmanith Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size 10.4230/LIPIcs.APPROX/RANDOM.2020.14
• Shuichi Hirahara and Osamu Watanabe On Nonadaptive Security Reductions of Hitting Set Generators 10.4230/LIPIcs.APPROX/RANDOM.2020.15
• Artur Czumaj, Hendrik Fichtenberger, Pan Peng, and Christian Sohler Testable Properties in General Graphs and Random Order Streaming 10.4230/LIPIcs.APPROX/RANDOM.2020.16
• Calvin Beideman, Karthekeyan Chandrasekaran, and Chao Xu Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs 10.4230/LIPIcs.APPROX/RANDOM.2020.17
• Eric Blais and Abhinav Bommireddi On Testing and Robust Characterizations of Convexity 10.4230/LIPIcs.APPROX/RANDOM.2020.18
• Reut Levi and Moti Medina Distributed Testing of Graph Isomorphism in the CONGEST Model 10.4230/LIPIcs.APPROX/RANDOM.2020.19
• Linh Tran and Van Vu Reaching a Consensus on Random Networks: The Power of Few 10.4230/LIPIcs.APPROX/RANDOM.2020.20
• Sumegha Garg, Pravesh K. Kothari, and Ran Raz Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich’s PRG 10.4230/LIPIcs.APPROX/RANDOM.2020.21
• Amit Chakrabarti, Prantar Ghosh, and Justin Thaler Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches 10.4230/LIPIcs.APPROX/RANDOM.2020.22
• Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond 10.4230/LIPIcs.APPROX/RANDOM.2020.23
• Clément L. Canonne and Karl Wimmer Testing Data Binnings 10.4230/LIPIcs.APPROX/RANDOM.2020.24
• Tali Kaufman and Ella Sharakanski Chernoff Bound for High-Dimensional Expanders 10.4230/LIPIcs.APPROX/RANDOM.2020.25
• Cyrus Rashtchian, David P. Woodruff, and Hanlin Zhu Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems 10.4230/LIPIcs.APPROX/RANDOM.2020.26
• Dana Ron and Asaf Rosin Almost Optimal Distribution-Free Sample-Based Testing of k-Modality 10.4230/LIPIcs.APPROX/RANDOM.2020.27
• Shalev Ben-David, Mika Göös, Robin Kothari, and Thomas Watson When Is Amplification Necessary for Composition in Randomized Query Complexity? 10.4230/LIPIcs.APPROX/RANDOM.2020.28
• Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, and Mrinal Kumar On Multilinear Forms: Bias, Correlation, and Tensor Rank 10.4230/LIPIcs.APPROX/RANDOM.2020.29
• Ben Lund and Aditya Potukuchi On the List Recoverability of Randomly Punctured Codes 10.4230/LIPIcs.APPROX/RANDOM.2020.30
• Sayan Bandyapadhyay On Perturbation Resilience of Non-Uniform k-Center 10.4230/LIPIcs.APPROX/RANDOM.2020.31
• Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, and Kirill Simonov Low-Rank Binary Matrix Approximation in Column-Sum Norm 10.4230/LIPIcs.APPROX/RANDOM.2020.32
• Parinya Chalermsook, Julia Chuzhoy, and Thatchaphol Saranurak Pinning down the Strong Wilber 1 Bound for Binary Search Trees 10.4230/LIPIcs.APPROX/RANDOM.2020.33
• Venkatesan Guruswami, Jakub Opršal, and Sai Sandeep Revisiting Alphabet Reduction in Dinur’s PCP 10.4230/LIPIcs.APPROX/RANDOM.2020.34
• Tatiana Starikovskaya, Michal Svagerka, and Przemysław Uznański L_p Pattern Matching in a Stream 10.4230/LIPIcs.APPROX/RANDOM.2020.35
• Karine Chubarian and Anastasios Sidiropoulos Computing Bi-Lipschitz Outlier Embeddings into the Line 10.4230/LIPIcs.APPROX/RANDOM.2020.36
• Nicole Megow and Lukas Nölke Online Minimum Cost Matching with Recourse on the Line 10.4230/LIPIcs.APPROX/RANDOM.2020.37
• Amey Bhangale, Diptarka Chakraborty, and Rajendra Kumar Hardness of Approximation of (Multi-)LCS over Small Alphabet 10.4230/LIPIcs.APPROX/RANDOM.2020.38
• Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, and Jiayi Xian On Approximating Degree-Bounded Network Design Problems 10.4230/LIPIcs.APPROX/RANDOM.2020.39
• Varun Gupta, Ravishankar Krishnaswamy, and Sai Sandeep Permutation Strikes Back: The Power of Recourse in Online Metric Matching 10.4230/LIPIcs.APPROX/RANDOM.2020.40
• Eden Chlamtáč and Petr Kolman How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut 10.4230/LIPIcs.APPROX/RANDOM.2020.41
• Xiangyu Guo, Janardhan Kulkarni, Shi Li, and Jiayi Xian On the Facility Location Problem in Online and Dynamic Models 10.4230/LIPIcs.APPROX/RANDOM.2020.42
• Ishan Agarwal, Oded Regev, and Yi Tang Nearly Optimal Embeddings of Flat Tori 10.4230/LIPIcs.APPROX/RANDOM.2020.43
• Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, and Malin Rau A Tight (3/2+ε) Approximation for Skewed Strip Packing 10.4230/LIPIcs.APPROX/RANDOM.2020.44
• Bohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, and Mina Valizadeh Learning Lines with Ordinal Constraints 10.4230/LIPIcs.APPROX/RANDOM.2020.45
• Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, and Przemysław Uznański Improved Circular k-Mismatch Sketches 10.4230/LIPIcs.APPROX/RANDOM.2020.46
• Arindam Khan and Madhusudhan Reddy Pittu On Guillotine Separability of Squares and Rectangles 10.4230/LIPIcs.APPROX/RANDOM.2020.47
• Lior Ben Yamin, Jing Li, Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai Maximizing Throughput in Flow Shop Real-Time Scheduling 10.4230/LIPIcs.APPROX/RANDOM.2020.48
• Dor Katzelnick and Roy Schwartz Maximizing the Correlation: Extending Grothendieck’s Inequality to Large Domains 10.4230/LIPIcs.APPROX/RANDOM.2020.49
• Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, and David P. Woodruff Streaming Complexity of SVMs 10.4230/LIPIcs.APPROX/RANDOM.2020.50
• Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, and Prafullkumar Tale On the Parameterized Approximability of Contraction to Classes of Chordal Graphs 10.4230/LIPIcs.APPROX/RANDOM.2020.51
• Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, and Adam Polak Online Coloring of Short Intervals 10.4230/LIPIcs.APPROX/RANDOM.2020.52
• Roy Schwartz and Yotam Sharoni Approximating Requirement Cut via a Configuration LP 10.4230/LIPIcs.APPROX/RANDOM.2020.53
• Sébastien Bubeck and Yuval Rabani Parametrized Metrical Task Systems 10.4230/LIPIcs.APPROX/RANDOM.2020.54
• Syamantak Das, Lavina Jain, and Nikhil Kumar A Constant Factor Approximation for Capacitated Min-Max Tree Cover 10.4230/LIPIcs.APPROX/RANDOM.2020.55
• Nima Anari and Thuy-Duong Vuong An Extension of Plücker Relations with Applications to Subdeterminant Maximization 10.4230/LIPIcs.APPROX/RANDOM.2020.56
• Buddhima Gamlath and Vadim Grinberg Approximating Star Cover Problems 10.4230/LIPIcs.APPROX/RANDOM.2020.57
• Neng Huang and Aaron Potechin On the Approximability of Presidential Type Predicates 10.4230/LIPIcs.APPROX/RANDOM.2020.58
• Sean Hallgren, Eunou Lee, and Ojas Parekh An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem 10.4230/LIPIcs.APPROX/RANDOM.2020.59
• Alexander Wei Better and Simpler Learning-Augmented Online Caching 10.4230/LIPIcs.APPROX/RANDOM.2020.60
• Sylvia Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, and Lu Wang A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case 10.4230/LIPIcs.APPROX/RANDOM.2020.61
• Chien-Chung Huang, Theophile Thiery, and Justin Ward Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints 10.4230/LIPIcs.APPROX/RANDOM.2020.62
• Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, and Yuhao Zhang Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs 10.4230/LIPIcs.APPROX/RANDOM.2020.63
• Ainesh Bakshi, Nadiia Chepurko, and David P. Woodruff Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams 10.4230/LIPIcs.APPROX/RANDOM.2020.64