LIPIcs, Volume 67, ITCS 2017

• Christos H. Papadimitriou LIPIcs, Volume 67, ITCS'17, Complete Volume 10.4230/LIPIcs.ITCS.2017
• Christos H. Papadimitriou Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ITCS.2017.0
• James R. Lee Separators in Region Intersection Graphs 10.4230/LIPIcs.ITCS.2017.1
• Ioannis Panageas and Georgios Piliouras Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions 10.4230/LIPIcs.ITCS.2017.2
• Zeyuan Allen-Zhu and Lorenzo Orecchia Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent 10.4230/LIPIcs.ITCS.2017.3
• Tali Kaufman and David Mass High Dimensional Random Walks and Colorful Expansion 10.4230/LIPIcs.ITCS.2017.4
• Prasad Raghavendra, Nick Ryder, and Nikhil Srivastava Real Stability Testing 10.4230/LIPIcs.ITCS.2017.5
• Silvio Micali Very Simple and Efficient Byzantine Agreement 10.4230/LIPIcs.ITCS.2017.6
• Benny Applebaum, Naama Haramaty-Krasne, Yuval Ishai, Eyal Kushilevitz, and Vinod Vaikuntanathan Low-Complexity Cryptographic Hash Functions 10.4230/LIPIcs.ITCS.2017.7
• Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, and Gil Segev Hierarchical Functional Encryption 10.4230/LIPIcs.ITCS.2017.8
• Arpita Ghosh and Robert Kleinberg Inferential Privacy Guarantees for Differentially Private Mechanisms 10.4230/LIPIcs.ITCS.2017.9
• Jeremiah Blocki, Manuel Blum, Anupam Datta, and Santosh Vempala Towards Human Computable Passwords 10.4230/LIPIcs.ITCS.2017.10
• Amir Abboud and Arturs Backurs Towards Hardness of Approximation for Polynomial Time Problems 10.4230/LIPIcs.ITCS.2017.11
• Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Nithin Varma Parameterized Property Testing of Functions 10.4230/LIPIcs.ITCS.2017.12
• Shafi Goldwasser and Dhiraj Holden The Complexity of Problems in P Given Correlated Instances 10.4230/LIPIcs.ITCS.2017.13
• Martin Fürer Multi-Clique-Width 10.4230/LIPIcs.ITCS.2017.14
• Nancy Lynch, Cameron Musco, and Merav Parter Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks 10.4230/LIPIcs.ITCS.2017.15
• Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, and Vijay V. Vazirani Mutation, Sexual Reproduction and Survival in Dynamic Environments 10.4230/LIPIcs.ITCS.2017.16
• Bernard Chazelle and Chu Wang Self-Sustaining Iterated Learning 10.4230/LIPIcs.ITCS.2017.17
• Mark Braverman, Sumegha Garg, and Ariel Schvartzman Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All 10.4230/LIPIcs.ITCS.2017.18
• Badih Ghazi, Elad Haramaty, Pritish Kamath, and Madhu Sudan Compression in a Distributed Setting 10.4230/LIPIcs.ITCS.2017.19
• Jop Briët, Zeev Dvir, and Sivakanth Gopi Outlaw Distributions and Locally Decodable Codes 10.4230/LIPIcs.ITCS.2017.20
• Ran Gelles and Yael T. Kalai Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks 10.4230/LIPIcs.ITCS.2017.21
• Mohammad Bavarian, Thomas Vidick, and Henry Yuen Parallel Repetition via Fortification: Analytic View and the Quantum Case 10.4230/LIPIcs.ITCS.2017.22
• Scott Aaronson, Daniel Grier, and Luke Schaeffer The Classification of Reversible Bit Operations 10.4230/LIPIcs.ITCS.2017.23
• Harry Buhrman, Matthias Christandl, and Jeroen Zuiddam Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication 10.4230/LIPIcs.ITCS.2017.24
• Matthew B. Hastings Quantum Codes from High-Dimensional Manifolds 10.4230/LIPIcs.ITCS.2017.25
• Monika Henzinger, Andrea Lincoln, Stefan Neumann, and Virginia Vassilevska Williams Conditional Hardness for Sensitivity Problems 10.4230/LIPIcs.ITCS.2017.26
• Benjamin Rossman An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity 10.4230/LIPIcs.ITCS.2017.27
• Shalev Ben-David, Pooya Hatami, and Avishay Tal Low-Sensitivity Functions from Unambiguous Certificates 10.4230/LIPIcs.ITCS.2017.28
• Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, and Karl Wimmer Testing k-Monotonicity 10.4230/LIPIcs.ITCS.2017.29
• Rocco A. Servedio and Li-Yang Tan What Circuit Classes Can Be Learned with Non-Trivial Savings? 10.4230/LIPIcs.ITCS.2017.30
• Sam Buss, Valentine Kabanets, Antonina Kolokolova, and Michal Koucky Expander Construction in VNC1 10.4230/LIPIcs.ITCS.2017.31
• Steffen Schuldenzucker, Sven Seuken, and Stefano Battiston Finding Clearing Payments in Financial Networks with Credit Default Swaps is PPAD-complete 10.4230/LIPIcs.ITCS.2017.32
• Eric Blais and Abhinav Bommireddi Testing Submodularity and Other Properties of Valuation Functions 10.4230/LIPIcs.ITCS.2017.33
• Yakov Babichenko and Siddharth Barman Algorithmic Aspects of Private Bayesian Persuasion 10.4230/LIPIcs.ITCS.2017.34
• Jon Schneider, Ariel Schvartzman, and S. Matthew Weinberg Condorcet-Consistent and Approximately Strategyproof Tournament Rules 10.4230/LIPIcs.ITCS.2017.35
• Nima Anari, Shayan Oveis Gharan, Amin Saberi, and Mohit Singh Nash Social Welfare, Matrix Permanent, and Stable Polynomials 10.4230/LIPIcs.ITCS.2017.36
• Irit Dinur, Prahladh Harsha, Rakesh Venkat, and Henry Yuen Multiplayer Parallel Repetition for Expanding Games 10.4230/LIPIcs.ITCS.2017.37
• Joël Alwen, Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals Cumulative Space in Black-White Pebbling and Resolution 10.4230/LIPIcs.ITCS.2017.38
• Tom Gur and Ron D. Rothblum A Hierarchy Theorem for Interactive Proofs of Proximity 10.4230/LIPIcs.ITCS.2017.39
• Amey Bhangale, Irit Dinur, and Inbal Livni Navon Cube vs. Cube Low Degree Test 10.4230/LIPIcs.ITCS.2017.40
• Vitaly Feldman and Badih Ghazi On the Power of Learning from k-Wise Queries 10.4230/LIPIcs.ITCS.2017.41
• Aviad Rubinstein Detecting communities is Hard (And Counting Them is Even Harder) 10.4230/LIPIcs.ITCS.2017.42
• Jon Kleinberg, Sendhil Mullainathan, and Manish Raghavan Inherent Trade-Offs in the Fair Determination of Risk Scores 10.4230/LIPIcs.ITCS.2017.43
• Lennart Gulikers, Marc Lelarge, and Laurent Massoulié Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models 10.4230/LIPIcs.ITCS.2017.44
• Brendan Juba Conditional Sparse Linear Regression 10.4230/LIPIcs.ITCS.2017.45
• Itai Arad, Zeph Landau, Umesh V. Vazirani, and Thomas Vidick Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D 10.4230/LIPIcs.ITCS.2017.46
• Mathieu Laurière and Dave Touchette The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting 10.4230/LIPIcs.ITCS.2017.47
• Rui Chao, Ben W. Reichardt, Chris Sutherland, and Thomas Vidick Overlapping Qubits 10.4230/LIPIcs.ITCS.2017.48
• Iordanis Kerenidis and Anupam Prakash Quantum Recommendation Systems 10.4230/LIPIcs.ITCS.2017.49
• Yuval Peres, Mohit Singh, and Nisheeth K. Vishnoi Random Walks in Polytopes and Negative Dependence 10.4230/LIPIcs.ITCS.2017.50
• Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, and Clifford Stein Simultaneously Load Balancing for Every p-norm, With Reassignments 10.4230/LIPIcs.ITCS.2017.51
• Michael Dinitz and Zeyu Zhang Approximating Approximate Distance Oracles 10.4230/LIPIcs.ITCS.2017.52
• Christopher Kennedy and Rachel Ward Fast Cross-Polytope Locality-Sensitive Hashing 10.4230/LIPIcs.ITCS.2017.53
• Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, and Erisa Terolli The Distortion of Locality Sensitive Hashing 10.4230/LIPIcs.ITCS.2017.54
• Gábor Ivanyos, Youming Qiao, and K Venkata Subrahmanyam Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time 10.4230/LIPIcs.ITCS.2017.55
• Leonard Schulman and Umesh V. Vazirani The Duality Gap for Two-Team Zero-Sum Games 10.4230/LIPIcs.ITCS.2017.56
• Xi Chen, Yu Cheng, and Bo Tang Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games 10.4230/LIPIcs.ITCS.2017.57
• Daniel Stubbs and Virginia Vassilevska Williams Metatheorems for Dynamic Weighted Matching 10.4230/LIPIcs.ITCS.2017.58
• Ryan O'Donnell SOS Is Not Obviously Automatizable, Even Approximately 10.4230/LIPIcs.ITCS.2017.59
• Pavel Hubácek, Moni Naor, and Eylon Yogev The Journey from NP to TFNP Hardness 10.4230/LIPIcs.ITCS.2017.60