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