<h2>LIPIcs, Volume 251, ITCS 2023</h2>
<ul>
<li>
<span class="authors">Yael Tauman Kalai</span>
<span class="title">LIPIcs, Volume 251, ITCS 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023">10.4230/LIPIcs.ITCS.2023</a>
</li>
<li>
<span class="authors">Yael Tauman Kalai</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.0">10.4230/LIPIcs.ITCS.2023.0</a>
</li>
<li>
<span class="authors">Amir Abboud and Nathan Wallheimer</span>
<span class="title">Worst-Case to Expander-Case Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.1">10.4230/LIPIcs.ITCS.2023.1</a>
</li>
<li>
<span class="authors">Dorna Abdolazimi, Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan</span>
<span class="title">Matroid Partition Property and the Secretary Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.2">10.4230/LIPIcs.ITCS.2023.2</a>
</li>
<li>
<span class="authors">Eric Allender, Shuichi Hirahara, and Harsha Tirumala</span>
<span class="title">Kolmogorov Complexity Characterizes Statistical Zero Knowledge</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.3">10.4230/LIPIcs.ITCS.2023.3</a>
</li>
<li>
<span class="authors">Alexandr Andoni, Jarosław Błasiok, and Arnold Filtser</span>
<span class="title">Communication Complexity of Inner Product in Symmetric Normed Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.4">10.4230/LIPIcs.ITCS.2023.4</a>
</li>
<li>
<span class="authors">Anurag Anshu and Tony Metger</span>
<span class="title">Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial Approximations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.5">10.4230/LIPIcs.ITCS.2023.5</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, and C. Ramya</span>
<span class="title">On Identity Testing and Noncommutative Rank Computation over the Free Skew Field</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.6">10.4230/LIPIcs.ITCS.2023.6</a>
</li>
<li>
<span class="authors">Sepehr Assadi, Aaron Bernstein, and Zachary Langley</span>
<span class="title">All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.7">10.4230/LIPIcs.ITCS.2023.7</a>
</li>
<li>
<span class="authors">Idan Attias, Edith Cohen, Moshe Shechner, and Uri Stemmer</span>
<span class="title">A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.8">10.4230/LIPIcs.ITCS.2023.8</a>
</li>
<li>
<span class="authors">Moshe Babaioff, Nicole Immorlica, Yingkai Li, and Brendan Lucier</span>
<span class="title">Making Auctions Robust to Aftermarkets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.9">10.4230/LIPIcs.ITCS.2023.9</a>
</li>
<li>
<span class="authors">Mirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Małgorzata Gałązka, Tomasz Lizurej, and Krzysztof Pietrzak</span>
<span class="title">Efficiently Testable Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.10">10.4230/LIPIcs.ITCS.2023.10</a>
</li>
<li>
<span class="authors">Eric Balkanski, Vasilis Gkatzelis, and Xizhi Tan</span>
<span class="title">Strategyproof Scheduling with Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.11">10.4230/LIPIcs.ITCS.2023.11</a>
</li>
<li>
<span class="authors">Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta, and Zhouzi Li</span>
<span class="title">Graph Searching with Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.12">10.4230/LIPIcs.ITCS.2023.12</a>
</li>
<li>
<span class="authors">Ulrich Bauer, Abhishek Rathod, and Meirav Zehavi</span>
<span class="title">On Computing Homological Hitting Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.13">10.4230/LIPIcs.ITCS.2023.13</a>
</li>
<li>
<span class="authors">Paul Beame and Sajin Koroth</span>
<span class="title">On Disperser/Lifting Properties of the Index and Inner-Product Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.14">10.4230/LIPIcs.ITCS.2023.14</a>
</li>
<li>
<span class="authors">Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, and Madhu Sudan</span>
<span class="title">Is This Correct? Let’s Check!</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.15">10.4230/LIPIcs.ITCS.2023.15</a>
</li>
<li>
<span class="authors">Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, and Kamesh Munagala</span>
<span class="title">Online Learning and Bandits with Queried Hints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.16">10.4230/LIPIcs.ITCS.2023.16</a>
</li>
<li>
<span class="authors">Nir Bitansky and Tomer Solomon</span>
<span class="title">Bootstrapping Homomorphic Encryption via Functional Encryption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.17">10.4230/LIPIcs.ITCS.2023.17</a>
</li>
<li>
<span class="authors">Guy Blanc, Caleb Koch, Jane Lange, Carmen Strassle, and Li-Yang Tan</span>
<span class="title">Certification with an NP Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.18">10.4230/LIPIcs.ITCS.2023.18</a>
</li>
<li>
<span class="authors">Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, and Chris Umans</span>
<span class="title">Matrix Multiplication via Matrix Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.19">10.4230/LIPIcs.ITCS.2023.19</a>
</li>
<li>
<span class="authors">Greg Bodwin, Michael Dinitz, and Yasamin Nazari</span>
<span class="title">Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.20">10.4230/LIPIcs.ITCS.2023.20</a>
</li>
<li>
<span class="authors">Greg Bodwin and Forest Zhang</span>
<span class="title">Opponent Indifference in Rating Systems: A Theoretical Case for Sonas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.21">10.4230/LIPIcs.ITCS.2023.21</a>
</li>
<li>
<span class="authors">Romain Bourneuf, Lukáš Folwarczný, Pavel Hubáček, Alon Rosen, and Nikolaj I. Schwartzbach</span>
<span class="title">PPP-Completeness and Extremal Combinatorics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.22">10.4230/LIPIcs.ITCS.2023.22</a>
</li>
<li>
<span class="authors">Elette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, and Gal Yehuda</span>
<span class="title">On Low-End Obfuscation and Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.23">10.4230/LIPIcs.ITCS.2023.23</a>
</li>
<li>
<span class="authors">Zvika Brakerski, Ran Canetti, and Luowen Qian</span>
<span class="title">On the Computational Hardness Needed for Quantum Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.24">10.4230/LIPIcs.ITCS.2023.24</a>
</li>
<li>
<span class="authors">Mark Braverman, Subhash Khot, Guy Kindler, and Dor Minzer</span>
<span class="title">Improved Monotonicity Testers via Hypercube Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.25">10.4230/LIPIcs.ITCS.2023.25</a>
</li>
<li>
<span class="authors">Mark Braverman and Dor Minzer</span>
<span class="title">Rounding via Low Dimensional Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.26">10.4230/LIPIcs.ITCS.2023.26</a>
</li>
<li>
<span class="authors">Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, and Marc Roth</span>
<span class="title">Counting Subgraphs in Somewhere Dense Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.27">10.4230/LIPIcs.ITCS.2023.27</a>
</li>
<li>
<span class="authors">Anne Broadbent and Eric Culf</span>
<span class="title">Rigidity for Monogamy-Of-Entanglement Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.28">10.4230/LIPIcs.ITCS.2023.28</a>
</li>
<li>
<span class="authors">Harry Buhrman, Noah Linden, Laura Mančinska, Ashley Montanaro, and Maris Ozols</span>
<span class="title">Quantum Majority Vote</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.29">10.4230/LIPIcs.ITCS.2023.29</a>
</li>
<li>
<span class="authors">Sam Buss, Noah Fleming, and Russell Impagliazzo</span>
<span class="title">TFNP Characterizations of Proof Systems and Monotone Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.30">10.4230/LIPIcs.ITCS.2023.30</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Debarati Das, and Robert Krauthgamer</span>
<span class="title">Clustering Permutations: New Techniques with Streaming Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.31">10.4230/LIPIcs.ITCS.2023.31</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, and Anupa Sunny</span>
<span class="title">Certificate Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.32">10.4230/LIPIcs.ITCS.2023.32</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, and Suhail Sherif</span>
<span class="title">Lifting to Parity Decision Trees via Stifling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.33">10.4230/LIPIcs.ITCS.2023.33</a>
</li>
<li>
<span class="authors">Lijie Chen</span>
<span class="title">New Lower Bounds and Derandomization for ACC, and a Derandomization-Centric View on the Algorithmic Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.34">10.4230/LIPIcs.ITCS.2023.34</a>
</li>
<li>
<span class="authors">Lijie Chen, Ryan Williams, and Tianqi Yang</span>
<span class="title">Black-Box Constructive Proofs Are Unavoidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.35">10.4230/LIPIcs.ITCS.2023.35</a>
</li>
<li>
<span class="authors">Albert Cheu and Chao Yan</span>
<span class="title">Necessary Conditions in Multi-Server Differential Privacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.36">10.4230/LIPIcs.ITCS.2023.36</a>
</li>
<li>
<span class="authors">Andrew M. Childs, Matthew Coudron, and Amin Shiraz Gilani</span>
<span class="title">Quantum Algorithms and the Power of Forgetting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.37">10.4230/LIPIcs.ITCS.2023.37</a>
</li>
<li>
<span class="authors">Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, and Zihan Tan</span>
<span class="title">A New Conjecture on Hardness of 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.38">10.4230/LIPIcs.ITCS.2023.38</a>
</li>
<li>
<span class="authors">Edith Cohen, Xin Lyu, Jelani Nelson, Tamás Sarlós, and Uri Stemmer</span>
<span class="title">Generalized Private Selection and Testing with High Confidence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.39">10.4230/LIPIcs.ITCS.2023.39</a>
</li>
<li>
<span class="authors">Leonardo Nagami Coregliano, Fernando Granha Jeronimo, and Chris Jones</span>
<span class="title">Exact Completeness of LP Hierarchies for Linear Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.40">10.4230/LIPIcs.ITCS.2023.40</a>
</li>
<li>
<span class="authors">Zhun Deng, Cynthia Dwork, and Linjun Zhang</span>
<span class="title">HappyMap : A Generalized Multicalibration Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.41">10.4230/LIPIcs.ITCS.2023.41</a>
</li>
<li>
<span class="authors">Papri Dey, Ravi Kannan, Nick Ryder, and Nikhil Srivastava</span>
<span class="title">Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.42">10.4230/LIPIcs.ITCS.2023.42</a>
</li>
<li>
<span class="authors">Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, and Vladimir Podolskii</span>
<span class="title">Constant-Depth Sorting Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.43">10.4230/LIPIcs.ITCS.2023.43</a>
</li>
<li>
<span class="authors">Shahar Dobzinski and Ariel Shaulker</span>
<span class="title">Rigidity in Mechanism Design and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.44">10.4230/LIPIcs.ITCS.2023.44</a>
</li>
<li>
<span class="authors">Fabien Dufoulon, Yuval Emek, and Ran Gelles</span>
<span class="title">Beeping Shortest Paths via Hypergraph Bipartite Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.45">10.4230/LIPIcs.ITCS.2023.45</a>
</li>
<li>
<span class="authors">Klim Efremenko, Gillat Kol, Dmitry Paramonov, and Raghuvansh R. Saxena</span>
<span class="title">Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.46">10.4230/LIPIcs.ITCS.2023.46</a>
</li>
<li>
<span class="authors">Antoine El-Hayek, Monika Henzinger, and Stefan Schmid</span>
<span class="title">Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.47">10.4230/LIPIcs.ITCS.2023.47</a>
</li>
<li>
<span class="authors">Alessandro Epasto, Jieming Mao, Andres Munoz Medina, Vahab Mirrokni, Sergei Vassilvitskii, and Peilin Zhong</span>
<span class="title">Differentially Private Continual Releases of Streaming Frequency Moment Estimations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.48">10.4230/LIPIcs.ITCS.2023.48</a>
</li>
<li>
<span class="authors">Hamza Fawzi, Omar Fawzi, and Samuel O. Scalet</span>
<span class="title">A Subpolynomial-Time Algorithm for the Free Energy of One-Dimensional Quantum Systems in the Thermodynamic Limit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.49">10.4230/LIPIcs.ITCS.2023.49</a>
</li>
<li>
<span class="authors">Arnold Filtser, Michael Kapralov, and Mikhail Makarov</span>
<span class="title">Expander Decomposition in Dynamic Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.50">10.4230/LIPIcs.ITCS.2023.50</a>
</li>
<li>
<span class="authors">Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, and Valentin Polishchuk</span>
<span class="title">On Flipping the Fréchet Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.51">10.4230/LIPIcs.ITCS.2023.51</a>
</li>
<li>
<span class="authors">Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins</span>
<span class="title">Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.52">10.4230/LIPIcs.ITCS.2023.52</a>
</li>
<li>
<span class="authors">Sevag Gharibian and Dorian Rudolph</span>
<span class="title">Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.53">10.4230/LIPIcs.ITCS.2023.53</a>
</li>
<li>
<span class="authors">Badih Ghazi, Ravi Kumar, Pasin Manurangsi, and Thomas Steinke</span>
<span class="title">Algorithms with More Granular Differential Privacy Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.54">10.4230/LIPIcs.ITCS.2023.54</a>
</li>
<li>
<span class="authors">Badih Ghazi, Ravi Kumar, Jelani Nelson, and Pasin Manurangsi</span>
<span class="title">Private Counting of Distinct and k-Occurring Items in Time Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.55">10.4230/LIPIcs.ITCS.2023.55</a>
</li>
<li>
<span class="authors">Uma Girish, Ran Raz, and Wei Zhan</span>
<span class="title">Is Untrusted Randomness Helpful?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.56">10.4230/LIPIcs.ITCS.2023.56</a>
</li>
<li>
<span class="authors">Paul Goldberg and Jiawei Li</span>
<span class="title">Consensus Division in an Arbitrary Ratio</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.57">10.4230/LIPIcs.ITCS.2023.57</a>
</li>
<li>
<span class="authors">Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, and Barna Saha</span>
<span class="title">An Algorithmic Bridge Between Hamming and Levenshtein Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.58">10.4230/LIPIcs.ITCS.2023.58</a>
</li>
<li>
<span class="authors">Oded Goldreich, Guy N. Rothblum, and Tal Skverer</span>
<span class="title">On Interactive Proofs of Proximity with Proof-Oblivious Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.59">10.4230/LIPIcs.ITCS.2023.59</a>
</li>
<li>
<span class="authors">Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, and Udi Wieder</span>
<span class="title">Loss Minimization Through the Lens Of Outcome Indistinguishability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.60">10.4230/LIPIcs.ITCS.2023.60</a>
</li>
<li>
<span class="authors">Roy Gotlib and Tali Kaufman</span>
<span class="title">List Agreement Expansion from Coboundary Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.61">10.4230/LIPIcs.ITCS.2023.61</a>
</li>
<li>
<span class="authors">Vipul Goyal, Chen-Da Liu-Zhang, Justin Raizes, and João Ribeiro</span>
<span class="title">Asynchronous Multi-Party Quantum Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.62">10.4230/LIPIcs.ITCS.2023.62</a>
</li>
<li>
<span class="authors">Fabrizio Grandoni, Claire Mathieu, and Hang Zhou</span>
<span class="title">Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.63">10.4230/LIPIcs.ITCS.2023.63</a>
</li>
<li>
<span class="authors">Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang</span>
<span class="title">Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.64">10.4230/LIPIcs.ITCS.2023.64</a>
</li>
<li>
<span class="authors">Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, and Janani Sundaresan</span>
<span class="title">Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.65">10.4230/LIPIcs.ITCS.2023.65</a>
</li>
<li>
<span class="authors">Iftach Haitner, Noam Mazor, and Jad Silbak</span>
<span class="title">Incompressiblity and Next-Block Pseudoentropy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.66">10.4230/LIPIcs.ITCS.2023.66</a>
</li>
<li>
<span class="authors">Prahladh Harsha, Daniel Mitropolsky, and Alon Rosen</span>
<span class="title">Downward Self-Reducibility in TFNP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.67">10.4230/LIPIcs.ITCS.2023.67</a>
</li>
<li>
<span class="authors">William He and Benjamin Rossman</span>
<span class="title">Symmetric Formulas for Products of Permutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.68">10.4230/LIPIcs.ITCS.2023.68</a>
</li>
<li>
<span class="authors">Monika Henzinger, Billy Jin, Richard Peng, and David P. Williamson</span>
<span class="title">A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.69">10.4230/LIPIcs.ITCS.2023.69</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Mikito Nanashima</span>
<span class="title">Learning Versus Pseudorandom Generators in Constant Parallel Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.70">10.4230/LIPIcs.ITCS.2023.70</a>
</li>
<li>
<span class="authors">Yael Hitron, Merav Parter, and Eylon Yogev</span>
<span class="title">Secure Distributed Network Optimization Against Eavesdroppers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.71">10.4230/LIPIcs.ITCS.2023.71</a>
</li>
<li>
<span class="authors">Lunjia Hu and Charlotte Peale</span>
<span class="title">Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.72">10.4230/LIPIcs.ITCS.2023.72</a>
</li>
<li>
<span class="authors">Zhuangfei Hu, Xinda Li, David P. Woodruff, Hongyang Zhang, and Shufan Zhang</span>
<span class="title">Recovery from Non-Decomposable Distance Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.73">10.4230/LIPIcs.ITCS.2023.73</a>
</li>
<li>
<span class="authors">Christian Ikenmeyer, Balagopal Komarath, and Nitin Saurabh</span>
<span class="title">Karchmer-Wigderson Games for Hazard-Free Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.74">10.4230/LIPIcs.ITCS.2023.74</a>
</li>
<li>
<span class="authors">Yaonan Jin, Pinyan Lu, and Tao Xiao</span>
<span class="title">Learning Reserve Prices in Second-Price Auctions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.75">10.4230/LIPIcs.ITCS.2023.75</a>
</li>
<li>
<span class="authors">Yujia Jin, Vidya Muthukumar, and Aaron Sidford</span>
<span class="title">The Complexity of Infinite-Horizon General-Sum Stochastic Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.76">10.4230/LIPIcs.ITCS.2023.76</a>
</li>
<li>
<span class="authors">Chris Jones, Kunal Marwaha, Juspreet Singh Sandhu, and Jonathan Shi</span>
<span class="title">Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.77">10.4230/LIPIcs.ITCS.2023.77</a>
</li>
<li>
<span class="authors">Tali Kaufman and Ran J. Tessler</span>
<span class="title">Garland’s Technique for Posets and High Dimensional Grassmannian Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.78">10.4230/LIPIcs.ITCS.2023.78</a>
</li>
<li>
<span class="authors">Michael P. Kim and Juan C. Perdomo</span>
<span class="title">Making Decisions Under Outcome Performativity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.79">10.4230/LIPIcs.ITCS.2023.79</a>
</li>
<li>
<span class="authors">Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, and Huacheng Yu</span>
<span class="title">Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.80">10.4230/LIPIcs.ITCS.2023.80</a>
</li>
<li>
<span class="authors">Yuqing Kong and Grant Schoenebeck</span>
<span class="title">False Consensus, Information Theory, and Prediction Markets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.81">10.4230/LIPIcs.ITCS.2023.81</a>
</li>
<li>
<span class="authors">Qipeng Liu</span>
<span class="title">Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.82">10.4230/LIPIcs.ITCS.2023.82</a>
</li>
<li>
<span class="authors">Yang P. Liu</span>
<span class="title">Vertex Sparsification for Edge Connectivity in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.83">10.4230/LIPIcs.ITCS.2023.83</a>
</li>
<li>
<span class="authors">Shachar Lovett and Jiapeng Zhang</span>
<span class="title">Fractional Certificates for Bounded Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.84">10.4230/LIPIcs.ITCS.2023.84</a>
</li>
<li>
<span class="authors">Pasin Manurangsi</span>
<span class="title">Improved Inapproximability of VC Dimension and Littlestone’s Dimension via (Unbalanced) Biclique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.85">10.4230/LIPIcs.ITCS.2023.85</a>
</li>
<li>
<span class="authors">Uri Meir, Rotem Oshman, Ofer Shayevitz, and Yuval Volkov</span>
<span class="title">Resilience of 3-Majority Dynamics to Non-Uniform Schedulers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.86">10.4230/LIPIcs.ITCS.2023.86</a>
</li>
<li>
<span class="authors">Tomoyuki Morimae and Takashi Yamakawa</span>
<span class="title">Proofs of Quantumness from Trapdoor Permutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.87">10.4230/LIPIcs.ITCS.2023.87</a>
</li>
<li>
<span class="authors">Amol Pasarkar, Christos Papadimitriou, and Mihalis Yannakakis</span>
<span class="title">Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.88">10.4230/LIPIcs.ITCS.2023.88</a>
</li>
<li>
<span class="authors">Toniann Pitassi, Morgan Shirley, and Adi Shraibman</span>
<span class="title">The Strength of Equality Oracles in Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.89">10.4230/LIPIcs.ITCS.2023.89</a>
</li>
<li>
<span class="authors">Alexander Poremba</span>
<span class="title">Quantum Proofs of Deletion for Learning with Errors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.90">10.4230/LIPIcs.ITCS.2023.90</a>
</li>
<li>
<span class="authors">Mingda Qiao and Gregory Valiant</span>
<span class="title">Online Pen Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.91">10.4230/LIPIcs.ITCS.2023.91</a>
</li>
<li>
<span class="authors">Guy N. Rothblum and Gal Yona</span>
<span class="title">Decision-Making Under Miscalibration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.92">10.4230/LIPIcs.ITCS.2023.92</a>
</li>
<li>
<span class="authors">Aviad Rubinstein and Junyao Zhao</span>
<span class="title">Beyond Worst-Case Budget-Feasible Mechanism Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.93">10.4230/LIPIcs.ITCS.2023.93</a>
</li>
<li>
<span class="authors">Cynthia Rush, Fiona Skerman, Alexander S. Wein, and Dana Yang</span>
<span class="title">Is It Easier to Count Communities Than Find Them?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.94">10.4230/LIPIcs.ITCS.2023.94</a>
</li>
<li>
<span class="authors">Raghuvansh R. Saxena, Santhoshini Velusamy, and S. Matthew Weinberg</span>
<span class="title">An Improved Lower Bound for Matroid Intersection Prophet Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.95">10.4230/LIPIcs.ITCS.2023.95</a>
</li>
<li>
<span class="authors">Adrian She and Henry Yuen</span>
<span class="title">Unitary Property Testing Lower Bounds by Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.96">10.4230/LIPIcs.ITCS.2023.96</a>
</li>
<li>
<span class="authors">Elaine Shi, Hao Chung, and Ke Wu</span>
<span class="title">What Can Cryptography Do for Decentralized Mechanism Design?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.97">10.4230/LIPIcs.ITCS.2023.97</a>
</li>
<li>
<span class="authors">Prayaag Venkat</span>
<span class="title">Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.98">10.4230/LIPIcs.ITCS.2023.98</a>
</li>
<li>
<span class="authors">Nikhil Vyas and Ryan Williams</span>
<span class="title">On Oracles and Algorithmic Methods for Proving Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.99">10.4230/LIPIcs.ITCS.2023.99</a>
</li>
<li>
<span class="authors">Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, and Ulrich Schmid</span>
<span class="title">The Time Complexity of Consensus Under Oblivious Message Adversaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.100">10.4230/LIPIcs.ITCS.2023.100</a>
</li>
<li>
<span class="authors">Emre Yolcu and Marijn J. H. Heule</span>
<span class="title">Exponential Separations Using Guarded Extension Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2023.101">10.4230/LIPIcs.ITCS.2023.101</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