LIPIcs, Volume 145, APPROX/RANDOM 2019

• Dimitris Achlioptas and László A. Végh LIPIcs, Volume 145, APPROX/RANDOM'19, Complete Volume 10.4230/LIPIcs.APPROX-RANDOM.2019
• Dimitris Achlioptas and László A. Végh Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX-RANDOM.2019.0
• Manuel Fernández V, David P. Woodruff, and Taisuke Yasuda The Query Complexity of Mastermind with l_p Distances 10.4230/LIPIcs.APPROX-RANDOM.2019.1
• Chi-Ning Chou, Zhixian Lei, and Preetum Nakkiran Tracking the l_2 Norm with Constant Update Time 10.4230/LIPIcs.APPROX-RANDOM.2019.2
• Benjamin Moseley and Maxim Sviridenko Submodular Optimization with Contention Resolution Extensions 10.4230/LIPIcs.APPROX-RANDOM.2019.3
• David Ellis Hershkowitz, R. Ravi, and Sahil Singla Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty 10.4230/LIPIcs.APPROX-RANDOM.2019.4
• Venkatesan Guruswami and Runzhou Tao Streaming Hardness of Unique Games 10.4230/LIPIcs.APPROX-RANDOM.2019.5
• Arnold Filtser On Strong Diameter Padded Decompositions 10.4230/LIPIcs.APPROX-RANDOM.2019.6
• Alon Eden, Uriel Feige, and Michal Feldman Max-Min Greedy Matching 10.4230/LIPIcs.APPROX-RANDOM.2019.7
• Gary L. Miller, Noel J. Walkington, and Alex L. Wang Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues 10.4230/LIPIcs.APPROX-RANDOM.2019.8
• Prahladh Harsha, Subhash Khot, Euiwoong Lee, and Devanathan Thiruvenkatachari Improved 3LIN Hardness via Linear Label Cover 10.4230/LIPIcs.APPROX-RANDOM.2019.9
• Ilan Reuven Cohen, Alon Eden, Amos Fiat, and Łukasz Jeż Dynamic Pricing of Servers on Trees 10.4230/LIPIcs.APPROX-RANDOM.2019.10
• Eden Chlamtáč, Michael Dinitz, and Thomas Robinson Approximating the Norms of Graph Spanners 10.4230/LIPIcs.APPROX-RANDOM.2019.11
• Dhruv Rohatgi Conditional Hardness of Earth Mover Distance 10.4230/LIPIcs.APPROX-RANDOM.2019.12
• Reyna Hulett Single-Elimination Brackets Fail to Approximate Copeland Winner 10.4230/LIPIcs.APPROX-RANDOM.2019.13
• Timothy Carpenter, Ario Salmasi, and Anastasios Sidiropoulos Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion 10.4230/LIPIcs.APPROX-RANDOM.2019.14
• Venkatesan Guruswami and Sai Sandeep Rainbow Coloring Hardness via Low Sensitivity Polymorphisms 10.4230/LIPIcs.APPROX-RANDOM.2019.15
• Eric Allender, Martín Farach-Colton, and Meng-Tsung Tsai Syntactic Separation of Subset Satisfiability Problems 10.4230/LIPIcs.APPROX-RANDOM.2019.16
• Dimitris Fotakis, Jannik Matuschke, and Orestis Papadigenopoulos Malleable Scheduling Beyond Identical Machines 10.4230/LIPIcs.APPROX-RANDOM.2019.17
• Ioana O. Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, and Melanie Schmidt On the Cost of Essentially Fair Clusterings 10.4230/LIPIcs.APPROX-RANDOM.2019.18
• Neeraj Kumar, Stavros Sintos, and Subhash Suri The Maximum Exposure Problem 10.4230/LIPIcs.APPROX-RANDOM.2019.19
• Sagar Kale Small Space Stream Summary for Matroid Center 10.4230/LIPIcs.APPROX-RANDOM.2019.20
• Alexander Birx, Yann Disser, and Kevin Schewior Improved Bounds for Open Online Dial-a-Ride on the Line 10.4230/LIPIcs.APPROX-RANDOM.2019.21
• Susanne Albers, Arindam Khan, and Leon Ladewig Improved Online Algorithms for Knapsack and GAP in the Random Order Model 10.4230/LIPIcs.APPROX-RANDOM.2019.22
• Kent Quanrud Fast and Deterministic Approximations for k-Cut 10.4230/LIPIcs.APPROX-RANDOM.2019.23
• Per Austrin and Aleksa Stanković Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder 10.4230/LIPIcs.APPROX-RANDOM.2019.24
• Andreas S. Schulz and Rajan Udwani Robust Appointment Scheduling with Heterogeneous Costs 10.4230/LIPIcs.APPROX-RANDOM.2019.25
• Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, and Maksim Nikolaev Collapsing Superstring Conjecture 10.4230/LIPIcs.APPROX-RANDOM.2019.26
• Vladimir Braverman, Harry Lang, Enayat Ullah, and Samson Zhou Improved Algorithms for Time Decay Streams 10.4230/LIPIcs.APPROX-RANDOM.2019.27
• Suprovat Ghoshal, Anand Louis, and Rahul Raychaudhury Approximation Algorithms for Partially Colorable Graphs 10.4230/LIPIcs.APPROX-RANDOM.2019.28
• Rajesh Jayaram and David P. Woodruff Towards Optimal Moment Estimation in Streaming and Distributed Models 10.4230/LIPIcs.APPROX-RANDOM.2019.29
• Umang Bhaskar and Gunjan Kumar The Complexity of Partial Function Extension for Coverage Functions 10.4230/LIPIcs.APPROX-RANDOM.2019.30
• Sevag Gharibian and Ojas Parekh Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut 10.4230/LIPIcs.APPROX-RANDOM.2019.31
• Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, and Nabil H. Mustafa Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint 10.4230/LIPIcs.APPROX-RANDOM.2019.32
• Devvrit, Ravishankar Krishnaswamy, and Nived Rajaraman Robust Correlation Clustering 10.4230/LIPIcs.APPROX-RANDOM.2019.33
• Chao Liao, Jiabao Lin, Pinyan Lu, and Zhenyu Mao Counting Independent Sets and Colorings on Random Regular Bipartite Graphs 10.4230/LIPIcs.APPROX-RANDOM.2019.34
• Josep Diaz and Mordecai Golin The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions 10.4230/LIPIcs.APPROX-RANDOM.2019.35
• Michael Anastos and Alan Frieze On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs 10.4230/LIPIcs.APPROX-RANDOM.2019.36
• Matthew Fahrbach and Dana Randall Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases 10.4230/LIPIcs.APPROX-RANDOM.2019.37
• Ray Li and Mary Wootters Lifted Multiplicity Codes and the Disjoint Repair Group Property 10.4230/LIPIcs.APPROX-RANDOM.2019.38
• Grant Schoenebeck, Biaoshuai Tao, and Fang-Yi Yu Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization 10.4230/LIPIcs.APPROX-RANDOM.2019.39
• Irit Dinur and Konstantin Golubev Direct Sum Testing: The General Case 10.4230/LIPIcs.APPROX-RANDOM.2019.40
• Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, and Eric Vigoda Fast Algorithms at Low Temperatures via Markov Chains 10.4230/LIPIcs.APPROX-RANDOM.2019.41
• Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil Vadhan Deterministic Approximation of Random Walks in Small Space 10.4230/LIPIcs.APPROX-RANDOM.2019.42
• Avraham Ben-Aroya, Gil Cohen, Dean Doron, and Amnon Ta-Shma Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions 10.4230/LIPIcs.APPROX-RANDOM.2019.43
• Frank Ban, Xi Chen, Rocco A. Servedio, and Sandip Sinha Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions 10.4230/LIPIcs.APPROX-RANDOM.2019.44
• Rocco A. Servedio and Li-Yang Tan Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas 10.4230/LIPIcs.APPROX-RANDOM.2019.45
• Bruce Spang and Mary Wootters Unconstraining Graph-Constrained Group Testing 10.4230/LIPIcs.APPROX-RANDOM.2019.46
• Ioannis Z. Emiris, Vasilis Margonis, and Ioannis Psarros Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l_1 10.4230/LIPIcs.APPROX-RANDOM.2019.47
• Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Štefankovič, and Eric Vigoda Improved Strong Spatial Mixing for Colorings on Trees 10.4230/LIPIcs.APPROX-RANDOM.2019.48
• Domagoj Bradac, Sahil Singla, and Goran Zuzic (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing 10.4230/LIPIcs.APPROX-RANDOM.2019.49
• Roy Gotlib and Tali Kaufman Testing Odd Direct Sums Using High Dimensional Expanders 10.4230/LIPIcs.APPROX-RANDOM.2019.50
• Mika Göös and Thomas Watson A Lower Bound for Sampling Disjoint Sets 10.4230/LIPIcs.APPROX-RANDOM.2019.51
• Ronitt Rubinfeld and Arsen Vasilyan Approximating the Noise Sensitivity of a Monotone Boolean Function 10.4230/LIPIcs.APPROX-RANDOM.2019.52
• Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, and Barna Saha Connectivity of Random Annulus Graphs and the Geometric Block Model 10.4230/LIPIcs.APPROX-RANDOM.2019.53
• Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, and Andréa W. Richa A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems 10.4230/LIPIcs.APPROX-RANDOM.2019.54
• Mark Bun and Justin Thaler The Large-Error Approximate Degree of AC^0 10.4230/LIPIcs.APPROX-RANDOM.2019.55
• Alexander Golovnev, Mika Göös, Daniel Reichman, and Igor Shinkar String Matching: Communication, Circuits, and Learning 10.4230/LIPIcs.APPROX-RANDOM.2019.56
• V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay Efficient Black-Box Identity Testing for Free Group Algebras 10.4230/LIPIcs.APPROX-RANDOM.2019.57
• Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, and Angelika Steger The Maximum Label Propagation Algorithm on Sparse Random Graphs 10.4230/LIPIcs.APPROX-RANDOM.2019.58
• Rohit Agrawal Samplers and Extractors for Unbounded Functions 10.4230/LIPIcs.APPROX-RANDOM.2019.59
• Svante Janson and Gregory B. Sorkin Successive Minimum Spanning Trees 10.4230/LIPIcs.APPROX-RANDOM.2019.60
• Meena Jagadeesan Simple Analysis of Sparse, Sign-Consistent JL 10.4230/LIPIcs.APPROX-RANDOM.2019.61
• Vladimir Braverman, Dan Feldman, Harry Lang, and Daniela Rus Streaming Coreset Constructions for M-Estimators 10.4230/LIPIcs.APPROX-RANDOM.2019.62
• Shyam Narayanan Pairwise Independent Random Walks Can Be Slightly Unbounded 10.4230/LIPIcs.APPROX-RANDOM.2019.63
• Zongchen Chen and Santosh S. Vempala Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions 10.4230/LIPIcs.APPROX-RANDOM.2019.64
• Amos Beimel, Kobbi Nissim, and Mohammad Zaheri Exploring Differential Obliviousness 10.4230/LIPIcs.APPROX-RANDOM.2019.65
• Michael Anastos, Peleg Michaeli, and Samantha Petti Thresholds in Random Motif Graphs 10.4230/LIPIcs.APPROX-RANDOM.2019.66
• Antonio Blanca, Reza Gheissari, and Eric Vigoda Random-Cluster Dynamics in Z^2: Rapid Mixing with General Boundary Conditions 10.4230/LIPIcs.APPROX-RANDOM.2019.67
• Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, and Shashwat Silas On List Recovery of High-Rate Tensor Codes 10.4230/LIPIcs.APPROX-RANDOM.2019.68
• Grigory Yaroslavtsev and Samson Zhou Approximate F_2-Sketching of Valuation Functions 10.4230/LIPIcs.APPROX-RANDOM.2019.69
• Amit Chakrabarti and Prantar Ghosh Streaming Verification of Graph Computations via Graph Structure 10.4230/LIPIcs.APPROX-RANDOM.2019.70
• Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, and Christopher Williamson Approximate Degree, Secret Sharing, and Concentration Phenomena 10.4230/LIPIcs.APPROX-RANDOM.2019.71
• Fu Li and David Zuckerman Improved Extractors for Recognizable and Algebraic Sources 10.4230/LIPIcs.APPROX-RANDOM.2019.72