<h2>LIPIcs, Volume 287, ITCS 2024</h2>
<ul>
<li>
<span class="authors">Venkatesan Guruswami</span>
<span class="title">LIPIcs, Volume 287, ITCS 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024">10.4230/LIPIcs.ITCS.2024</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.0">10.4230/LIPIcs.ITCS.2024.0</a>
</li>
<li>
<span class="authors">Scott Aaronson, Harry Buhrman, and William Kretschmer</span>
<span class="title">A Qubit, a Coin, and an Advice String Walk into a Relational Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.1">10.4230/LIPIcs.ITCS.2024.1</a>
</li>
<li>
<span class="authors">Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh Vazirani, Chenyi Zhang, and Zixin Zhou</span>
<span class="title">Quantum Pseudoentanglement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.2">10.4230/LIPIcs.ITCS.2024.2</a>
</li>
<li>
<span class="authors">Maryam Aliakbarpour, Rose Silver, Thomas Steinke, and Jonathan Ullman</span>
<span class="title">Differentially Private Medians and Interior Points for Non-Pathological Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.3">10.4230/LIPIcs.ITCS.2024.3</a>
</li>
<li>
<span class="authors">Josh Alman, Ethan Turok, Hantao Yu, and Hengzhi Zhang</span>
<span class="title">Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.4">10.4230/LIPIcs.ITCS.2024.4</a>
</li>
<li>
<span class="authors">Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, and Manolis Zampetakis</span>
<span class="title">On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.5">10.4230/LIPIcs.ITCS.2024.5</a>
</li>
<li>
<span class="authors">Prabhanjan Ananth, Yao-Ting Lin, and Henry Yuen</span>
<span class="title">Pseudorandom Strings from Pseudorandom Quantum States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.6">10.4230/LIPIcs.ITCS.2024.6</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, and Kasturi Varadarajan</span>
<span class="title">Geometric Covering via Extraction Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.7">10.4230/LIPIcs.ITCS.2024.7</a>
</li>
<li>
<span class="authors">Siddharth Barman, Anand Krishna, Pooja Kulkarni, and Shivika Narang</span>
<span class="title">Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.8">10.4230/LIPIcs.ITCS.2024.8</a>
</li>
<li>
<span class="authors">Roozbeh Bassirian, Bill Fefferman, and Kunal Marwaha</span>
<span class="title">Quantum Merlin-Arthur and Proofs Without Relative Phase</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.9">10.4230/LIPIcs.ITCS.2024.9</a>
</li>
<li>
<span class="authors">Gabriel Bathie and R. Ryan Williams</span>
<span class="title">Towards Stronger Depth Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.10">10.4230/LIPIcs.ITCS.2024.10</a>
</li>
<li>
<span class="authors">Omri Ben-Eliezer, Esty Kelman, Uri Meir, and Sofya Raskhodnikova</span>
<span class="title">Property Testing with Online Adversaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.11">10.4230/LIPIcs.ITCS.2024.11</a>
</li>
<li>
<span class="authors">Aaron Bernstein, Greg Bodwin, and Nicole Wein</span>
<span class="title">Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.12">10.4230/LIPIcs.ITCS.2024.12</a>
</li>
<li>
<span class="authors">Rajarshi Bhattacharjee, Gregory Dexter, Cameron Musco, Archan Ray, Sushant Sachdeva, and David P. Woodruff</span>
<span class="title">Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.13">10.4230/LIPIcs.ITCS.2024.13</a>
</li>
<li>
<span class="authors">Kaartik Bhushan, Venkata Koppula, and Manoj Prabhakaran</span>
<span class="title">Homomorphic Indistinguishability Obfuscation and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.14">10.4230/LIPIcs.ITCS.2024.14</a>
</li>
<li>
<span class="authors">Hadley Black, Eric Blais, and Nathaniel Harms</span>
<span class="title">Testing and Learning Convex Sets in the Ternary Hypercube</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.15">10.4230/LIPIcs.ITCS.2024.15</a>
</li>
<li>
<span class="authors">Keller Blackwell and Mary Wootters</span>
<span class="title">A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.16">10.4230/LIPIcs.ITCS.2024.16</a>
</li>
<li>
<span class="authors">Jarosław Błasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, and Preetum Nakkiran</span>
<span class="title">Loss Minimization Yields Multicalibration for Large Neural Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.17">10.4230/LIPIcs.ITCS.2024.17</a>
</li>
<li>
<span class="authors">Avrim Blum and Melissa Dutz</span>
<span class="title">Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.18">10.4230/LIPIcs.ITCS.2024.18</a>
</li>
<li>
<span class="authors">Greg Bodwin and Henry Fleischmann</span>
<span class="title">Spanning Adjacency Oracles in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.19">10.4230/LIPIcs.ITCS.2024.19</a>
</li>
<li>
<span class="authors">Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, and Jeroen Zuiddam</span>
<span class="title">Discreteness of Asymptotic Tensor Ranks (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.20">10.4230/LIPIcs.ITCS.2024.20</a>
</li>
<li>
<span class="authors">Jop Briët, Harry Buhrman, Davi Castro-Silva, and Niels M. P. Neumann</span>
<span class="title">Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.21">10.4230/LIPIcs.ITCS.2024.21</a>
</li>
<li>
<span class="authors">Karl Bringmann, Allan Grønlund, Marvin Künnemann, and Kasper Green Larsen</span>
<span class="title">The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.22">10.4230/LIPIcs.ITCS.2024.22</a>
</li>
<li>
<span class="authors">Clément L. Canonne and Yucheng Sun</span>
<span class="title">Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.23">10.4230/LIPIcs.ITCS.2024.23</a>
</li>
<li>
<span class="authors">Matthias C. Caro, Marcel Hinsche, Marios Ioannou, Alexander Nietner, and Ryan Sweke</span>
<span class="title">Classical Verification of Quantum Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.24">10.4230/LIPIcs.ITCS.2024.24</a>
</li>
<li>
<span class="authors">Pritam Chandra, Ankit Garg, Neeraj Kayal, Kunal Mittal, and Tanmay Sinha</span>
<span class="title">Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.25">10.4230/LIPIcs.ITCS.2024.25</a>
</li>
<li>
<span class="authors">Yi-Jun Chang</span>
<span class="title">The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.26">10.4230/LIPIcs.ITCS.2024.26</a>
</li>
<li>
<span class="authors">Abhranil Chatterjee, Mrinal Kumar, and Ben Lee Volk</span>
<span class="title">Determinants vs. Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.27">10.4230/LIPIcs.ITCS.2024.27</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay, Jesse Goodman, and Mohit Gurumukhani</span>
<span class="title">Extractors for Polynomial Sources over 𝔽₂</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.28">10.4230/LIPIcs.ITCS.2024.28</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay and Jyun-Jie Liao</span>
<span class="title">Recursive Error Reduction for Regular Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.29">10.4230/LIPIcs.ITCS.2024.29</a>
</li>
<li>
<span class="authors">Zongchen Chen and Elchanan Mossel</span>
<span class="title">Influence Maximization in Ising Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.30">10.4230/LIPIcs.ITCS.2024.30</a>
</li>
<li>
<span class="authors">Zhili Chen, Joshua A. Grochow, Youming Qiao, Gang Tang, and Chuanqi Zhang</span>
<span class="title">On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.31">10.4230/LIPIcs.ITCS.2024.31</a>
</li>
<li>
<span class="authors">Justin Y. Chen, Piotr Indyk, and David P. Woodruff</span>
<span class="title">Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.32">10.4230/LIPIcs.ITCS.2024.32</a>
</li>
<li>
<span class="authors">Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, and Rocco A. Servedio</span>
<span class="title">Testing Intersecting and Union-Closed Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.33">10.4230/LIPIcs.ITCS.2024.33</a>
</li>
<li>
<span class="authors">Alessandro Chiesa, Ziyi Guan, and Burcu Yıldız</span>
<span class="title">On Parallel Repetition of PCPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.34">10.4230/LIPIcs.ITCS.2024.34</a>
</li>
<li>
<span class="authors">Romain Cosson and Laurent Massoulié</span>
<span class="title">Collective Tree Exploration via Potential Function Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.35">10.4230/LIPIcs.ITCS.2024.35</a>
</li>
<li>
<span class="authors">Varsha Dani, Thomas P. Hayes, Seth Pettie, and Jared Saia</span>
<span class="title">Fraud Detection for Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.36">10.4230/LIPIcs.ITCS.2024.36</a>
</li>
<li>
<span class="authors">Constantinos Daskalakis, Noah Golowich, Nika Haghtalab, and Abhishek Shetty</span>
<span class="title">Smooth Nash Equilibria: Algorithms and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.37">10.4230/LIPIcs.ITCS.2024.37</a>
</li>
<li>
<span class="authors">Erik D. Demaine, Yael Kirkpatrick, and Rebecca Lin</span>
<span class="title">Graph Threading</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.38">10.4230/LIPIcs.ITCS.2024.38</a>
</li>
<li>
<span class="authors">Atanas Dinev and S. Matthew Weinberg</span>
<span class="title">Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.39">10.4230/LIPIcs.ITCS.2024.39</a>
</li>
<li>
<span class="authors">Nico Döttling and Tamer Mour</span>
<span class="title">On the Black-Box Complexity of Correlation Intractability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.40">10.4230/LIPIcs.ITCS.2024.40</a>
</li>
<li>
<span class="authors">Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson</span>
<span class="title">The Message Complexity of Distributed Graph Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.41">10.4230/LIPIcs.ITCS.2024.41</a>
</li>
<li>
<span class="authors">Fabien Dufoulon, Michael Moorman, William K. Moses Jr., and Gopal Pandurangan</span>
<span class="title">Time- and Communication-Efficient Overlay Network Construction via Gossip</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.42">10.4230/LIPIcs.ITCS.2024.42</a>
</li>
<li>
<span class="authors">Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, and Vladimir Lysikov</span>
<span class="title">Homogeneous Algebraic Complexity Theory and Algebraic Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.43">10.4230/LIPIcs.ITCS.2024.43</a>
</li>
<li>
<span class="authors">Tomer Ezra, Michal Feldman, and Maya Schlesinger</span>
<span class="title">On the (In)approximability of Combinatorial Contracts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.44">10.4230/LIPIcs.ITCS.2024.44</a>
</li>
<li>
<span class="authors">Yumou Fei, Leslie Ann Goldberg, and Pinyan Lu</span>
<span class="title">Two-State Spin Systems with Negative Interactions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.45">10.4230/LIPIcs.ITCS.2024.45</a>
</li>
<li>
<span class="authors">Rex Fernando, Yuval Gelles, and Ilan Komargodski</span>
<span class="title">Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.46">10.4230/LIPIcs.ITCS.2024.46</a>
</li>
<li>
<span class="authors">Renato Ferreira Pinto Jr. and Nathaniel Harms</span>
<span class="title">Distribution Testing with a Confused Collector</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.47">10.4230/LIPIcs.ITCS.2024.47</a>
</li>
<li>
<span class="authors">Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, and Marc Vinyals</span>
<span class="title">Proving Unsatisfiability with Hitting Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.48">10.4230/LIPIcs.ITCS.2024.48</a>
</li>
<li>
<span class="authors">Nick Fischer, Piotr Kaliciak, and Adam Polak</span>
<span class="title">Deterministic 3SUM-Hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.49">10.4230/LIPIcs.ITCS.2024.49</a>
</li>
<li>
<span class="authors">Lukáš Folwarczný, Mika Göös, Pavel Hubáček, Gilbert Maystre, and Weiqiang Yuan</span>
<span class="title">One-Way Functions vs. TFNP: Simpler and Improved</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.50">10.4230/LIPIcs.ITCS.2024.50</a>
</li>
<li>
<span class="authors">Rafael Frongillo, Maneesha Papireddygari, and Bo Waggoner</span>
<span class="title">An Axiomatic Characterization of CFMMs and Equivalence to Prediction Markets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.51">10.4230/LIPIcs.ITCS.2024.51</a>
</li>
<li>
<span class="authors">Haosen Ge, Hamsa Bastani, and Osbert Bastani</span>
<span class="title">Rethinking Fairness for Human-AI Collaboration (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.52">10.4230/LIPIcs.ITCS.2024.52</a>
</li>
<li>
<span class="authors">Prantar Ghosh and Vihan Shah</span>
<span class="title">New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.53">10.4230/LIPIcs.ITCS.2024.53</a>
</li>
<li>
<span class="authors">Louis Golowich and Tali Kaufman</span>
<span class="title">NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.54">10.4230/LIPIcs.ITCS.2024.54</a>
</li>
<li>
<span class="authors">Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan</span>
<span class="title">Electrical Flows for Polylogarithmic Competitive Oblivious Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.55">10.4230/LIPIcs.ITCS.2024.55</a>
</li>
<li>
<span class="authors">Mayank Goswami and Riko Jacob</span>
<span class="title">An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.56">10.4230/LIPIcs.ITCS.2024.56</a>
</li>
<li>
<span class="authors">Nika Haghtalab, Nicole Immorlica, Brendan Lucier, Markus Mobius, and Divyarthi Mohan</span>
<span class="title">Communicating with Anecdotes (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.57">10.4230/LIPIcs.ITCS.2024.57</a>
</li>
<li>
<span class="authors">Lianna Hambardzumyan, Toniann Pitassi, Suhail Sherif, Morgan Shirley, and Adi Shraibman</span>
<span class="title">An Improved Protocol for ExactlyN with More Than 3 Players</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.58">10.4230/LIPIcs.ITCS.2024.58</a>
</li>
<li>
<span class="authors">Jason Hartline and Aleck Johnsen</span>
<span class="title">Equivocal Blends: Prior Independent Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.59">10.4230/LIPIcs.ITCS.2024.59</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">The Chromatic Number of Kneser Hypergraphs via Consensus Division</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.60">10.4230/LIPIcs.ITCS.2024.60</a>
</li>
<li>
<span class="authors">Lisa Hellerstein, Naifeng Liu, and Kevin Schewior</span>
<span class="title">Quickly Determining Who Won an Election</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.61">10.4230/LIPIcs.ITCS.2024.61</a>
</li>
<li>
<span class="authors">Monika Henzinger, Barna Saha, Martin P. Seybold, and Christopher Ye</span>
<span class="title">On the Complexity of Algorithms with Predictions for Dynamic Graph Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.62">10.4230/LIPIcs.ITCS.2024.62</a>
</li>
<li>
<span class="authors">Pavel Hubáček, Erfan Khaniki, and Neil Thapen</span>
<span class="title">TFNP Intersections Through the Lens of Feasible Disjunction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.63">10.4230/LIPIcs.ITCS.2024.63</a>
</li>
<li>
<span class="authors">Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, and Saket Saurabh</span>
<span class="title">Exponential-Time Approximation Schemes via Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.64">10.4230/LIPIcs.ITCS.2024.64</a>
</li>
<li>
<span class="authors">Ragesh Jaiswal, Amit Kumar, and Jatin Yadav</span>
<span class="title">FPT Approximation for Capacitated Sum of Radii</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.65">10.4230/LIPIcs.ITCS.2024.65</a>
</li>
<li>
<span class="authors">Ce Jin, R. Ryan Williams, and Nathaniel Young</span>
<span class="title">A VLSI Circuit Model Accounting for Wire Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.66">10.4230/LIPIcs.ITCS.2024.66</a>
</li>
<li>
<span class="authors">Thomas Karam</span>
<span class="title">Small Sunflowers and the Structure of Slice Rank Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.67">10.4230/LIPIcs.ITCS.2024.67</a>
</li>
<li>
<span class="authors">Ari Karchmer</span>
<span class="title">Distributional PAC-Learning from Nisan’s Natural Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.68">10.4230/LIPIcs.ITCS.2024.68</a>
</li>
<li>
<span class="authors">Ohad Klein, Joseph Slote, Alexander Volberg, and Haonan Zhang</span>
<span class="title">Quantum and Classical Low-Degree Learning via a Dimension-Free Remez Inequality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.69">10.4230/LIPIcs.ITCS.2024.69</a>
</li>
<li>
<span class="authors">Weihao Kong, Mingda Qiao, and Rajat Sen</span>
<span class="title">A Combinatorial Approach to Robust PCA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.70">10.4230/LIPIcs.ITCS.2024.70</a>
</li>
<li>
<span class="authors">Euiwoong Lee and Pasin Manurangsi</span>
<span class="title">Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.71">10.4230/LIPIcs.ITCS.2024.71</a>
</li>
<li>
<span class="authors">Xingjian Li, Qipeng Liu, Angelos Pelecanos, and Takashi Yamakawa</span>
<span class="title">Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.72">10.4230/LIPIcs.ITCS.2024.72</a>
</li>
<li>
<span class="authors">Minming Li, Peter Robinson, and Xianbin Zhu</span>
<span class="title">Dynamic Maximal Matching in Clique Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.73">10.4230/LIPIcs.ITCS.2024.73</a>
</li>
<li>
<span class="authors">Yuhao Li, William Pires, and Robert Robere</span>
<span class="title">Intersection Classes in TFNP and Proof Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.74">10.4230/LIPIcs.ITCS.2024.74</a>
</li>
<li>
<span class="authors">Jiawei Li</span>
<span class="title">Total NP Search Problems with Abundant Solutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.75">10.4230/LIPIcs.ITCS.2024.75</a>
</li>
<li>
<span class="authors">Roi Livni</span>
<span class="title">Making Progress Based on False Discoveries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.76">10.4230/LIPIcs.ITCS.2024.76</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Kernelization of Counting Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.77">10.4230/LIPIcs.ITCS.2024.77</a>
</li>
<li>
<span class="authors">Baptiste Louf, Colin McDiarmid, and Fiona Skerman</span>
<span class="title">Modularity and Graph Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.78">10.4230/LIPIcs.ITCS.2024.78</a>
</li>
<li>
<span class="authors">Arvind V. Mahankali, David P. Woodruff, and Ziyu Zhang</span>
<span class="title">Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.79">10.4230/LIPIcs.ITCS.2024.79</a>
</li>
<li>
<span class="authors">Noam Mazor and Rafael Pass</span>
<span class="title">The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.80">10.4230/LIPIcs.ITCS.2024.80</a>
</li>
<li>
<span class="authors">Jason Milionis, Ciamac C. Moallemi, and Tim Roughgarden</span>
<span class="title">A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.81">10.4230/LIPIcs.ITCS.2024.81</a>
</li>
<li>
<span class="authors">Barak Nehoran and Mark Zhandry</span>
<span class="title">A Computational Separation Between Quantum No-Cloning and No-Telegraphing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.82">10.4230/LIPIcs.ITCS.2024.82</a>
</li>
<li>
<span class="authors">Ofer Neiman and Idan Shabat</span>
<span class="title">On the Size Overhead of Pairwise Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.83">10.4230/LIPIcs.ITCS.2024.83</a>
</li>
<li>
<span class="authors">Rian Neogi, Kanstantsin Pashkovich, and Chaitanya Swamy</span>
<span class="title">Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.84">10.4230/LIPIcs.ITCS.2024.84</a>
</li>
<li>
<span class="authors">Aleksandar Nikolov and Haohua Tang</span>
<span class="title">General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.85">10.4230/LIPIcs.ITCS.2024.85</a>
</li>
<li>
<span class="authors">Charlotte Out, Nicolás Rivera, Thomas Sauerwald, and John Sylvester</span>
<span class="title">Rumors with Changing Credibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.86">10.4230/LIPIcs.ITCS.2024.86</a>
</li>
<li>
<span class="authors">Shir Peleg, Amir Shpilka, and Ben Lee Volk</span>
<span class="title">Tensor Reconstruction Beyond Constant Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.87">10.4230/LIPIcs.ITCS.2024.87</a>
</li>
<li>
<span class="authors">Asaf Petruschka, Shay Sapir, and Elad Tzalik</span>
<span class="title">Color Fault-Tolerant Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.88">10.4230/LIPIcs.ITCS.2024.88</a>
</li>
<li>
<span class="authors">Kevin Pratt</span>
<span class="title">On Generalized Corners and Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.89">10.4230/LIPIcs.ITCS.2024.89</a>
</li>
<li>
<span class="authors">Aaron (Louie) Putterman and Edward Pyne</span>
<span class="title">Pseudorandom Linear Codes Are List-Decodable to Capacity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.90">10.4230/LIPIcs.ITCS.2024.90</a>
</li>
<li>
<span class="authors">C. Ramya and Pratik Shastri</span>
<span class="title">Lower Bounds for Planar Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.91">10.4230/LIPIcs.ITCS.2024.91</a>
</li>
<li>
<span class="authors">Joseph Slote</span>
<span class="title">Parity vs. AC0 with Simple Quantum Preprocessing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.92">10.4230/LIPIcs.ITCS.2024.92</a>
</li>
<li>
<span class="authors">Zhao Song, Lichen Zhang, and Ruizhe Zhang</span>
<span class="title">Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.93">10.4230/LIPIcs.ITCS.2024.93</a>
</li>
<li>
<span class="authors">Teresa Anna Steiner</span>
<span class="title">Differentially Private Approximate Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.94">10.4230/LIPIcs.ITCS.2024.94</a>
</li>
<li>
<span class="authors">Iddo Tzameret and Lu-Ming Zhang</span>
<span class="title">Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.95">10.4230/LIPIcs.ITCS.2024.95</a>
</li>
<li>
<span class="authors">Gregory Valiant</span>
<span class="title">Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.96">10.4230/LIPIcs.ITCS.2024.96</a>
</li>
<li>
<span class="authors">Adam Bene Watts and John Bostanci</span>
<span class="title">Quantum Event Learning and Gentle Random Measurements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.97">10.4230/LIPIcs.ITCS.2024.97</a>
</li>
<li>
<span class="authors">Ke Wu, Elaine Shi, and Hao Chung</span>
<span class="title">Maximizing Miner Revenue in Transaction Fee Mechanism Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.98">10.4230/LIPIcs.ITCS.2024.98</a>
</li>
<li>
<span class="authors">Huacheng Yu and Wei Zhan</span>
<span class="title">Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.99">10.4230/LIPIcs.ITCS.2024.99</a>
</li>
<li>
<span class="authors">Huacheng Yu and Wei Zhan</span>
<span class="title">Sampling, Flowers and Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.100">10.4230/LIPIcs.ITCS.2024.100</a>
</li>
<li>
<span class="authors">Mark Zhandry</span>
<span class="title">Quantum Money from Abelian Group Actions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.101">10.4230/LIPIcs.ITCS.2024.101</a>
</li>
<li>
<span class="authors">Mark Zhandry</span>
<span class="title">The Space-Time Cost of Purifying Quantum Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.102">10.4230/LIPIcs.ITCS.2024.102</a>
</li>
<li>
<span class="authors">Mingxun Zhou, Mengshi Zhao, T-H. Hubert Chan, and Elaine Shi</span>
<span class="title">Advanced Composition Theorems for Differential Obliviousness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2024.103">10.4230/LIPIcs.ITCS.2024.103</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