<h2>LIPIcs, Volume 215, ITCS 2022</h2>
<ul>
<li>
<span class="authors">Mark Braverman</span>
<span class="title">LIPIcs, Volume 215, ITCS 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022">10.4230/LIPIcs.ITCS.2022</a>
</li>
<li>
<span class="authors">Mark Braverman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.0">10.4230/LIPIcs.ITCS.2022.0</a>
</li>
<li>
<span class="authors">Gagan Aggarwal, Kshipra Bhawalkar, Guru Guruganesh, and Andres Perlroth</span>
<span class="title">Maximizing Revenue in the Presence of Intermediaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.1">10.4230/LIPIcs.ITCS.2022.1</a>
</li>
<li>
<span class="authors">Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, and Maciej Obremski</span>
<span class="title">Algebraic Restriction Codes and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.2">10.4230/LIPIcs.ITCS.2022.2</a>
</li>
<li>
<span class="authors">Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, and Ryan Williams</span>
<span class="title">Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.3">10.4230/LIPIcs.ITCS.2022.3</a>
</li>
<li>
<span class="authors">Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, and Giulio Malavolta</span>
<span class="title">Pre-Constrained Encryption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.4">10.4230/LIPIcs.ITCS.2022.4</a>
</li>
<li>
<span class="authors">Nima Anari, Michał Dereziński, Thuy-Duong Vuong, and Elizabeth Yang</span>
<span class="title">Domain Sparsification of Discrete Distributions Using Entropic Independence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.5">10.4230/LIPIcs.ITCS.2022.5</a>
</li>
<li>
<span class="authors">Anurag Anshu and Chinmay Nirkhe</span>
<span class="title">Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.6">10.4230/LIPIcs.ITCS.2022.6</a>
</li>
<li>
<span class="authors">Shiri Antaki, Quanquan C. Liu, and Shay Solomon</span>
<span class="title">Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.7">10.4230/LIPIcs.ITCS.2022.7</a>
</li>
<li>
<span class="authors">Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, and Toniann Pitassi</span>
<span class="title">Secret Sharing, Slice Formulas, and Monotone Real Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.8">10.4230/LIPIcs.ITCS.2022.8</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Vihan Shah</span>
<span class="title">An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.9">10.4230/LIPIcs.ITCS.2022.9</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Chen Wang</span>
<span class="title">Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.10">10.4230/LIPIcs.ITCS.2022.10</a>
</li>
<li>
<span class="authors">Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, and Konstantin Zabarnyi</span>
<span class="title">Multi-Channel Bayesian Persuasion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.11">10.4230/LIPIcs.ITCS.2022.11</a>
</li>
<li>
<span class="authors">Marshall Ball, Oded Goldreich, and Tal Malkin</span>
<span class="title">Randomness Extraction from Somewhat Dependent Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.12">10.4230/LIPIcs.ITCS.2022.12</a>
</li>
<li>
<span class="authors">Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha</span>
<span class="title">Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.13">10.4230/LIPIcs.ITCS.2022.13</a>
</li>
<li>
<span class="authors">Boaz Barak and Kunal Marwaha</span>
<span class="title">Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.14">10.4230/LIPIcs.ITCS.2022.14</a>
</li>
<li>
<span class="authors">James Bartusek and Giulio Malavolta</span>
<span class="title">Indistinguishability Obfuscation of Null Quantum Circuits and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.15">10.4230/LIPIcs.ITCS.2022.15</a>
</li>
<li>
<span class="authors">Anubhav Baweja, Justin Jia, and David P. Woodruff</span>
<span class="title">An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.16">10.4230/LIPIcs.ITCS.2022.16</a>
</li>
<li>
<span class="authors">Balaram Behera, Edin Husić, Shweta Jain, Tim Roughgarden, and C. Seshadhri</span>
<span class="title">FPT Algorithms for Finding Near-Cliques in c-Closed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.17">10.4230/LIPIcs.ITCS.2022.17</a>
</li>
<li>
<span class="authors">Michael A. Bender, Martín Farach-Colton, and William Kuszmaul</span>
<span class="title">What Does Dynamic Optimality Mean in External Memory?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.18">10.4230/LIPIcs.ITCS.2022.18</a>
</li>
<li>
<span class="authors">Huck Bennett, Chris Peikert, and Yi Tang</span>
<span class="title">Improved Hardness of BDD and SVP Under Gap-(S)ETH</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.19">10.4230/LIPIcs.ITCS.2022.19</a>
</li>
<li>
<span class="authors">Amey Bhangale, Prahladh Harsha, and Sourya Roy</span>
<span class="title">Mixing of 3-Term Progressions in Quasirandom Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.20">10.4230/LIPIcs.ITCS.2022.20</a>
</li>
<li>
<span class="authors">Amey Bhangale and Aleksa Stanković</span>
<span class="title">Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.21">10.4230/LIPIcs.ITCS.2022.21</a>
</li>
<li>
<span class="authors">Vijay Bhattiprolu, Euiwoong Lee, and Madhur Tulsiani</span>
<span class="title">Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.22">10.4230/LIPIcs.ITCS.2022.22</a>
</li>
<li>
<span class="authors">Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J.A. Gregor Lagodzinski, Martin Schirneck, and Simon Wietheger</span>
<span class="title">Fixed-Parameter Sensitivity Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.23">10.4230/LIPIcs.ITCS.2022.23</a>
</li>
<li>
<span class="authors">Amartya Shankha Biswas, Edward Pyne, and Ronitt Rubinfeld</span>
<span class="title">Local Access to Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.24">10.4230/LIPIcs.ITCS.2022.24</a>
</li>
<li>
<span class="authors">Greg Bodwin, Michael Dinitz, and Yasamin Nazari</span>
<span class="title">Vertex Fault-Tolerant Emulators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.25">10.4230/LIPIcs.ITCS.2022.25</a>
</li>
<li>
<span class="authors">Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, and Akshayaram Srinivasan</span>
<span class="title">Bounded Indistinguishability for Simple Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.26">10.4230/LIPIcs.ITCS.2022.26</a>
</li>
<li>
<span class="authors">Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, and Ohad Klein</span>
<span class="title">Locality-Preserving Hashing for Shifts with Connections to Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.27">10.4230/LIPIcs.ITCS.2022.27</a>
</li>
<li>
<span class="authors">Zvika Brakerski and Vinod Vaikuntanathan</span>
<span class="title">Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.28">10.4230/LIPIcs.ITCS.2022.28</a>
</li>
<li>
<span class="authors">Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhoň, and Zoltán Vidnyánszky</span>
<span class="title">Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.29">10.4230/LIPIcs.ITCS.2022.29</a>
</li>
<li>
<span class="authors">Liron Bronfman and Ron D. Rothblum</span>
<span class="title">PCPs and Instance Compression from a Cryptographic Lens</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.30">10.4230/LIPIcs.ITCS.2022.30</a>
</li>
<li>
<span class="authors">Harry Buhrman, Bruno Loff, Subhasree Patro, and Florian Speelman</span>
<span class="title">Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.31">10.4230/LIPIcs.ITCS.2022.31</a>
</li>
<li>
<span class="authors">Johannes Bund, Christoph Lenzen, and Moti Medina</span>
<span class="title">Small Hazard-Free Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.32">10.4230/LIPIcs.ITCS.2022.32</a>
</li>
<li>
<span class="authors">Sílvia Casacuberta and Rasmus Kyng</span>
<span class="title">Faster Sparse Matrix Inversion and Rank Computation in Finite Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.33">10.4230/LIPIcs.ITCS.2022.33</a>
</li>
<li>
<span class="authors">Bruno P. Cavalar and Zhenjian Lu</span>
<span class="title">Algorithms and Lower Bounds for Comparator Circuits from Shrinkage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.34">10.4230/LIPIcs.ITCS.2022.34</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, and Rotem Oshman</span>
<span class="title">Quantum Distributed Algorithms for Detection of Cliques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.35">10.4230/LIPIcs.ITCS.2022.35</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Yannic Maus, Shahar Romem-Peled, and Tigran Tonoyan</span>
<span class="title">Distributed Vertex Cover Reconfiguration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.36">10.4230/LIPIcs.ITCS.2022.36</a>
</li>
<li>
<span class="authors">Amit Chakrabarti, Prantar Ghosh, and Manuel Stoeckl</span>
<span class="title">Adversarially Robust Coloring for Graph Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.37">10.4230/LIPIcs.ITCS.2022.37</a>
</li>
<li>
<span class="authors">Brynmor Chapman and R. Ryan Williams</span>
<span class="title">Smaller ACC0 Circuits for Symmetric Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.38">10.4230/LIPIcs.ITCS.2022.38</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, and Partha Mukhopadhyay</span>
<span class="title">Monotone Complexity of Spanning Tree Polynomial Re-Visited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.39">10.4230/LIPIcs.ITCS.2022.39</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay, Jesse Goodman, and David Zuckerman</span>
<span class="title">The Space Complexity of Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.40">10.4230/LIPIcs.ITCS.2022.40</a>
</li>
<li>
<span class="authors">Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, and Ruta Mehta</span>
<span class="title">On the Existence of Competitive Equilibrium with Chores</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.41">10.4230/LIPIcs.ITCS.2022.41</a>
</li>
<li>
<span class="authors">Shuchi Chawla and Meena Jagadeesan</span>
<span class="title">Individual Fairness in Advertising Auctions Through Inverse Proportionality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.42">10.4230/LIPIcs.ITCS.2022.42</a>
</li>
<li>
<span class="authors">Xue Chen, Kuan Cheng, Xin Li, and Minghui Ouyang</span>
<span class="title">Improved Decoding of Expander Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.43">10.4230/LIPIcs.ITCS.2022.43</a>
</li>
<li>
<span class="authors">Yiling Chen, Alon Eden, and Juntao Wang</span>
<span class="title">Cursed yet Satisfied Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.44">10.4230/LIPIcs.ITCS.2022.44</a>
</li>
<li>
<span class="authors">Lijie Chen, Shuichi Hirahara, and Neekon Vafa</span>
<span class="title">Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.45">10.4230/LIPIcs.ITCS.2022.45</a>
</li>
<li>
<span class="authors">Sitan Chen, Zhao Song, Runzhou Tao, and Ruizhe Zhang</span>
<span class="title">Symmetric Sparse Boolean Matrix Factorization and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.46">10.4230/LIPIcs.ITCS.2022.46</a>
</li>
<li>
<span class="authors">Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, and Ruizhe Zhang</span>
<span class="title">Quantum Meets the Minimum Circuit Size Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.47">10.4230/LIPIcs.ITCS.2022.47</a>
</li>
<li>
<span class="authors">Matthias Christandl, Omar Fawzi, Hoang Ta, and Jeroen Zuiddam</span>
<span class="title">Larger Corner-Free Sets from Combinatorial Degenerations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.48">10.4230/LIPIcs.ITCS.2022.48</a>
</li>
<li>
<span class="authors">Giorgos Christodoulou, Vasilis Gkatzelis, and Daniel Schoepflin</span>
<span class="title">Optimal Deterministic Clock Auctions and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.49">10.4230/LIPIcs.ITCS.2022.49</a>
</li>
<li>
<span class="authors">Roni Con and Itzhak Tamo</span>
<span class="title">Nonlinear Repair Schemes of Reed-Solomon Codes.</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.50">10.4230/LIPIcs.ITCS.2022.50</a>
</li>
<li>
<span class="authors">Leonardo Nagami Coregliano, Fernando Granha Jeronimo, and Chris Jones</span>
<span class="title">A Complete Linear Programming Hierarchy for Linear Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.51">10.4230/LIPIcs.ITCS.2022.51</a>
</li>
<li>
<span class="authors">Anuj Dawar and Gregory Wilsenach</span>
<span class="title">Lower Bounds for Symmetric Circuits for the Determinant</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.52">10.4230/LIPIcs.ITCS.2022.52</a>
</li>
<li>
<span class="authors">Anindya De, Shivam Nadimpalli, and Rocco A. Servedio</span>
<span class="title">Convex Influences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.53">10.4230/LIPIcs.ITCS.2022.53</a>
</li>
<li>
<span class="authors">Abhinav Deshpande, Alexey V. Gorshkov, and Bill Fefferman</span>
<span class="title">The Importance of the Spectral Gap in Estimating Ground-State Energies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.54">10.4230/LIPIcs.ITCS.2022.54</a>
</li>
<li>
<span class="authors">Shahar Dobzinski and Sigal Oren</span>
<span class="title">Mechanism Design with Moral Bidders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.55">10.4230/LIPIcs.ITCS.2022.55</a>
</li>
<li>
<span class="authors">Yevgeniy Dodis, Harish Karthikeyan, and Daniel Wichs</span>
<span class="title">Small-Box Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.56">10.4230/LIPIcs.ITCS.2022.56</a>
</li>
<li>
<span class="authors">Nico Döttling, Vipul Goyal, Giulio Malavolta, and Justin Raizes</span>
<span class="title">Interaction-Preserving Compilers for Secure Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.57">10.4230/LIPIcs.ITCS.2022.57</a>
</li>
<li>
<span class="authors">Shaddin Dughmi</span>
<span class="title">Matroid Secretary Is Equivalent to Contention Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.58">10.4230/LIPIcs.ITCS.2022.58</a>
</li>
<li>
<span class="authors">Kunal Dutta, Arijit Ghosh, and Shay Moran</span>
<span class="title">Uniform Brackets, Containers, and Combinatorial Macbeath Regions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.59">10.4230/LIPIcs.ITCS.2022.59</a>
</li>
<li>
<span class="authors">Farzam Ebrahimnejad and James R. Lee</span>
<span class="title">Multiscale Entropic Regularization for MTS on General Metric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.60">10.4230/LIPIcs.ITCS.2022.60</a>
</li>
<li>
<span class="authors">Farzam Ebrahimnejad, Ansh Nagda, and Shayan Oveis Gharan</span>
<span class="title">Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.61">10.4230/LIPIcs.ITCS.2022.61</a>
</li>
<li>
<span class="authors">Talya Eden, Piotr Indyk, and Haike Xu</span>
<span class="title">Embeddings and Labeling Schemes for A*</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.62">10.4230/LIPIcs.ITCS.2022.62</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, and O-joung Kwon</span>
<span class="title">A Unifying Framework for Characterizing and Computing Width Measures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.63">10.4230/LIPIcs.ITCS.2022.63</a>
</li>
<li>
<span class="authors">Ronen Eldan and Dana Moshkovitz</span>
<span class="title">Reduction from Non-Unique Games to Boolean Unique Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.64">10.4230/LIPIcs.ITCS.2022.64</a>
</li>
<li>
<span class="authors">Reyad Abed Elrazik, Robert Robere, Assaf Schuster, and Gal Yehuda</span>
<span class="title">Pseudorandom Self-Reductions for NP-Complete Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.65">10.4230/LIPIcs.ITCS.2022.65</a>
</li>
<li>
<span class="authors">Meryem Essaidi, Matheus V. X. Ferreira, and S. Matthew Weinberg</span>
<span class="title">Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.66">10.4230/LIPIcs.ITCS.2022.66</a>
</li>
<li>
<span class="authors">Michael Ezra and Ron D. Rothblum</span>
<span class="title">Small Circuits Imply Efficient Arthur-Merlin Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.67">10.4230/LIPIcs.ITCS.2022.67</a>
</li>
<li>
<span class="authors">Omar Fawzi, Alexander Müller-Hermes, and Ala Shayeghi</span>
<span class="title">A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.68">10.4230/LIPIcs.ITCS.2022.68</a>
</li>
<li>
<span class="authors">Noah Fleming, Mika Göös, Stefan Grosser, and Robert Robere</span>
<span class="title">On Semi-Algebraic Proofs and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.69">10.4230/LIPIcs.ITCS.2022.69</a>
</li>
<li>
<span class="authors">Noah Fleming, Toniann Pitassi, and Robert Robere</span>
<span class="title">Extremely Deep Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.70">10.4230/LIPIcs.ITCS.2022.70</a>
</li>
<li>
<span class="authors">Ingerid Fosli, Yuval Ishai, Victor I. Kolobov, and Mary Wootters</span>
<span class="title">On the Download Rate of Homomorphic Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.71">10.4230/LIPIcs.ITCS.2022.71</a>
</li>
<li>
<span class="authors">Peter Frankl, Svyatoslav Gryaznov, and Navid Talebanfard</span>
<span class="title">A Variant of the VC-Dimension with Applications to Depth-3 Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.72">10.4230/LIPIcs.ITCS.2022.72</a>
</li>
<li>
<span class="authors">Hugo Rincon Galeana, Sergio Rajsbaum, and Ulrich Schmid</span>
<span class="title">Continuous Tasks and the Asynchronous Computability Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.73">10.4230/LIPIcs.ITCS.2022.73</a>
</li>
<li>
<span class="authors">Luca Ganassali, Laurent Massoulié, and Marc Lelarge</span>
<span class="title">Correlation Detection in Trees for Planted Graph Alignment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.74">10.4230/LIPIcs.ITCS.2022.74</a>
</li>
<li>
<span class="authors">Sevag Gharibian and Dorian Rudolph</span>
<span class="title">On Polynomially Many Queries to NP or QMA Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.75">10.4230/LIPIcs.ITCS.2022.75</a>
</li>
<li>
<span class="authors">Uma Girish and Ran Raz</span>
<span class="title">Eliminating Intermediate Measurements Using Pseudorandom Generators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.76">10.4230/LIPIcs.ITCS.2022.76</a>
</li>
<li>
<span class="authors">Guy Goldberg and Guy N. Rothblum</span>
<span class="title">Sample-Based Proofs of Proximity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.77">10.4230/LIPIcs.ITCS.2022.77</a>
</li>
<li>
<span class="authors">Oded Goldreich and Dana Ron</span>
<span class="title">Testing Distributions of Huge Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.78">10.4230/LIPIcs.ITCS.2022.78</a>
</li>
<li>
<span class="authors">Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, and Udi Wieder</span>
<span class="title">Omnipredictors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.79">10.4230/LIPIcs.ITCS.2022.79</a>
</li>
<li>
<span class="authors">W. T. Gowers and Emanuele Viola</span>
<span class="title">Mixing in Non-Quasirandom Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.80">10.4230/LIPIcs.ITCS.2022.80</a>
</li>
<li>
<span class="authors">Vipul Goyal, Justin Raizes, and Pratik Soni</span>
<span class="title">Time-Traveling Simulators Using Blockchains and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.81">10.4230/LIPIcs.ITCS.2022.81</a>
</li>
<li>
<span class="authors">Varun Gupta, Christopher Jung, Georgy Noarov, Mallesh M. Pai, and Aaron Roth</span>
<span class="title">Online Multivalid Learning: Means, Moments, and Prediction Intervals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.82">10.4230/LIPIcs.ITCS.2022.82</a>
</li>
<li>
<span class="authors">MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, and Hsin-Hao Su</span>
<span class="title">Adaptive Massively Parallel Constant-Round Tree Contraction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.83">10.4230/LIPIcs.ITCS.2022.83</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Rahul Santhanam</span>
<span class="title">Errorless Versus Error-Prone Average-Case Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.84">10.4230/LIPIcs.ITCS.2022.84</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Rahul Santhanam</span>
<span class="title">Excluding PH Pessiland</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.85">10.4230/LIPIcs.ITCS.2022.85</a>
</li>
<li>
<span class="authors">Mojtaba Hosseini and Vijay V. Vazirani</span>
<span class="title">Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.86">10.4230/LIPIcs.ITCS.2022.86</a>
</li>
<li>
<span class="authors">Gábor Ivanyos, Tushant Mittal, and Youming Qiao</span>
<span class="title">Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.87">10.4230/LIPIcs.ITCS.2022.87</a>
</li>
<li>
<span class="authors">Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, and Madhur Tulsiani</span>
<span class="title">Explicit Abelian Lifts and Quantum LDPC Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.88">10.4230/LIPIcs.ITCS.2022.88</a>
</li>
<li>
<span class="authors">Chris Jones and Aaron Potechin</span>
<span class="title">Almost-Orthogonal Bases for Inner Product Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.89">10.4230/LIPIcs.ITCS.2022.89</a>
</li>
<li>
<span class="authors">Iden Kalemaj, Sofya Raskhodnikova, and Nithin Varma</span>
<span class="title">Sublinear-Time Computation in the Presence of Online Erasures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.90">10.4230/LIPIcs.ITCS.2022.90</a>
</li>
<li>
<span class="authors">Michael Kapralov, Amulya Musipatla, Jakab Tardos, David P. Woodruff, and Samson Zhou</span>
<span class="title">Noisy Boolean Hidden Matching with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.91">10.4230/LIPIcs.ITCS.2022.91</a>
</li>
<li>
<span class="authors">Gili Karni, Guy N. Rothblum, and Gal Yona</span>
<span class="title">On Fairness and Stability in Two-Sided Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.92">10.4230/LIPIcs.ITCS.2022.92</a>
</li>
<li>
<span class="authors">Sanjeev Khanna and Christian Konrad</span>
<span class="title">Optimal Bounds for Dominating Set in Graph Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.93">10.4230/LIPIcs.ITCS.2022.93</a>
</li>
<li>
<span class="authors">Peter Kiss</span>
<span class="title">Deterministic Dynamic Matching in Worst-Case Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.94">10.4230/LIPIcs.ITCS.2022.94</a>
</li>
<li>
<span class="authors">Yuqing Kong</span>
<span class="title">More Dominantly Truthful Multi-Task Peer Prediction with a Finite Number of Tasks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.95">10.4230/LIPIcs.ITCS.2022.95</a>
</li>
<li>
<span class="authors">Hung Le, Lazar Milenković, Shay Solomon, and Virginia Vassilevska Williams</span>
<span class="title">Dynamic Matching Algorithms Under Vertex Updates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.96">10.4230/LIPIcs.ITCS.2022.96</a>
</li>
<li>
<span class="authors">François Le Gall and Saeed Seddighin</span>
<span class="title">Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.97">10.4230/LIPIcs.ITCS.2022.97</a>
</li>
<li>
<span class="authors">Jasper C.H. Lee and Paul Valiant</span>
<span class="title">Optimal Sub-Gaussian Mean Estimation in Very High Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.98">10.4230/LIPIcs.ITCS.2022.98</a>
</li>
<li>
<span class="authors">Alexander Lindermayr, Nicole Megow, and Bertrand Simon</span>
<span class="title">Double Coverage with Machine-Learned Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.99">10.4230/LIPIcs.ITCS.2022.99</a>
</li>
<li>
<span class="authors">Jiahui Liu, Qipeng Liu, and Luowen Qian</span>
<span class="title">Beating Classical Impossibility of Position Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.100">10.4230/LIPIcs.ITCS.2022.100</a>
</li>
<li>
<span class="authors">Yang P. Liu, Ashwin Sah, and Mehtaab Sawhney</span>
<span class="title">A Gaussian Fixed Point Random Walk</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.101">10.4230/LIPIcs.ITCS.2022.101</a>
</li>
<li>
<span class="authors">Alex Lombardi and Vinod Vaikuntanathan</span>
<span class="title">Correlation-Intractable Hash Functions via Shift-Hiding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.102">10.4230/LIPIcs.ITCS.2022.102</a>
</li>
<li>
<span class="authors">Dimitrios Los and Thomas Sauerwald</span>
<span class="title">Balanced Allocations with Incomplete Information: The Power of Two Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.103">10.4230/LIPIcs.ITCS.2022.103</a>
</li>
<li>
<span class="authors">Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, and Jiapeng Zhang</span>
<span class="title">Lifting with Sunflowers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.104">10.4230/LIPIcs.ITCS.2022.104</a>
</li>
<li>
<span class="authors">Jieming Mao, Renato Paes Leme, and Kangning Wang</span>
<span class="title">Interactive Communication in Bilateral Trade</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.105">10.4230/LIPIcs.ITCS.2022.105</a>
</li>
<li>
<span class="authors">Arya Mazumdar and Soumyabrata Pal</span>
<span class="title">Support Recovery in Universal One-Bit Compressed Sensing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.106">10.4230/LIPIcs.ITCS.2022.106</a>
</li>
<li>
<span class="authors">Boaz Menuhin and Moni Naor</span>
<span class="title">Keep That Card in Mind: Card Guessing with Limited Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.107">10.4230/LIPIcs.ITCS.2022.107</a>
</li>
<li>
<span class="authors">Hariharan Narayanan, Rikhav Shah, and Nikhil Srivastava</span>
<span class="title">A Spectral Approach to Polytope Diameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.108">10.4230/LIPIcs.ITCS.2022.108</a>
</li>
<li>
<span class="authors">Sam Olesker-Taylor and Luca Zanetti</span>
<span class="title">Geometric Bounds on the Fastest Mixing Markov Chain</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.109">10.4230/LIPIcs.ITCS.2022.109</a>
</li>
<li>
<span class="authors">Shir Peleg, Ben Lee Volk, and Amir Shpilka</span>
<span class="title">Lower Bounds on Stabilizer Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.110">10.4230/LIPIcs.ITCS.2022.110</a>
</li>
<li>
<span class="authors">Mohammad Roghani, Amin Saberi, and David Wajc</span>
<span class="title">Beating the Folklore Algorithm for Dynamic Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.111">10.4230/LIPIcs.ITCS.2022.111</a>
</li>
<li>
<span class="authors">Gregory Rosenthal and Henry Yuen</span>
<span class="title">Interactive Proofs for Synthesizing Quantum States and Unitaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.112">10.4230/LIPIcs.ITCS.2022.112</a>
</li>
<li>
<span class="authors">Aviad Rubinstein and Junyao Zhao</span>
<span class="title">Budget-Smoothed Analysis for Submodular Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.113">10.4230/LIPIcs.ITCS.2022.113</a>
</li>
<li>
<span class="authors">Ziv Scully, Isaac Grosof, and Michael Mitzenmacher</span>
<span class="title">Uniform Bounds for Scheduling with Job Size Estimates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.114">10.4230/LIPIcs.ITCS.2022.114</a>
</li>
<li>
<span class="authors">Masoud Seddighin and Saeed Seddighin</span>
<span class="title">3+ε Approximation of Tree Edit Distance in Truly Subquadratic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.115">10.4230/LIPIcs.ITCS.2022.115</a>
</li>
<li>
<span class="authors">Ronen Shaltiel and Emanuele Viola</span>
<span class="title">On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.116">10.4230/LIPIcs.ITCS.2022.116</a>
</li>
<li>
<span class="authors">Noah Shutty and Mary Wootters</span>
<span class="title">Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.117">10.4230/LIPIcs.ITCS.2022.117</a>
</li>
<li>
<span class="authors">Gaurav Sinha</span>
<span class="title">Efficient Reconstruction of Depth Three Arithmetic Circuits with Top Fan-In Two</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.118">10.4230/LIPIcs.ITCS.2022.118</a>
</li>
<li>
<span class="authors">Dieter van Melkebeek and Andrew Morgan</span>
<span class="title">Polynomial Identity Testing via Evaluation of Rational Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.119">10.4230/LIPIcs.ITCS.2022.119</a>
</li>
<li>
<span class="authors">Weina Wang, Anupam Gupta, and Jalani K. Williams</span>
<span class="title">Probing to Minimize</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2022.120">10.4230/LIPIcs.ITCS.2022.120</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