<h2>LIPIcs, Volume 185, ITCS 2021</h2>
<ul>
<li>
<span class="authors">James R. Lee</span>
<span class="title">LIPIcs, Volume 185, ITCS 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021">10.4230/LIPIcs.ITCS.2021</a>
</li>
<li>
<span class="authors">James R. Lee</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.0">10.4230/LIPIcs.ITCS.2021.0</a>
</li>
<li>
<span class="authors">Yuval Dagan, Yuval Filmus, Daniel Kane, and Shay Moran</span>
<span class="title">The Entropy of Lies: Playing Twenty Questions with a Liar</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.1">10.4230/LIPIcs.ITCS.2021.1</a>
</li>
<li>
<span class="authors">Russell Impagliazzo and Sam McGuire</span>
<span class="title">Comparing Computational Entropies Below Majority (Or: When Is the Dense Model Theorem False?)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.2">10.4230/LIPIcs.ITCS.2021.2</a>
</li>
<li>
<span class="authors">Martin Hoefer, Pasin Manurangsi, and Alexandros Psomas</span>
<span class="title">Algorithmic Persuasion with Evidence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.3">10.4230/LIPIcs.ITCS.2021.3</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">The Complexity of Finding Fair Independent Sets in Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.4">10.4230/LIPIcs.ITCS.2021.4</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, and Mary Wootters</span>
<span class="title">Sharp Threshold Rates for Random Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.5">10.4230/LIPIcs.ITCS.2021.5</a>
</li>
<li>
<span class="authors">Cameron Musco, Christopher Musco, and David P. Woodruff</span>
<span class="title">Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.6">10.4230/LIPIcs.ITCS.2021.6</a>
</li>
<li>
<span class="authors">William M. Hoza, Edward Pyne, and Salil Vadhan</span>
<span class="title">Pseudorandom Generators for Unbounded-Width Permutation Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.7">10.4230/LIPIcs.ITCS.2021.7</a>
</li>
<li>
<span class="authors">Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, and Juba Ziani</span>
<span class="title">Pipeline Interventions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.8">10.4230/LIPIcs.ITCS.2021.8</a>
</li>
<li>
<span class="authors">Mrinal Kumar and Ben Lee Volk</span>
<span class="title">A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.9">10.4230/LIPIcs.ITCS.2021.9</a>
</li>
<li>
<span class="authors">Pasin Manurangsi, Aviad Rubinstein, and Tselil Schramm</span>
<span class="title">The Strongish Planted Clique Hypothesis and Its Consequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.10">10.4230/LIPIcs.ITCS.2021.10</a>
</li>
<li>
<span class="authors">Nengkun Yu</span>
<span class="title">Sample Efficient Identity Testing and Independence Testing of Quantum States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.11">10.4230/LIPIcs.ITCS.2021.11</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff and Benjamin Böhm</span>
<span class="title">Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.12">10.4230/LIPIcs.ITCS.2021.12</a>
</li>
<li>
<span class="authors">William Kretschmer</span>
<span class="title">The Quantum Supremacy Tsirelson Inequality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.13">10.4230/LIPIcs.ITCS.2021.13</a>
</li>
<li>
<span class="authors">Kimberly Ding and S. Matthew Weinberg</span>
<span class="title">Approximately Strategyproof Tournament Rules in the Probabilistic Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.14">10.4230/LIPIcs.ITCS.2021.14</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, and Anannya Upasana</span>
<span class="title">Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.15">10.4230/LIPIcs.ITCS.2021.15</a>
</li>
<li>
<span class="authors">William Kuszmaul and Alek Westover</span>
<span class="title">The Variable-Processor Cup Game</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.16">10.4230/LIPIcs.ITCS.2021.16</a>
</li>
<li>
<span class="authors">Uri Meir</span>
<span class="title">Comparison Graphs: A Unified Method for Uniformity Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.17">10.4230/LIPIcs.ITCS.2021.17</a>
</li>
<li>
<span class="authors">Shyam Narayanan and Michael Ren</span>
<span class="title">Circular Trace Reconstruction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.18">10.4230/LIPIcs.ITCS.2021.18</a>
</li>
<li>
<span class="authors">Tony Metger and Thomas Vidick</span>
<span class="title">Self-Testing of a Single Quantum Device Under Computational Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.19">10.4230/LIPIcs.ITCS.2021.19</a>
</li>
<li>
<span class="authors">Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, and Sandip Sinha</span>
<span class="title">Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.20">10.4230/LIPIcs.ITCS.2021.20</a>
</li>
<li>
<span class="authors">Sébastien Bubeck, Niv Buchbinder, Christian Coester, and Mark Sellke</span>
<span class="title">Metrical Service Systems with Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.21">10.4230/LIPIcs.ITCS.2021.21</a>
</li>
<li>
<span class="authors">Surbhi Goel, Adam Klivans, Pasin Manurangsi, and Daniel Reichman</span>
<span class="title">Tight Hardness Results for Training Depth-2 ReLU Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.22">10.4230/LIPIcs.ITCS.2021.22</a>
</li>
<li>
<span class="authors">Pranjal Dutta, Nitin Saxena, and Thomas Thierauf</span>
<span class="title">A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.23">10.4230/LIPIcs.ITCS.2021.23</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Alexander S. Kulikov, and R. Ryan Williams</span>
<span class="title">Circuit Depth Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.24">10.4230/LIPIcs.ITCS.2021.24</a>
</li>
<li>
<span class="authors">Weiming Feng, Kun He, Xiaoming Sun, and Yitong Yin</span>
<span class="title">Dynamic Inference in Probabilistic Graphical Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.25">10.4230/LIPIcs.ITCS.2021.25</a>
</li>
<li>
<span class="authors">Esty Kelman, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra</span>
<span class="title">Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.26">10.4230/LIPIcs.ITCS.2021.26</a>
</li>
<li>
<span class="authors">Mark Braverman, Subhash Khot, and Dor Minzer</span>
<span class="title">On Rich 2-to-1 Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.27">10.4230/LIPIcs.ITCS.2021.27</a>
</li>
<li>
<span class="authors">Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, and Ami Paz</span>
<span class="title">Distributed Quantum Proofs for Replicated Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.28">10.4230/LIPIcs.ITCS.2021.28</a>
</li>
<li>
<span class="authors">Mikito Nanashima</span>
<span class="title">On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.29">10.4230/LIPIcs.ITCS.2021.29</a>
</li>
<li>
<span class="authors">Boaz Barak, Chi-Ning Chou, and Xun Gao</span>
<span class="title">Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.30">10.4230/LIPIcs.ITCS.2021.30</a>
</li>
<li>
<span class="authors">Joshua A. Grochow and Youming Qiao</span>
<span class="title">On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.31">10.4230/LIPIcs.ITCS.2021.31</a>
</li>
<li>
<span class="authors">Gregory Rosenthal</span>
<span class="title">Bounds on the QAC^0 Complexity of Approximating Parity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.32">10.4230/LIPIcs.ITCS.2021.32</a>
</li>
<li>
<span class="authors">Noga Ron-Zewi, Ronen Shaltiel, and Nithin Varma</span>
<span class="title">Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.33">10.4230/LIPIcs.ITCS.2021.33</a>
</li>
<li>
<span class="authors">Jay Mardia</span>
<span class="title">Is the Space Complexity of Planted Clique Recovery the Same as That of Detection?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.34">10.4230/LIPIcs.ITCS.2021.34</a>
</li>
<li>
<span class="authors">Joshua Lau and Angus Ritossa</span>
<span class="title">Algorithms and Hardness for Multidimensional Range Updates and Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.35">10.4230/LIPIcs.ITCS.2021.35</a>
</li>
<li>
<span class="authors">Dorit Aharonov and Alex B. Grilo</span>
<span class="title">Two Combinatorial MA-Complete Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.36">10.4230/LIPIcs.ITCS.2021.36</a>
</li>
<li>
<span class="authors">Curtis Bechtel and Shaddin Dughmi</span>
<span class="title">Delegated Stochastic Probing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.37">10.4230/LIPIcs.ITCS.2021.37</a>
</li>
<li>
<span class="authors">Irit Dinur, Yuval Filmus, Prahladh Harsha, and Madhur Tulsiani</span>
<span class="title">Explicit SoS Lower Bounds from High-Dimensional Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.38">10.4230/LIPIcs.ITCS.2021.38</a>
</li>
<li>
<span class="authors">Zachary Remscrim</span>
<span class="title">Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.39">10.4230/LIPIcs.ITCS.2021.39</a>
</li>
<li>
<span class="authors">Jiabao Lin</span>
<span class="title">On the Complexity of #CSP^d</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.40">10.4230/LIPIcs.ITCS.2021.40</a>
</li>
<li>
<span class="authors">Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, and Amir Yehudayoff</span>
<span class="title">Interactive Proofs for Verifying Machine Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.41">10.4230/LIPIcs.ITCS.2021.41</a>
</li>
<li>
<span class="authors">Omri Ben-Eliezer, Eldar Fischer, Amit Levi, and Yuichi Yoshida</span>
<span class="title">Ordered Graph Limits and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.42">10.4230/LIPIcs.ITCS.2021.42</a>
</li>
<li>
<span class="authors">Ofer Grossman and Justin Holmgren</span>
<span class="title">Error Correcting Codes for Uncompressed Messages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.43">10.4230/LIPIcs.ITCS.2021.43</a>
</li>
<li>
<span class="authors">Robert Kleinberg, Oliver Korten, Daniel Mitropolsky, and Christos Papadimitriou</span>
<span class="title">Total Functions in the Polynomial Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.44">10.4230/LIPIcs.ITCS.2021.44</a>
</li>
<li>
<span class="authors">Noah Burrell and Grant Schoenebeck</span>
<span class="title">Relaxing Common Belief for Social Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.45">10.4230/LIPIcs.ITCS.2021.45</a>
</li>
<li>
<span class="authors">Itai Ashlagi, Mark Braverman, Amin Saberi, Clayton Thomas, and Geng Zhao</span>
<span class="title">Tiered Random Matching Markets: Rank Is Proportional to Popularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.46">10.4230/LIPIcs.ITCS.2021.46</a>
</li>
<li>
<span class="authors">Geoffroy Couteau, Pooya Farshim, and Mohammad Mahmoody</span>
<span class="title">Black-Box Uselessness: Composing Separations in Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.47">10.4230/LIPIcs.ITCS.2021.47</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Vinayak M. Kumar</span>
<span class="title">Pseudobinomiality of the Sticky Random Walk</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.48">10.4230/LIPIcs.ITCS.2021.48</a>
</li>
<li>
<span class="authors">Lior Eldar</span>
<span class="title">Robust Quantum Entanglement at (Nearly) Room Temperature</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.49">10.4230/LIPIcs.ITCS.2021.49</a>
</li>
<li>
<span class="authors">Abhijit S. Mudigonda and R. Ryan Williams</span>
<span class="title">Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.50">10.4230/LIPIcs.ITCS.2021.50</a>
</li>
<li>
<span class="authors">Spyros Angelopoulos</span>
<span class="title">Online Search with a Hint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.51">10.4230/LIPIcs.ITCS.2021.51</a>
</li>
<li>
<span class="authors">Pál András Papp and Roger Wattenhofer</span>
<span class="title">Sequential Defaulting in Financial Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.52">10.4230/LIPIcs.ITCS.2021.52</a>
</li>
<li>
<span class="authors">Ankit Garg, Robin Kothari, Praneeth Netrapalli, and Suhail Sherif</span>
<span class="title">No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.53">10.4230/LIPIcs.ITCS.2021.53</a>
</li>
<li>
<span class="authors">Uma Girish, Ran Raz, and Avishay Tal</span>
<span class="title">Quantum Versus Randomized Communication Complexity, with Efficient Players</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.54">10.4230/LIPIcs.ITCS.2021.54</a>
</li>
<li>
<span class="authors">Kush Bhatia, Peter L. Bartlett, Anca D. Dragan, and Jacob Steinhardt</span>
<span class="title">Agnostic Learning with Unknown Utilities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.55">10.4230/LIPIcs.ITCS.2021.55</a>
</li>
<li>
<span class="authors">Lijie Chen, Badih Ghazi, Ravi Kumar, and Pasin Manurangsi</span>
<span class="title">On Distributed Differential Privacy and Counting Distinct Elements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.56">10.4230/LIPIcs.ITCS.2021.56</a>
</li>
<li>
<span class="authors">Noam Solomon and Shay Solomon</span>
<span class="title">A Generalized Matching Reconfiguration Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.57">10.4230/LIPIcs.ITCS.2021.57</a>
</li>
<li>
<span class="authors">Yuichi Yoshida and Samson Zhou</span>
<span class="title">Sensitivity Analysis of the Maximum Matching Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.58">10.4230/LIPIcs.ITCS.2021.58</a>
</li>
<li>
<span class="authors">Vijay V. Vazirani and Mihalis Yannakakis</span>
<span class="title">Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.59">10.4230/LIPIcs.ITCS.2021.59</a>
</li>
<li>
<span class="authors">Rajko Nenadov, Angelika Steger, and Pascal Su</span>
<span class="title">An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.60">10.4230/LIPIcs.ITCS.2021.60</a>
</li>
<li>
<span class="authors">Srinivasan Arunachalam and Supartha Podder</span>
<span class="title">Communication Memento: Memoryless Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.61">10.4230/LIPIcs.ITCS.2021.61</a>
</li>
<li>
<span class="authors">Michael B. Cohen, Aaron Sidford, and Kevin Tian</span>
<span class="title">Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.62">10.4230/LIPIcs.ITCS.2021.62</a>
</li>
<li>
<span class="authors">Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein</span>
<span class="title">Training (Overparametrized) Neural Networks in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.63">10.4230/LIPIcs.ITCS.2021.63</a>
</li>
<li>
<span class="authors">Jeremiah Blocki and Mike Cinkoske</span>
<span class="title">A New Connection Between Node and Edge Depth Robust Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.64">10.4230/LIPIcs.ITCS.2021.64</a>
</li>
<li>
<span class="authors">Anthony Leverrier, Vivien Londe, and Gilles Zémor</span>
<span class="title">Towards Local Testability for Quantum Coding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.65">10.4230/LIPIcs.ITCS.2021.65</a>
</li>
<li>
<span class="authors">Peter Dixon, A. Pavan, and N. V. Vinodchandran</span>
<span class="title">Complete Problems for Multi-Pseudodeterministic Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.66">10.4230/LIPIcs.ITCS.2021.66</a>
</li>
<li>
<span class="authors">Yuval Emek, Shay Kutten, and Yangguang Shi</span>
<span class="title">Online Paging with a Vanishing Regret</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.67">10.4230/LIPIcs.ITCS.2021.67</a>
</li>
<li>
<span class="authors">Ilan Komargodski and Elaine Shi</span>
<span class="title">Differentially Oblivious Turing Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.68">10.4230/LIPIcs.ITCS.2021.68</a>
</li>
<li>
<span class="authors">Anindya De, Shivam Nadimpalli, and Rocco A. Servedio</span>
<span class="title">Quantitative Correlation Inequalities via Semigroup Interpolation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.69">10.4230/LIPIcs.ITCS.2021.69</a>
</li>
<li>
<span class="authors">Benjamin Rossman</span>
<span class="title">Shrinkage of Decision Lists and DNF Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.70">10.4230/LIPIcs.ITCS.2021.70</a>
</li>
<li>
<span class="authors">Kunal Mittal and Ran Raz</span>
<span class="title">Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.71">10.4230/LIPIcs.ITCS.2021.71</a>
</li>
<li>
<span class="authors">Stefan Dziembowski, Grzegorz Fabiański, Sebastian Faust, and Siavash Riahi</span>
<span class="title">Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.72">10.4230/LIPIcs.ITCS.2021.72</a>
</li>
<li>
<span class="authors">Sander Borst, Daniel Dadush, Neil Olver, and Makrand Sinha</span>
<span class="title">Majorizing Measures for the Optimizer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.73">10.4230/LIPIcs.ITCS.2021.73</a>
</li>
<li>
<span class="authors">Hedyeh Beyhaghi and Éva Tardos</span>
<span class="title">Randomness and Fairness in Two-Sided Matching with Limited Interviews</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.74">10.4230/LIPIcs.ITCS.2021.74</a>
</li>
<li>
<span class="authors">Justin Holmgren and Alexander S. Wein</span>
<span class="title">Counterexamples to the Low-Degree Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.75">10.4230/LIPIcs.ITCS.2021.75</a>
</li>
<li>
<span class="authors">Jop Briët and Farrokh Labib</span>
<span class="title">High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.76">10.4230/LIPIcs.ITCS.2021.76</a>
</li>
<li>
<span class="authors">Nicole Immorlica, Ian A. Kash, and Brendan Lucier</span>
<span class="title">Buying Data over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.77">10.4230/LIPIcs.ITCS.2021.77</a>
</li>
<li>
<span class="authors">Grant Schoenebeck and Fang-Yi Yu</span>
<span class="title">Learning and Strongly Truthful Multi-Task Peer Prediction: A Variational Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.78">10.4230/LIPIcs.ITCS.2021.78</a>
</li>
<li>
<span class="authors">Sara Ahmadian, Allen Liu, Binghui Peng, and Morteza Zadimoghaddam</span>
<span class="title">Distributed Load Balancing: A New Framework and Improved Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.79">10.4230/LIPIcs.ITCS.2021.79</a>
</li>
<li>
<span class="authors">Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Nithin Varma</span>
<span class="title">Erasure-Resilient Sublinear-Time Graph Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.80">10.4230/LIPIcs.ITCS.2021.80</a>
</li>
<li>
<span class="authors">Yang Cai and Grigoris Velegkas</span>
<span class="title">How to Sell Information Optimally: An Algorithmic Study</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.81">10.4230/LIPIcs.ITCS.2021.81</a>
</li>
<li>
<span class="authors">Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena</span>
<span class="title">Computation over the Noisy Broadcast Channel with Malicious Parties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.82">10.4230/LIPIcs.ITCS.2021.82</a>
</li>
<li>
<span class="authors">Nima Anari, Nathan Hu, Amin Saberi, and Aaron Schild</span>
<span class="title">Sampling Arborescences in Parallel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.83">10.4230/LIPIcs.ITCS.2021.83</a>
</li>
<li>
<span class="authors">Moshe Babaioff, Richard Cole, Jason Hartline, Nicole Immorlica, and Brendan Lucier</span>
<span class="title">Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.84">10.4230/LIPIcs.ITCS.2021.84</a>
</li>
<li>
<span class="authors">Moses Charikar, Shivam Garg, Deborah M. Gordon, and Kirankumar Shiragur</span>
<span class="title">A Model for Ant Trail Formation and its Convergence Properties (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.85">10.4230/LIPIcs.ITCS.2021.85</a>
</li>
<li>
<span class="authors">José Correa, Paul Dütting, Felix Fischer, Kevin Schewior, and Bruno Ziliotto</span>
<span class="title">Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.86">10.4230/LIPIcs.ITCS.2021.86</a>
</li>
<li>
<span class="authors">Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, and Marc Vinyals</span>
<span class="title">Complexity Measures on the Symmetric Group and Beyond (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.87">10.4230/LIPIcs.ITCS.2021.87</a>
</li>
<li>
<span class="authors">Yiding Feng and Rad Niazadeh</span>
<span class="title">Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.88">10.4230/LIPIcs.ITCS.2021.88</a>
</li>
<li>
<span class="authors">Yuval Filmus, Or Meir, and Avishay Tal</span>
<span class="title">Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2021.89">10.4230/LIPIcs.ITCS.2021.89</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