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