<h2>LIPIcs, Volume 94, ITCS 2018</h2>
<ul>
<li>
<span class="authors">Anna R. Karlin</span>
<span class="title">LIPIcs, Volume 94, ITCS'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018">10.4230/LIPIcs.ITCS.2018</a>
</li>
<li>
<span class="authors">Anna R. Karlin</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.0">10.4230/LIPIcs.ITCS.2018.0</a>
</li>
<li>
<span class="authors">Klim Efremenko, Ankit Garg, Rafael Oliveira, and Avi Wigderson</span>
<span class="title">Barriers for Rank Methods in Arithmetic Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.1">10.4230/LIPIcs.ITCS.2018.1</a>
</li>
<li>
<span class="authors">Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, and Michael Kowalczyk</span>
<span class="title">A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.2">10.4230/LIPIcs.ITCS.2018.2</a>
</li>
<li>
<span class="authors">Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos</span>
<span class="title">Quantum Query Algorithms are Completely Bounded Forms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.3">10.4230/LIPIcs.ITCS.2018.3</a>
</li>
<li>
<span class="authors">Bill Fefferman and Cedric Yen-Yu Lin</span>
<span class="title">A Complete Characterization of Unitary Quantum Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.4">10.4230/LIPIcs.ITCS.2018.4</a>
</li>
<li>
<span class="authors">Maria-Florina Balcan, Yingyu Liang, David P. Woodruff, and Hongyang Zhang</span>
<span class="title">Matrix Completion and Related Problems via Strong Duality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.5">10.4230/LIPIcs.ITCS.2018.5</a>
</li>
<li>
<span class="authors">Michael Ben-Or and Lior Eldar</span>
<span class="title">A Quasi-Random Approach to Matrix Spectral Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.6">10.4230/LIPIcs.ITCS.2018.6</a>
</li>
<li>
<span class="authors">Aditya Bhaskara and Silvio Lattanzi</span>
<span class="title">Non-Negative Sparse Regression and Column Subset Selection with L1 Error</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.7">10.4230/LIPIcs.ITCS.2018.7</a>
</li>
<li>
<span class="authors">Cameron Musco, Praneeth Netrapalli, Aaron Sidford, Shashanka Ubaru, and David P. Woodruff</span>
<span class="title">Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.8">10.4230/LIPIcs.ITCS.2018.8</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff, Joshua Blinkhorn, and Luke Hinde</span>
<span class="title">Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.9">10.4230/LIPIcs.ITCS.2018.9</a>
</li>
<li>
<span class="authors">Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, and Robert Robere</span>
<span class="title">Stabbing Planes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.10">10.4230/LIPIcs.ITCS.2018.10</a>
</li>
<li>
<span class="authors">Mark Braverman, Anat Ganor, Gillat Kol, and Ran Raz</span>
<span class="title">A Candidate for a Strong Separation of Information and Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.11">10.4230/LIPIcs.ITCS.2018.11</a>
</li>
<li>
<span class="authors">Mark Braverman and Young Kun Ko</span>
<span class="title">Information Value of Two-Prover Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.12">10.4230/LIPIcs.ITCS.2018.12</a>
</li>
<li>
<span class="authors">Yuqing Kong and Grant Schoenebeck</span>
<span class="title">Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.13">10.4230/LIPIcs.ITCS.2018.13</a>
</li>
<li>
<span class="authors">Yuqing Kong and Grant Schoenebeck</span>
<span class="title">Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.14">10.4230/LIPIcs.ITCS.2018.14</a>
</li>
<li>
<span class="authors">Rafael Frongillo and Bo Waggoner</span>
<span class="title">An Axiomatic Study of Scoring Rule Markets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.15">10.4230/LIPIcs.ITCS.2018.15</a>
</li>
<li>
<span class="authors">Avrim Blum and Yishay Mansour</span>
<span class="title">On Price versus Quality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.16">10.4230/LIPIcs.ITCS.2018.16</a>
</li>
<li>
<span class="authors">Shafi Goldwasser, Ofer Grossman, and Dhiraj Holden</span>
<span class="title">Pseudo-Deterministic Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.17">10.4230/LIPIcs.ITCS.2018.17</a>
</li>
<li>
<span class="authors">Oded Goldreich and Guy N. Rothblum</span>
<span class="title">Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.18">10.4230/LIPIcs.ITCS.2018.18</a>
</li>
<li>
<span class="authors">Itay Berman, Ron D. Rothblum, and Vinod Vaikuntanathan</span>
<span class="title">Zero-Knowledge Proofs of Proximity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.19">10.4230/LIPIcs.ITCS.2018.19</a>
</li>
<li>
<span class="authors">Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, and Andrew Morgan</span>
<span class="title">Minimum Circuit Size, Graph Isomorphism, and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.20">10.4230/LIPIcs.ITCS.2018.20</a>
</li>
<li>
<span class="authors">Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, and Stefano Tessaro</span>
<span class="title">Foundations of Homomorphic Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.21">10.4230/LIPIcs.ITCS.2018.21</a>
</li>
<li>
<span class="authors">Rina Panigrahy, Ali Rahimi, Sushant Sachdeva, and Qiuyi Zhang</span>
<span class="title">Convergence Results for Neural Networks via Electrodynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.22">10.4230/LIPIcs.ITCS.2018.22</a>
</li>
<li>
<span class="authors">Jelena Diakonikolas and Lorenzo Orecchia</span>
<span class="title">Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.23">10.4230/LIPIcs.ITCS.2018.23</a>
</li>
<li>
<span class="authors">Peter Bürgisser, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson</span>
<span class="title">Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.24">10.4230/LIPIcs.ITCS.2018.24</a>
</li>
<li>
<span class="authors">Josh Alman and Virginia Vassilevska Williams</span>
<span class="title">Further Limitations of the Known Approaches for Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.25">10.4230/LIPIcs.ITCS.2018.25</a>
</li>
<li>
<span class="authors">Srikanth Srinivasan and Madhu Sudan</span>
<span class="title">Local Decoding and Testing of Polynomials over Grids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.26">10.4230/LIPIcs.ITCS.2018.26</a>
</li>
<li>
<span class="authors">Tom Gur, Govind Ramnarayan, and Ron D. Rothblum</span>
<span class="title">Relaxed Locally Correctable Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.27">10.4230/LIPIcs.ITCS.2018.27</a>
</li>
<li>
<span class="authors">Dana Moshkovitz and Michal Moshkovitz</span>
<span class="title">Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.28">10.4230/LIPIcs.ITCS.2018.28</a>
</li>
<li>
<span class="authors">Pooya Hatami and Avishay Tal</span>
<span class="title">Pseudorandom Generators for Low Sensitivity Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.29">10.4230/LIPIcs.ITCS.2018.29</a>
</li>
<li>
<span class="authors">Christoph Dürr, Thomas Erlebach, Nicole Megow, and Julie Meißner</span>
<span class="title">Scheduling with Explorable Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.30">10.4230/LIPIcs.ITCS.2018.30</a>
</li>
<li>
<span class="authors">Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, and José Verschae</span>
<span class="title">A Local-Search Algorithm for Steiner Forest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.31">10.4230/LIPIcs.ITCS.2018.31</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.32">10.4230/LIPIcs.ITCS.2018.32</a>
</li>
<li>
<span class="authors">Jon Kleinberg and Manish Raghavan</span>
<span class="title">Selection Problems in the Presence of Implicit Bias</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.33">10.4230/LIPIcs.ITCS.2018.33</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, and Virginia Vassilevska Williams</span>
<span class="title">Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.34">10.4230/LIPIcs.ITCS.2018.34</a>
</li>
<li>
<span class="authors">Amir Abboud and Aviad Rubinstein</span>
<span class="title">Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.35">10.4230/LIPIcs.ITCS.2018.35</a>
</li>
<li>
<span class="authors">Irit Dinur and Pasin Manurangsi</span>
<span class="title">ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.36">10.4230/LIPIcs.ITCS.2018.36</a>
</li>
<li>
<span class="authors">Paul W. Goldberg and Christos H. Papadimitriou</span>
<span class="title">Towards a Unified Complexity Theory of Total Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.37">10.4230/LIPIcs.ITCS.2018.37</a>
</li>
<li>
<span class="authors">Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, and Makrand Sinha</span>
<span class="title">Edge Estimation with Independent Set Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.38">10.4230/LIPIcs.ITCS.2018.38</a>
</li>
<li>
<span class="authors">Aviad Rubinstein, Tselil Schramm, and S. Matthew Weinberg</span>
<span class="title">Computing Exact Minimum Cuts Without Knowing the Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.39">10.4230/LIPIcs.ITCS.2018.39</a>
</li>
<li>
<span class="authors">Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, and Amit Kumar</span>
<span class="title">Approximate Clustering with Same-Cluster Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.40">10.4230/LIPIcs.ITCS.2018.40</a>
</li>
<li>
<span class="authors">Vedat Levi Alev, Nima Anari, Lap Chi Lau, and Shayan Oveis Gharan</span>
<span class="title">Graph Clustering using Effective Resistance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.41">10.4230/LIPIcs.ITCS.2018.41</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota, and Elena Grigorescu</span>
<span class="title">Lattice-based Locality Sensitive Hashing is Optimal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.42">10.4230/LIPIcs.ITCS.2018.42</a>
</li>
<li>
<span class="authors">Victor Balcer and Salil Vadhan</span>
<span class="title">Differential Privacy on Finite Computers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.43">10.4230/LIPIcs.ITCS.2018.43</a>
</li>
<li>
<span class="authors">Vishesh Karwa and Salil Vadhan</span>
<span class="title">Finite Sample Differentially Private Confidence Intervals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.44">10.4230/LIPIcs.ITCS.2018.44</a>
</li>
<li>
<span class="authors">Jacob Steinhardt, Moses Charikar, and Gregory Valiant</span>
<span class="title">Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.45">10.4230/LIPIcs.ITCS.2018.45</a>
</li>
<li>
<span class="authors">Qingqing Huang, Sham M. Kakade, Weihao Kong, and Gregory Valiant</span>
<span class="title">Recovering Structured Probability Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.46">10.4230/LIPIcs.ITCS.2018.46</a>
</li>
<li>
<span class="authors">Mingda Qiao and Gregory Valiant</span>
<span class="title">Learning Discrete Distributions from Untrusted Batches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.47">10.4230/LIPIcs.ITCS.2018.47</a>
</li>
<li>
<span class="authors">Yishay Mansour, Aleksandrs Slivkins, and Zhiwei Steven Wu</span>
<span class="title">Competing Bandits: Learning Under Competition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.48">10.4230/LIPIcs.ITCS.2018.48</a>
</li>
<li>
<span class="authors">Lucas Boczkowski, Ofer Feinerman, Amos Korman, and Emanuele Natale</span>
<span class="title">Limits for Rumor Spreading in Stochastic Populations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.49">10.4230/LIPIcs.ITCS.2018.49</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Ran Gelles, and Bernhard Haeupler</span>
<span class="title">Making Asynchronous Distributed Computations Robust to Channel Noise</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.50">10.4230/LIPIcs.ITCS.2018.50</a>
</li>
<li>
<span class="authors">Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, and Frieder Smolny</span>
<span class="title">Distance-Preserving Graph Contractions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.51">10.4230/LIPIcs.ITCS.2018.51</a>
</li>
<li>
<span class="authors">Shay Solomon</span>
<span class="title">Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.52">10.4230/LIPIcs.ITCS.2018.52</a>
</li>
<li>
<span class="authors">Alessandro Chiesa and Tom Gur</span>
<span class="title">Proofs of Proximity for Distribution Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.53">10.4230/LIPIcs.ITCS.2018.53</a>
</li>
<li>
<span class="authors">Lior Gishboliner and Asaf Shapira</span>
<span class="title">Efficient Testing without Efficient Regularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.54">10.4230/LIPIcs.ITCS.2018.54</a>
</li>
<li>
<span class="authors">Pravesh K. Kothari and Roi Livni</span>
<span class="title">Improper Learning by Refuting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.55">10.4230/LIPIcs.ITCS.2018.55</a>
</li>
<li>
<span class="authors">Greg Yang</span>
<span class="title">A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.56">10.4230/LIPIcs.ITCS.2018.56</a>
</li>
<li>
<span class="authors">Robert Legenstein, Wolfgang Maass, Christos H. Papadimitriou, and Santosh S. Vempala</span>
<span class="title">Long Term Memory and the Densest K-Subgraph Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.57">10.4230/LIPIcs.ITCS.2018.57</a>
</li>
<li>
<span class="authors">Bernard Chazelle</span>
<span class="title">Toward a Theory of Markov Influence Systems and their Renormalization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.58">10.4230/LIPIcs.ITCS.2018.58</a>
</li>
<li>
<span class="authors">Georgios Piliouras and Leonard J. Schulman</span>
<span class="title">Learning Dynamics and the Co-Evolution of Competing Sexual Species</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2018.59">10.4230/LIPIcs.ITCS.2018.59</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