LIPIcs, Volume 124, ITCS 2019

• Avrim Blum LIPIcs, Volume 124, ITCS'19, Complete Volume 10.4230/LIPIcs.ITCS.2019
• Avrim Blum Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2019.0
• Shipra Agrawal, Mohammad Shadravan, and Cliff Stein Submodular Secretary Problem with Shortlists 10.4230/LIPIcs.ITCS.2019.1
• Dorit Aharonov and Leo Zhou Hamiltonian Sparsification and Gap-Simulation 10.4230/LIPIcs.ITCS.2019.2
• Alexandr Andoni, Robert Krauthgamer, and Yosef Pogrow On Solving Linear Systems in Sublinear Time 10.4230/LIPIcs.ITCS.2019.3
• Benny Applebaum and Prashant Nalini Vasudevan Placing Conditional Disclosure of Secrets in the Communication Complexity Universe 10.4230/LIPIcs.ITCS.2019.4
• Nick Arnosti and S. Matthew Weinberg Bitcoin: A Natural Oligopoly 10.4230/LIPIcs.ITCS.2019.5
• Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling 10.4230/LIPIcs.ITCS.2019.6
• Per Austrin, Petteri Kaski, and Kaie Kubjas Tensor Network Complexity of Multilinear Maps 10.4230/LIPIcs.ITCS.2019.7
• Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, and Srikanth Srinivasan A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates 10.4230/LIPIcs.ITCS.2019.8
• Boaz Barak, Pravesh K. Kothari, and David Steurer Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture 10.4230/LIPIcs.ITCS.2019.9
• Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, and Anand Natarajan Algorithms, Bounds, and Strategies for Entangled XOR Games 10.4230/LIPIcs.ITCS.2019.10
• Omri Ben-Eliezer Testing Local Properties of Arrays 10.4230/LIPIcs.ITCS.2019.11
• Eli Ben-Sasson and Eden Saig The Complexity of User Retention 10.4230/LIPIcs.ITCS.2019.12
• Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, and Sankeerth Rao Torus Polynomials: An Algebraic Approach to ACC Lower Bounds 10.4230/LIPIcs.ITCS.2019.13
• Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, and William S. Zwicker Almost Envy-Free Allocations with Connected Bundles 10.4230/LIPIcs.ITCS.2019.14
• Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani "Quantum Supremacy" and the Complexity of Random Circuit Sampling 10.4230/LIPIcs.ITCS.2019.15
• Elette Boyle, Rio LaVigne, and Vinod Vaikuntanathan Adversarially Robust Property-Preserving Hash Functions 10.4230/LIPIcs.ITCS.2019.16
• Karthik C. S. and Pasin Manurangsi On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic 10.4230/LIPIcs.ITCS.2019.17
• Igor Carboni Oliveira, Rahul Santhanam, and Roei Tell Expander-Based Cryptography Meets Natural Proofs 10.4230/LIPIcs.ITCS.2019.18
• André Chailloux A Note on the Quantum Query Complexity of Permutation Symmetric Functions 10.4230/LIPIcs.ITCS.2019.19
• Deeparnab Chakrabarty and C. Seshadhri Adaptive Boolean Monotonicity Testing in Total Influence Time 10.4230/LIPIcs.ITCS.2019.20
• Timothy M. Chan, Sariel Har-Peled, and Mitchell Jones On Locality-Sensitive Orderings and Their Applications 10.4230/LIPIcs.ITCS.2019.21
• Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, and Avishay Tal Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates 10.4230/LIPIcs.ITCS.2019.22
• Lijie Chen and Ruosong Wang Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols 10.4230/LIPIcs.ITCS.2019.23
• Wei Chen, Shang-Hua Teng, and Hanrui Zhang Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity 10.4230/LIPIcs.ITCS.2019.24
• Alessandro Chiesa, Peter Manohar, and Igor Shinkar Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing 10.4230/LIPIcs.ITCS.2019.25
• Chi-Ning Chou, Kai-Min Chung, and Chi-Jen Lu On the Algorithmic Power of Spiking Neural Networks 10.4230/LIPIcs.ITCS.2019.26
• Constantinos Daskalakis and Ioannis Panageas Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization 10.4230/LIPIcs.ITCS.2019.27
• Anindya De, Philip M. Long, and Rocco A. Servedio Density Estimation for Shift-Invariant Multidimensional Distributions 10.4230/LIPIcs.ITCS.2019.28
• Irit Dinur, Prahladh Harsha, Tali Kaufman, and Noga Ron-Zewi From Local to Robust Testing via Agreement Testing 10.4230/LIPIcs.ITCS.2019.29
• Irit Dinur, Oded Goldreich, and Tom Gur Every Set in P Is Strongly Testable Under a Suitable Encoding 10.4230/LIPIcs.ITCS.2019.30
• Shaddin Dughmi, David Kempe, and Ruixin Qiang Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice 10.4230/LIPIcs.ITCS.2019.31
• Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, and Avi Wigderson Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs 10.4230/LIPIcs.ITCS.2019.32
• Cynthia Dwork and Christina Ilvento Fairness Under Composition 10.4230/LIPIcs.ITCS.2019.33
• Yuval Filmus, Ryan O'Donnell, and Xinyu Wu A Log-Sobolev Inequality for the Multislice, with Applications 10.4230/LIPIcs.ITCS.2019.34
• Anna Gál, Avishay Tal, and Adrian Trejo Nuñez Cubic Formula Size Lower Bounds Based on Compositions with Majority 10.4230/LIPIcs.ITCS.2019.35
• Sumegha Garg and Jon Schneider The Space Complexity of Mirror Games 10.4230/LIPIcs.ITCS.2019.36
• Oded Goldreich and Dana Ron The Subgraph Testing Model 10.4230/LIPIcs.ITCS.2019.37
• Mika Göös, Pritish Kamath, Robert Robere, and Dmitry Sokolov Adventures in Monotone Complexity and TFNP 10.4230/LIPIcs.ITCS.2019.38
• Venkatesan Guruswami, Preetum Nakkiran, and Madhu Sudan Algorithmic Polarization for Hidden Markov Models 10.4230/LIPIcs.ITCS.2019.39
• Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, and Amir Yehudayoff On the Communication Complexity of Key-Agreement Protocols 10.4230/LIPIcs.ITCS.2019.40
• Linus Hamilton and Ankur Moitra The Paulsen Problem Made Simple 10.4230/LIPIcs.ITCS.2019.41
• Thibaut Horel, Sunoo Park, Silas Richelson, and Vinod Vaikuntanathan How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts 10.4230/LIPIcs.ITCS.2019.42
• Klaus Jansen and Lars Rohwedder On Integer Programming and Convolution 10.4230/LIPIcs.ITCS.2019.43
• Klaus Jansen, Kim-Manuel Klein, Marten Maack, and Malin Rau Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times 10.4230/LIPIcs.ITCS.2019.44
• Yan Jin, Elchanan Mossel, and Govind Ramnarayan Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't 10.4230/LIPIcs.ITCS.2019.45
• Ce Jin Simulating Random Walks on Graphs in the Streaming Model 10.4230/LIPIcs.ITCS.2019.46
• Markus Bläser and Gorav Jindal On the Complexity of Symmetric Polynomials 10.4230/LIPIcs.ITCS.2019.47
• Daniel M. Kane and Richard Ryan Williams The Orthogonal Vectors Conjecture for Branching Programs and Formulas 10.4230/LIPIcs.ITCS.2019.48
• Pravesh K. Kothari, Ryan O'Donnell, and Tselil Schramm SOS Lower Bounds with Hard Constraints: Think Global, Act Local 10.4230/LIPIcs.ITCS.2019.49
• Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, and Erik Vee Semi-Online Bipartite Matching 10.4230/LIPIcs.ITCS.2019.50
• Troy Lee, Maharshi Ray, and Miklos Santha Strategies for Quantum Races 10.4230/LIPIcs.ITCS.2019.51
• Amit Levi and Erik Waingarten Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs 10.4230/LIPIcs.ITCS.2019.52
• Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, and Huaxiong Wang Secret Sharing with Binary Shares 10.4230/LIPIcs.ITCS.2019.53
• Nati Linial, Toniann Pitassi, and Adi Shraibman On the Communication Complexity of High-Dimensional Permutations 10.4230/LIPIcs.ITCS.2019.54
• Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava Fisher Zeros and Correlation Decay in the Ising Model 10.4230/LIPIcs.ITCS.2019.55
• Dylan M. McKay and Richard Ryan Williams Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle 10.4230/LIPIcs.ITCS.2019.56
• Christos H. Papadimitriou and Santosh S. Vempala Random Projection in the Brain and Computation with Assemblies of Neurons 10.4230/LIPIcs.ITCS.2019.57
• Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee Local Computation Algorithms for Spanners 10.4230/LIPIcs.ITCS.2019.58
• Krzysztof Pietrzak Proofs of Catalytic Space 10.4230/LIPIcs.ITCS.2019.59
• Krzysztof Pietrzak Simple Verifiable Delay Functions 10.4230/LIPIcs.ITCS.2019.60
• Aaron Potechin Sum of Squares Lower Bounds from Symmetry and a Good Story 10.4230/LIPIcs.ITCS.2019.61
• Zachary Chase and Siddharth Prasad Learning Time Dependent Choice 10.4230/LIPIcs.ITCS.2019.62
• Sofya Raskhodnikova, Noga Ron-Zewi, and Nithin Varma Erasures vs. Errors in Local Decoding and Property Testing 10.4230/LIPIcs.ITCS.2019.63
• Adi Rosén and Florent Urrutia A New Approach to Multi-Party Peer-to-Peer Communication Complexity 10.4230/LIPIcs.ITCS.2019.64
• Aaron Schild A Schur Complement Cheeger Inequality 10.4230/LIPIcs.ITCS.2019.65
• Nguyen Kim Thang Game Efficiency Through Linear Programming Duality 10.4230/LIPIcs.ITCS.2019.66