<h2>LIPIcs, Volume 151, ITCS 2020</h2>
<ul>
<li>
<span class="authors">Thomas Vidick</span>
<span class="title">LIPIcs, Volume 151, ITCS'20, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020">10.4230/LIPIcs.ITCS.2020</a>
</li>
<li>
<span class="authors">Thomas Vidick</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.0">10.4230/LIPIcs.ITCS.2020.0</a>
</li>
<li>
<span class="authors">Elazar Goldenberg and Karthik C. S.</span>
<span class="title">Hardness Amplification of Optimization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.1">10.4230/LIPIcs.ITCS.2020.1</a>
</li>
<li>
<span class="authors">Orr Paradise</span>
<span class="title">Smooth and Strong PCPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.2">10.4230/LIPIcs.ITCS.2020.2</a>
</li>
<li>
<span class="authors">Ariel Schvartzman, S. Matthew Weinberg, Eitan Zlatin, and Albert Zuo</span>
<span class="title">Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.3">10.4230/LIPIcs.ITCS.2020.3</a>
</li>
<li>
<span class="authors">Stacey Jeffery</span>
<span class="title">Span Programs and Quantum Space Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.4">10.4230/LIPIcs.ITCS.2020.4</a>
</li>
<li>
<span class="authors">Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, and Shubhangi Saraf</span>
<span class="title">DEEP-FRI: Sampling Outside the Box Improves Soundness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.5">10.4230/LIPIcs.ITCS.2020.5</a>
</li>
<li>
<span class="authors">Nir Bitansky and Idan Gerichter</span>
<span class="title">On the Cryptographic Hardness of Local Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.6">10.4230/LIPIcs.ITCS.2020.6</a>
</li>
<li>
<span class="authors">Klim Efremenko, Elad Haramaty, and Yael Tauman Kalai</span>
<span class="title">Interactive Coding with Constant Round and Communication Blowup</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.7">10.4230/LIPIcs.ITCS.2020.7</a>
</li>
<li>
<span class="authors">Xiaohui Bei, Shiteng Chen, Ji Guan, Youming Qiao, and Xiaoming Sun</span>
<span class="title">From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.8">10.4230/LIPIcs.ITCS.2020.8</a>
</li>
<li>
<span class="authors">Omri Ben-Eliezer, Eldar Fischer, Amit Levi, and Ron D. Rothblum</span>
<span class="title">Hard Properties with (Very) Short PCPPs and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.9">10.4230/LIPIcs.ITCS.2020.9</a>
</li>
<li>
<span class="authors">Austin Conner, Joseph M. Landsberg, Fulvio Gesmundo, and Emanuele Ventura</span>
<span class="title">Kronecker Powers of Tensors and Strassen’s Laser Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.10">10.4230/LIPIcs.ITCS.2020.10</a>
</li>
<li>
<span class="authors">Andrea Lincoln and Nikhil Vyas</span>
<span class="title">Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.11">10.4230/LIPIcs.ITCS.2020.11</a>
</li>
<li>
<span class="authors">Siqi Liu, Sidhanth Mohanty, and Elizabeth Yang</span>
<span class="title">High-Dimensional Expanders from Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.12">10.4230/LIPIcs.ITCS.2020.12</a>
</li>
<li>
<span class="authors">Jeremiah Blocki, Seunghoon Lee, and Samson Zhou</span>
<span class="title">Approximating Cumulative Pebbling Cost Is Unique Games Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.13">10.4230/LIPIcs.ITCS.2020.13</a>
</li>
<li>
<span class="authors">Michael Mitzenmacher</span>
<span class="title">Scheduling with Predictions and the Price of Misprediction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.14">10.4230/LIPIcs.ITCS.2020.14</a>
</li>
<li>
<span class="authors">Kira Goldner, Nicole Immorlica, and Brendan Lucier</span>
<span class="title">Reducing Inefficiency in Carbon Auctions with Imperfect Competition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.15">10.4230/LIPIcs.ITCS.2020.15</a>
</li>
<li>
<span class="authors">Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, and Gal Yona</span>
<span class="title">Preference-Informed Fairness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.16">10.4230/LIPIcs.ITCS.2020.16</a>
</li>
<li>
<span class="authors">Jin-Yi Cai and Artem Govorov</span>
<span class="title">On a Theorem of Lovász that hom(⋅, H) Determines the Isomorphism Type of H</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.17">10.4230/LIPIcs.ITCS.2020.17</a>
</li>
<li>
<span class="authors">Kousha Etessami, Christos Papadimitriou, Aviad Rubinstein, and Mihalis Yannakakis</span>
<span class="title">Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.18">10.4230/LIPIcs.ITCS.2020.18</a>
</li>
<li>
<span class="authors">Fedor Part and Iddo Tzameret</span>
<span class="title">Resolution with Counting: Dag-Like Lower Bounds and Different Moduli</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.19">10.4230/LIPIcs.ITCS.2020.19</a>
</li>
<li>
<span class="authors">Ran Raz and Wei Zhan</span>
<span class="title">The Random-Query Model and the Memory-Bounded Coupon Collector</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.20">10.4230/LIPIcs.ITCS.2020.20</a>
</li>
<li>
<span class="authors">Greg Bodwin and Ofer Grossman</span>
<span class="title">Strategy-Stealing Is Non-Constructive</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.21">10.4230/LIPIcs.ITCS.2020.21</a>
</li>
<li>
<span class="authors">Noah Fleming and Yuichi Yoshida</span>
<span class="title">Distribution-Free Testing of Linear Functions on ℝⁿ</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.22">10.4230/LIPIcs.ITCS.2020.22</a>
</li>
<li>
<span class="authors">Yael Hitron, Nancy Lynch, Cameron Musco, and Merav Parter</span>
<span class="title">Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.23">10.4230/LIPIcs.ITCS.2020.23</a>
</li>
<li>
<span class="authors">Georg Loho and László A. Végh</span>
<span class="title">Signed Tropical Convexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.24">10.4230/LIPIcs.ITCS.2020.24</a>
</li>
<li>
<span class="authors">András Gilyén and Tongyang Li</span>
<span class="title">Distributional Property Testing in a Quantum World</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.25">10.4230/LIPIcs.ITCS.2020.25</a>
</li>
<li>
<span class="authors">Alessandro Chiesa, Peter Manohar, and Igor Shinkar</span>
<span class="title">On Local Testability in the Non-Signaling Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.26">10.4230/LIPIcs.ITCS.2020.26</a>
</li>
<li>
<span class="authors">Amartya Shankha Biswas, Ronitt Rubinfeld, and Anak Yodpinyanee</span>
<span class="title">Local Access to Huge Random Objects Through Partial Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.27">10.4230/LIPIcs.ITCS.2020.27</a>
</li>
<li>
<span class="authors">Ronitt Rubinfeld and Arsen Vasilyan</span>
<span class="title">Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.28">10.4230/LIPIcs.ITCS.2020.28</a>
</li>
<li>
<span class="authors">Gal Sadeh, Edith Cohen, and Haim Kaplan</span>
<span class="title">Sample Complexity Bounds for Influence Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.29">10.4230/LIPIcs.ITCS.2020.29</a>
</li>
<li>
<span class="authors">Nir Bitansky and Nathan Geier</span>
<span class="title">On Oblivious Amplification of Coin-Tossing Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.30">10.4230/LIPIcs.ITCS.2020.30</a>
</li>
<li>
<span class="authors">Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, and Moshe Shenfeld</span>
<span class="title">A New Analysis of Differential Privacy’s Generalization Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.31">10.4230/LIPIcs.ITCS.2020.31</a>
</li>
<li>
<span class="authors">Domagoj Bradac, Anupam Gupta, Sahil Singla, and Goran Zuzic</span>
<span class="title">Robust Algorithms for the Secretary Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.32">10.4230/LIPIcs.ITCS.2020.32</a>
</li>
<li>
<span class="authors">Nathaniel Harms</span>
<span class="title">Universal Communication, Universal Graphs, and Graph Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.33">10.4230/LIPIcs.ITCS.2020.33</a>
</li>
<li>
<span class="authors">Rahul Ilango</span>
<span class="title">Approaching MCSP from Above and Below: Hardness for a Conditional Variant and AC^0[p]</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.34">10.4230/LIPIcs.ITCS.2020.34</a>
</li>
<li>
<span class="authors">Sivaramakrishnan Natarajan Ramamoorthy and Cyrus Rashtchian</span>
<span class="title">Equivalence of Systematic Linear Data Structures and Matrix Rigidity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.35">10.4230/LIPIcs.ITCS.2020.35</a>
</li>
<li>
<span class="authors">Mohammad Hassan Ameri, Jeremiah Blocki, and Samson Zhou</span>
<span class="title">Computationally Data-Independent Memory Hard Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.36">10.4230/LIPIcs.ITCS.2020.36</a>
</li>
<li>
<span class="authors">Andrej Bogdanov and Baoxiang Wang</span>
<span class="title">Learning and Testing Variable Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.37">10.4230/LIPIcs.ITCS.2020.37</a>
</li>
<li>
<span class="authors">Suman K. Bera, Noujan Pashanasangi, and C. Seshadhri</span>
<span class="title">Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.38">10.4230/LIPIcs.ITCS.2020.38</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Parameterization Above a Multiplicative Guarantee</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.39">10.4230/LIPIcs.ITCS.2020.39</a>
</li>
<li>
<span class="authors">Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, and Justin Thaler</span>
<span class="title">Ad Hoc Multi-Input Functional Encryption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.40">10.4230/LIPIcs.ITCS.2020.40</a>
</li>
<li>
<span class="authors">Shuichi Hirahara</span>
<span class="title">Unexpected Power of Random Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.41">10.4230/LIPIcs.ITCS.2020.41</a>
</li>
<li>
<span class="authors">Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, and Luca Trevisan</span>
<span class="title">Consensus vs Broadcast, with and Without Noise (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.42">10.4230/LIPIcs.ITCS.2020.42</a>
</li>
<li>
<span class="authors">Lior Gishboliner, Asaf Shapira, and Henrique Stagni</span>
<span class="title">Testing Linear Inequalities of Subgraph Statistics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.43">10.4230/LIPIcs.ITCS.2020.43</a>
</li>
<li>
<span class="authors">Guy Blanc, Jane Lange, and Li-Yang Tan</span>
<span class="title">Top-Down Induction of Decision Trees: Rigorous Guarantees and Inherent Limitations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.44">10.4230/LIPIcs.ITCS.2020.44</a>
</li>
<li>
<span class="authors">Haotian Jiang, Jian Li, Daogao Liu, and Sahil Singla</span>
<span class="title">Algorithms and Adaptivity Gaps for Stochastic k-TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.45">10.4230/LIPIcs.ITCS.2020.45</a>
</li>
<li>
<span class="authors">Nils Bertschinger, Martin Hoefer, and Daniel Schmand</span>
<span class="title">Strategic Payments in Financial Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.46">10.4230/LIPIcs.ITCS.2020.46</a>
</li>
<li>
<span class="authors">William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, and Meirav Zehavi</span>
<span class="title">Fault Tolerant Subgraphs with Applications in Kernelization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.47">10.4230/LIPIcs.ITCS.2020.47</a>
</li>
<li>
<span class="authors">Yael Hitron, Merav Parter, and Gur Perri</span>
<span class="title">The Computational Cost of Asynchronous Neural Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.48">10.4230/LIPIcs.ITCS.2020.48</a>
</li>
<li>
<span class="authors">Konstantin Makarychev and Yury Makarychev</span>
<span class="title">Certified Algorithms: Worst-Case Analysis and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.49">10.4230/LIPIcs.ITCS.2020.49</a>
</li>
<li>
<span class="authors">Ruben Becker, Yuval Emek, and Christoph Lenzen</span>
<span class="title">Low Diameter Graph Decompositions by Approximate Distance Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.50">10.4230/LIPIcs.ITCS.2020.50</a>
</li>
<li>
<span class="authors">Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi</span>
<span class="title">Generalized List Decoding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.51">10.4230/LIPIcs.ITCS.2020.51</a>
</li>
<li>
<span class="authors">Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc Renault</span>
<span class="title">Online Computation with Untrusted Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.52">10.4230/LIPIcs.ITCS.2020.52</a>
</li>
<li>
<span class="authors">Andrea Lincoln, Adam Polak, and Virginia Vassilevska Williams</span>
<span class="title">Monochromatic Triangles, Intermediate Matrix Products, and Convolutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.53">10.4230/LIPIcs.ITCS.2020.53</a>
</li>
<li>
<span class="authors">Nima Anari and Vijay V. Vazirani</span>
<span class="title">Matching Is as Easy as the Decision Problem, in the NC Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.54">10.4230/LIPIcs.ITCS.2020.54</a>
</li>
<li>
<span class="authors">Avrim Blum and Thodoris Lykouris</span>
<span class="title">Advancing Subgroup Fairness via Sleeping Experts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.55">10.4230/LIPIcs.ITCS.2020.55</a>
</li>
<li>
<span class="authors">Tomer Grossman, Ilan Komargodski, and Moni Naor</span>
<span class="title">Instance Complexity and Unlabeled Certificates in the Decision Tree Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.56">10.4230/LIPIcs.ITCS.2020.56</a>
</li>
<li>
<span class="authors">Alessandro Chiesa and Siqi Liu</span>
<span class="title">On the Impossibility of Probabilistic Proofs in Relativized Worlds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.57">10.4230/LIPIcs.ITCS.2020.57</a>
</li>
<li>
<span class="authors">Anna Gál and Robert Robere</span>
<span class="title">Lower Bounds for (Non-Monotone) Comparator Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.58">10.4230/LIPIcs.ITCS.2020.58</a>
</li>
<li>
<span class="authors">Nathan Lindzey and Ansis Rosmanis</span>
<span class="title">A Tight Lower Bound For Non-Coherent Index Erasure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.59">10.4230/LIPIcs.ITCS.2020.59</a>
</li>
<li>
<span class="authors">Aviad Rubinstein, Jack Z. Wang, and S. Matthew Weinberg</span>
<span class="title">Optimal Single-Choice Prophet Inequalities from Samples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.60">10.4230/LIPIcs.ITCS.2020.60</a>
</li>
<li>
<span class="authors">Linda Cai, Clay Thomas, and S. Matthew Weinberg</span>
<span class="title">Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.61">10.4230/LIPIcs.ITCS.2020.61</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Dylan H. Hendrickson, and Jayson Lynch</span>
<span class="title">Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.62">10.4230/LIPIcs.ITCS.2020.62</a>
</li>
<li>
<span class="authors">Adam Bouland, Bill Fefferman, and Umesh Vazirani</span>
<span class="title">Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.63">10.4230/LIPIcs.ITCS.2020.63</a>
</li>
<li>
<span class="authors">Andrei Graur, Tristan Pollner, Vidhya Ramaswamy, and S. Matthew Weinberg</span>
<span class="title">New Query Lower Bounds for Submodular Function Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.64">10.4230/LIPIcs.ITCS.2020.64</a>
</li>
<li>
<span class="authors">Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, and Ariel D. Procaccia</span>
<span class="title">Computation-Aware Data Aggregation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.65">10.4230/LIPIcs.ITCS.2020.65</a>
</li>
<li>
<span class="authors">Francisco Maturana and K. V. Rashmi</span>
<span class="title">Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.66">10.4230/LIPIcs.ITCS.2020.66</a>
</li>
<li>
<span class="authors">Federico Echenique and Siddharth Prasad</span>
<span class="title">Incentive Compatible Active Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.67">10.4230/LIPIcs.ITCS.2020.67</a>
</li>
<li>
<span class="authors">Rahul Santhanam</span>
<span class="title">Pseudorandomness and the Minimum Circuit Size Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.68">10.4230/LIPIcs.ITCS.2020.68</a>
</li>
<li>
<span class="authors">Maryam Aliakbarpour and Sandeep Silwal</span>
<span class="title">Testing Properties of Multiple Distributions with Few Samples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.69">10.4230/LIPIcs.ITCS.2020.69</a>
</li>
<li>
<span class="authors">Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, and Rahul Santhanam</span>
<span class="title">Beyond Natural Proofs: Hardness Magnification and Locality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.70">10.4230/LIPIcs.ITCS.2020.70</a>
</li>
<li>
<span class="authors">Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, and Akshayaram Srinivasan</span>
<span class="title">Separating Two-Round Secure Computation From Oblivious Transfer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.71">10.4230/LIPIcs.ITCS.2020.71</a>
</li>
<li>
<span class="authors">Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, and Joseph Swernofsky</span>
<span class="title">Trade-Offs Between Size and Degree in Polynomial Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.72">10.4230/LIPIcs.ITCS.2020.72</a>
</li>
<li>
<span class="authors">Shant Boodaghians, Rucha Kulkarni, and Ruta Mehta</span>
<span class="title">Smoothed Efficient Algorithms and Reductions for Network Coordination Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.73">10.4230/LIPIcs.ITCS.2020.73</a>
</li>
<li>
<span class="authors">Tali Kaufman and David Mass</span>
<span class="title">Local-To-Global Agreement Expansion via the Variance Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.74">10.4230/LIPIcs.ITCS.2020.74</a>
</li>
<li>
<span class="authors">T-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, and Elaine Shi</span>
<span class="title">MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.75">10.4230/LIPIcs.ITCS.2020.75</a>
</li>
<li>
<span class="authors">Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, and John Sylvester</span>
<span class="title">Choice and Bias in Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.76">10.4230/LIPIcs.ITCS.2020.76</a>
</li>
<li>
<span class="authors">Manuel Fernández V, David P. Woodruff, and Taisuke Yasuda</span>
<span class="title">Graph Spanners in the Message-Passing Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.77">10.4230/LIPIcs.ITCS.2020.77</a>
</li>
<li>
<span class="authors">Afonso S. Bandeira, Dmitriy Kunisky, and Alexander S. Wein</span>
<span class="title">Computational Hardness of Certifying Bounds on Constrained PCA Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.78">10.4230/LIPIcs.ITCS.2020.78</a>
</li>
<li>
<span class="authors">Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, and David P. Woodruff</span>
<span class="title">Pseudo-Deterministic Streaming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.79">10.4230/LIPIcs.ITCS.2020.79</a>
</li>
<li>
<span class="authors">Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin</span>
<span class="title">Limits to Non-Malleability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.80">10.4230/LIPIcs.ITCS.2020.80</a>
</li>
<li>
<span class="authors">Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan</span>
<span class="title">Cryptography from Information Loss</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.81">10.4230/LIPIcs.ITCS.2020.81</a>
</li>
<li>
<span class="authors">James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, and Mark Zhandry</span>
<span class="title">Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.82">10.4230/LIPIcs.ITCS.2020.82</a>
</li>
<li>
<span class="authors">Josh Alman and Virginia Vassilevska Williams</span>
<span class="title">OV Graphs Are (Probably) Hard Instances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.83">10.4230/LIPIcs.ITCS.2020.83</a>
</li>
<li>
<span class="authors">Parikshit Gopalan, Roie Levin, and Udi Wieder</span>
<span class="title">Finding Skewed Subcubes Under a Distribution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.84">10.4230/LIPIcs.ITCS.2020.84</a>
</li>
<li>
<span class="authors">Arnab Bhattacharyya, L. Sunil Chandran, and Suprovat Ghoshal</span>
<span class="title">Combinatorial Lower Bounds for 3-Query LDCs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.85">10.4230/LIPIcs.ITCS.2020.85</a>
</li>
<li>
<span class="authors">Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, and Tal Malkin</span>
<span class="title">On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2020.86">10.4230/LIPIcs.ITCS.2020.86</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