<h2>LIPIcs, Volume 325, ITCS 2025</h2>
<ul>
<li>
<span class="authors">Raghu Meka</span>
<span class="title">LIPIcs, Volume 325, ITCS 2025, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025">10.4230/LIPIcs.ITCS.2025</a>
</li>
<li>
<span class="authors">Raghu Meka</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.0">10.4230/LIPIcs.ITCS.2025.0</a>
</li>
<li>
<span class="authors">Ittai Abraham, Gilad Asharov, and Anirudh Chandramouli</span>
<span class="title">Simple Is COOL: Graded Dispersal and Its Applications for Byzantine Fault Tolerance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.1">10.4230/LIPIcs.ITCS.2025.1</a>
</li>
<li>
<span class="authors">Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, and Sidhant Saraogi</span>
<span class="title">Improved Lower Bounds for 3-Query Matching Vector Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.2">10.4230/LIPIcs.ITCS.2025.2</a>
</li>
<li>
<span class="authors">Josh Alman, Arkadev Chattopadhyay, and Ryan Williams</span>
<span class="title">Sparsity Lower Bounds for Probabilistic Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.3">10.4230/LIPIcs.ITCS.2025.3</a>
</li>
<li>
<span class="authors">Noga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, Hongao Wang, S. Matthew Weinberg, and Qianfan Zhang</span>
<span class="title">A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.4">10.4230/LIPIcs.ITCS.2025.4</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Benoît Groz, and Nicole Wein</span>
<span class="title">Edge-Minimum Walk of Modular Length in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.5">10.4230/LIPIcs.ITCS.2025.5</a>
</li>
<li>
<span class="authors">Noga Amir, Oded Goldreich, and Guy N. Rothblum</span>
<span class="title">Doubly Sub-Linear Interactive Proofs of Proximity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.6">10.4230/LIPIcs.ITCS.2025.6</a>
</li>
<li>
<span class="authors">Prabhanjan Ananth, Fatih Kaleoglu, and Henry Yuen</span>
<span class="title">Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.7">10.4230/LIPIcs.ITCS.2025.7</a>
</li>
<li>
<span class="authors">Petia Arabadjieva, Alexandru Gheorghiu, Victor Gitton, and Tony Metger</span>
<span class="title">Single-Round Proofs of Quantumness from Knowledge Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.8">10.4230/LIPIcs.ITCS.2025.8</a>
</li>
<li>
<span class="authors">Itai Arad and Miklos Santha</span>
<span class="title">The Local Hamiltonian Problem for Quasi-Quantum States: A Toy Model for the Quantum PCP Conjecture (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.9">10.4230/LIPIcs.ITCS.2025.9</a>
</li>
<li>
<span class="authors">Eshwar Ram Arunachaleswaran, Natalie Collina, Sampath Kannan, Aaron Roth, and Juba Ziani</span>
<span class="title">Algorithmic Collusion Without Threats</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.10">10.4230/LIPIcs.ITCS.2025.10</a>
</li>
<li>
<span class="authors">Vahid R. Asadi, Eric Culf, and Alex May</span>
<span class="title">Rank Lower Bounds on Non-Local Quantum Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.11">10.4230/LIPIcs.ITCS.2025.11</a>
</li>
<li>
<span class="authors">Itai Ashlagi, Jiale Chen, Mohammad Roghani, and Amin Saberi</span>
<span class="title">Stable Matching with Interviews</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.12">10.4230/LIPIcs.ITCS.2025.12</a>
</li>
<li>
<span class="authors">Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, and Nicole Wein</span>
<span class="title">Low Sensitivity Hopsets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.13">10.4230/LIPIcs.ITCS.2025.13</a>
</li>
<li>
<span class="authors">Huck Bennett, Surendra Ghentiyala, and Noah Stephens-Davidowitz</span>
<span class="title">The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.14">10.4230/LIPIcs.ITCS.2025.14</a>
</li>
<li>
<span class="authors">Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, and Saket Saurabh</span>
<span class="title">Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.15">10.4230/LIPIcs.ITCS.2025.15</a>
</li>
<li>
<span class="authors">Thiago Bergamaschi and Yunchao Liu</span>
<span class="title">On Fault Tolerant Single-Shot Logical State Preparation and Robust Long-Range Entanglement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.16">10.4230/LIPIcs.ITCS.2025.16</a>
</li>
<li>
<span class="authors">Sreejata Kishor Bhattacharya</span>
<span class="title">Random Restrictions of Bounded Low Degree Polynomials Are Juntas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.17">10.4230/LIPIcs.ITCS.2025.17</a>
</li>
<li>
<span class="authors">Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, and Chris Umans</span>
<span class="title">Finite Matrix Multiplication Algorithms from Infinite Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.18">10.4230/LIPIcs.ITCS.2025.18</a>
</li>
<li>
<span class="authors">Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, and Tamalika Mukherjee</span>
<span class="title">Differential Privacy and Sublinear Time Are Incompatible Sometimes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.19">10.4230/LIPIcs.ITCS.2025.19</a>
</li>
<li>
<span class="authors">Andrej Bogdanov and Lorenzo Taschin</span>
<span class="title">Estimating Euclidean Distance to Linearity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.20">10.4230/LIPIcs.ITCS.2025.20</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Julien Duron, John Sylvester, and Viktor Zamaraev</span>
<span class="title">Adjacency Labeling Schemes for Small Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.21">10.4230/LIPIcs.ITCS.2025.21</a>
</li>
<li>
<span class="authors">Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, and Zhijun Zhang</span>
<span class="title">Round-Vs-Resilience Tradeoffs for Binary Feedback Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.22">10.4230/LIPIcs.ITCS.2025.22</a>
</li>
<li>
<span class="authors">Benedikt Bünz, Pratyush Mishra, Wilson Nguyen, and William Wang</span>
<span class="title">Accumulation Without Homomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.23">10.4230/LIPIcs.ITCS.2025.23</a>
</li>
<li>
<span class="authors">Evan Camrud, Ewan Davies, Alex Karduna, and Holden Lee</span>
<span class="title">Sampling List Packings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.24">10.4230/LIPIcs.ITCS.2025.24</a>
</li>
<li>
<span class="authors">Clément L. Canonne and Abigail Gentle</span>
<span class="title">Locally Private Histograms in All Privacy Regimes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.25">10.4230/LIPIcs.ITCS.2025.25</a>
</li>
<li>
<span class="authors">Clément L. Canonne, Sayantan Sen, and Joy Qiping Yang</span>
<span class="title">Settling the Complexity of Testing Grainedness of Distributions, and Application to Uniformity Testing in the Huge Object Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.26">10.4230/LIPIcs.ITCS.2025.26</a>
</li>
<li>
<span class="authors">Clément L. Canonne, Francis E. Su, and Salil P. Vadhan</span>
<span class="title">The Randomness Complexity of Differential Privacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.27">10.4230/LIPIcs.ITCS.2025.27</a>
</li>
<li>
<span class="authors">Amir Carmel, Chengzhi Guo, Shaofeng H.-C. Jiang, and Robert Krauthgamer</span>
<span class="title">Coresets for 1-Center in 𝓁₁ Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.28">10.4230/LIPIcs.ITCS.2025.28</a>
</li>
<li>
<span class="authors">Yair Carmon, Arun Jambulapati, Liam O'Carroll, and Aaron Sidford</span>
<span class="title">Extracting Dual Solutions via Primal Optimizers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.29">10.4230/LIPIcs.ITCS.2025.29</a>
</li>
<li>
<span class="authors">Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira, and Dimitrios Tsintsilidas</span>
<span class="title">Provability of the Circuit Size Hierarchy and Its Consequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.30">10.4230/LIPIcs.ITCS.2025.30</a>
</li>
<li>
<span class="authors">Joseph Carolan, Amin Shiraz Gilani, and Mahathi Vempati</span>
<span class="title">Quantum Advantage and Lower Bounds in Parallel Query Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.31">10.4230/LIPIcs.ITCS.2025.31</a>
</li>
<li>
<span class="authors">Joseph Carolan and Luke Schaeffer</span>
<span class="title">Succinct Fermion Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.32">10.4230/LIPIcs.ITCS.2025.32</a>
</li>
<li>
<span class="authors">Ulysse Chabaud, Michael Joseph, Saeed Mehraban, and Arsalan Motamedi</span>
<span class="title">Bosonic Quantum Computational Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.33">10.4230/LIPIcs.ITCS.2025.33</a>
</li>
<li>
<span class="authors">Deeparnab Chakrabarty and C. Seshadhri</span>
<span class="title">Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.34">10.4230/LIPIcs.ITCS.2025.34</a>
</li>
<li>
<span class="authors">T-H. Hubert Chan and Quan Xue</span>
<span class="title">Unraveling Universally Closest Refinements via Symmetric Density Decomposition and Fisher Market Equilibrium</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.35">10.4230/LIPIcs.ITCS.2025.35</a>
</li>
<li>
<span class="authors">Yudong Chen, Xumei Xi, and Christina Lee Yu</span>
<span class="title">Entry-Specific Matrix Estimation Under Arbitrary Sampling Patterns Through the Lens of Network Flows (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.36">10.4230/LIPIcs.ITCS.2025.36</a>
</li>
<li>
<span class="authors">Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, and Morgan Shirley</span>
<span class="title">A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.37">10.4230/LIPIcs.ITCS.2025.37</a>
</li>
<li>
<span class="authors">Paul Christiano, Jacob Hilton, Victor Lecomte, and Mark Xu</span>
<span class="title">Backdoor Defense, Learnability and Obfuscation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.38">10.4230/LIPIcs.ITCS.2025.38</a>
</li>
<li>
<span class="authors">Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, and Eliad Tsfadia</span>
<span class="title">Data Reconstruction: When You See It and When You Don't</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.39">10.4230/LIPIcs.ITCS.2025.39</a>
</li>
<li>
<span class="authors">Gil Cohen, Itay Cohen, Gal Maor, and Yuval Peled</span>
<span class="title">Derandomized Squaring: An Analytical Insight into Its True Behavior</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.40">10.4230/LIPIcs.ITCS.2025.40</a>
</li>
<li>
<span class="authors">Mahsa Derakhshan, Mohammad Saneian, and Zhiyang Xun</span>
<span class="title">Query Complexity of Stochastic Minimum Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.41">10.4230/LIPIcs.ITCS.2025.41</a>
</li>
<li>
<span class="authors">Mason DiCicco, Vladimir Podolskii, and Daniel Reichman</span>
<span class="title">Nearest Neighbor Complexity and Boolean Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.42">10.4230/LIPIcs.ITCS.2025.42</a>
</li>
<li>
<span class="authors">Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, and David P. Woodruff</span>
<span class="title">Space Complexity of Minimum Cut Problems in Single-Pass Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.43">10.4230/LIPIcs.ITCS.2025.43</a>
</li>
<li>
<span class="authors">Yinhao Dong, Pan Peng, and Ali Vakilian</span>
<span class="title">Learning-Augmented Streaming Algorithms for Approximating MAX-CUT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.44">10.4230/LIPIcs.ITCS.2025.44</a>
</li>
<li>
<span class="authors">Jinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann</span>
<span class="title">Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.45">10.4230/LIPIcs.ITCS.2025.45</a>
</li>
<li>
<span class="authors">Marina Drygala, Silvio Lattanzi, Andreas Maggiori, Miltiadis Stouras, Ola Svensson, and Sergei Vassilvitskii</span>
<span class="title">Data-Driven Solution Portfolios</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.46">10.4230/LIPIcs.ITCS.2025.46</a>
</li>
<li>
<span class="authors">Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, and Renata Valieva</span>
<span class="title">Concentration of Submodular Functions and Read-k Families Under Negative Dependence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.47">10.4230/LIPIcs.ITCS.2025.47</a>
</li>
<li>
<span class="authors">Naveen Durvasula and Tim Roughgarden</span>
<span class="title">Robust Restaking Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.48">10.4230/LIPIcs.ITCS.2025.48</a>
</li>
<li>
<span class="authors">Yiding Feng and Wei Tang</span>
<span class="title">Confusion Matrix Design for Downstream Decision-Making (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.49">10.4230/LIPIcs.ITCS.2025.49</a>
</li>
<li>
<span class="authors">Marten Folkertsma, Ian Mertz, Florian Speelman, and Quinten Tupker</span>
<span class="title">Fully Characterizing Lossy Catalytic Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.50">10.4230/LIPIcs.ITCS.2025.50</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Parameterized Geometric Graph Modification with Disk Scaling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.51">10.4230/LIPIcs.ITCS.2025.51</a>
</li>
<li>
<span class="authors">Aadityan Ganesh and Jason Hartline</span>
<span class="title">Combinatorial Pen Testing (Or Consumer Surplus of Deferred-Acceptance Auctions)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.52">10.4230/LIPIcs.ITCS.2025.52</a>
</li>
<li>
<span class="authors">Badih Ghazi, Ravi Kumar, Pasin Manurangsi, and Serena Wang</span>
<span class="title">Differential Privacy on Trust Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.53">10.4230/LIPIcs.ITCS.2025.53</a>
</li>
<li>
<span class="authors">Ludmila Glinskih and Artur Riazanov</span>
<span class="title">Partial Minimum Branching Program Size Problem Is ETH-Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.54">10.4230/LIPIcs.ITCS.2025.54</a>
</li>
<li>
<span class="authors">Geri Gokaj and Marvin Künnemann</span>
<span class="title">Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Linear Integer Arithmetic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.55">10.4230/LIPIcs.ITCS.2025.55</a>
</li>
<li>
<span class="authors">Rishab Goyal, Venkata Koppula, Mahesh Sreekumar Rajasree, and Aman Verma</span>
<span class="title">Incompressible Functional Encryption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.56">10.4230/LIPIcs.ITCS.2025.56</a>
</li>
<li>
<span class="authors">Heng Guo and Vishvajeet N</span>
<span class="title">Deterministic Approximation for the Volume of the Truncated Fractional Matching Polytope</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.57">10.4230/LIPIcs.ITCS.2025.57</a>
</li>
<li>
<span class="authors">Shreya Gupta, Boyang Huang, Russell Impagliazzo, Stanley Woo, and Christopher Ye</span>
<span class="title">The Computational Complexity of Factored Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.58">10.4230/LIPIcs.ITCS.2025.58</a>
</li>
<li>
<span class="authors">Meghal Gupta and Rachel Yun Zhang</span>
<span class="title">Error Correction for Message Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.59">10.4230/LIPIcs.ITCS.2025.59</a>
</li>
<li>
<span class="authors">Meghal Gupta and Rachel Yun Zhang</span>
<span class="title">List Decoding Bounds for Binary Codes with Noiseless Feedback</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.60">10.4230/LIPIcs.ITCS.2025.60</a>
</li>
<li>
<span class="authors">Neng Huang, Will Perkins, and Aaron Potechin</span>
<span class="title">Hardness of Sampling for the Anti-Ferromagnetic Ising Model on Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.61">10.4230/LIPIcs.ITCS.2025.61</a>
</li>
<li>
<span class="authors">Antoine Joux and Anand Kumar Narayanan</span>
<span class="title">A High Dimensional Cramer’s Rule Connecting Homogeneous Multilinear Equations to Hyperdeterminants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.62">10.4230/LIPIcs.ITCS.2025.62</a>
</li>
<li>
<span class="authors">John Kallaugher, Ojas Parekh, Kevin Thompson, Yipu Wang, and Justin Yirka</span>
<span class="title">Complexity Classification of Product State Problems for Local Hamiltonians</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.63">10.4230/LIPIcs.ITCS.2025.63</a>
</li>
<li>
<span class="authors">Petteri Kaski and Mateusz Michałek</span>
<span class="title">A Universal Sequence of Tensors for the Asymptotic Rank Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.64">10.4230/LIPIcs.ITCS.2025.64</a>
</li>
<li>
<span class="authors">Esty Kelman, Ephraim Linder, and Sofya Raskhodnikova</span>
<span class="title">Online Versus Offline Adversaries in Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.65">10.4230/LIPIcs.ITCS.2025.65</a>
</li>
<li>
<span class="authors">Christian Konrad, Conor O'Sullivan, and Victor Traistaru</span>
<span class="title">Graph Reconstruction via MIS Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.66">10.4230/LIPIcs.ITCS.2025.66</a>
</li>
<li>
<span class="authors">Swastik Kopparty, Aditya Potukuchi, and Harry Sha</span>
<span class="title">Error-Correcting Graph Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.67">10.4230/LIPIcs.ITCS.2025.67</a>
</li>
<li>
<span class="authors">Vinayak M. Kumar</span>
<span class="title">New Pseudorandom Generators and Correlation Bounds Using Extractors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.68">10.4230/LIPIcs.ITCS.2025.68</a>
</li>
<li>
<span class="authors">Nicholas LaRacuente and Felix Leditzky</span>
<span class="title">Approximate Unitary k-Designs from Shallow, Low-Communication Circuits (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.69">10.4230/LIPIcs.ITCS.2025.69</a>
</li>
<li>
<span class="authors">Euiwoong Lee and Kijun Shin</span>
<span class="title">Facility Location on High-Dimensional Euclidean Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.70">10.4230/LIPIcs.ITCS.2025.70</a>
</li>
<li>
<span class="authors">Longcheng Li, Qian Li, Xingjian Li, and Qipeng Liu</span>
<span class="title">Toward the Impossibility of Perfect Complete Quantum PKE from OWFs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.71">10.4230/LIPIcs.ITCS.2025.71</a>
</li>
<li>
<span class="authors">Tao Lin and Ce Li</span>
<span class="title">Information Design with Unknown Prior (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.72">10.4230/LIPIcs.ITCS.2025.72</a>
</li>
<li>
<span class="authors">Yanyi Liu, Noam Mazor, and Rafael Pass</span>
<span class="title">On White-Box Learning and Public-Key Encryption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.73">10.4230/LIPIcs.ITCS.2025.73</a>
</li>
<li>
<span class="authors">Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, and Ali Vakilian</span>
<span class="title">Sublinear Metric Steiner Tree via Improved Bounds for Set Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.74">10.4230/LIPIcs.ITCS.2025.74</a>
</li>
<li>
<span class="authors">Xinyu Mao, Guangxu Yang, and Jiapeng Zhang</span>
<span class="title">Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.75">10.4230/LIPIcs.ITCS.2025.75</a>
</li>
<li>
<span class="authors">Hamoon Mousavi and Taro Spirig</span>
<span class="title">A Quantum Unique Games Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.76">10.4230/LIPIcs.ITCS.2025.76</a>
</li>
<li>
<span class="authors">Seth Pettie and Dingyu Wang</span>
<span class="title">Sketching, Moment Estimation, and the Lévy-Khintchine Representation Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.77">10.4230/LIPIcs.ITCS.2025.77</a>
</li>
<li>
<span class="authors">Vladimir Podolskii and Alexander Shekhovtsov</span>
<span class="title">Randomized Lifting to Semi-Structured Communication Complexity via Linear Diversity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.78">10.4230/LIPIcs.ITCS.2025.78</a>
</li>
<li>
<span class="authors">Edward Pyne, Nathan S. Sheffield, and William Wang</span>
<span class="title">Catalytic Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.79">10.4230/LIPIcs.ITCS.2025.79</a>
</li>
<li>
<span class="authors">Yuval Rabani, Leonard J. Schulman, and Alistair Sinclair</span>
<span class="title">Diversity in Evolutionary Dynamics (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.80">10.4230/LIPIcs.ITCS.2025.80</a>
</li>
<li>
<span class="authors">Rajmohan Rajaraman and Omer Wasim</span>
<span class="title">Online Balanced Allocation of Dynamic Components</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.81">10.4230/LIPIcs.ITCS.2025.81</a>
</li>
<li>
<span class="authors">Nicolas Resch, Chen Yuan, and Yihan Zhang</span>
<span class="title">Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.82">10.4230/LIPIcs.ITCS.2025.82</a>
</li>
<li>
<span class="authors">Lars Rohwedder and Karol Węgrzycki</span>
<span class="title">Fine-Grained Equivalence for Problems Related to Integer Linear Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.83">10.4230/LIPIcs.ITCS.2025.83</a>
</li>
<li>
<span class="authors">Aviad Rubinstein and Zixin Zhou</span>
<span class="title">Quantum Communication Complexity of Classical Auctions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.84">10.4230/LIPIcs.ITCS.2025.84</a>
</li>
<li>
<span class="authors">Dorian Rudolph, Sevag Gharibian, and Daniel Nagaj</span>
<span class="title">Quantum 2-SAT on Low Dimensional Systems Is QMAsubscript{1}-Complete: Direct Embeddings and Black-Box Simulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.85">10.4230/LIPIcs.ITCS.2025.85</a>
</li>
<li>
<span class="authors">Shuai Shao and Zhuxiao Tang</span>
<span class="title">Eulerian Orientations and Hadamard Codes: A Novel Connection via Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.86">10.4230/LIPIcs.ITCS.2025.86</a>
</li>
<li>
<span class="authors">Nathan S. Sheffield and Alek Westover</span>
<span class="title">When to Give up on a Parallel Implementation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.87">10.4230/LIPIcs.ITCS.2025.87</a>
</li>
<li>
<span class="authors">Jad Silbak and Daniel Wichs</span>
<span class="title">Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.88">10.4230/LIPIcs.ITCS.2025.88</a>
</li>
<li>
<span class="authors">Janani Sundaresan</span>
<span class="title">Optimal Communication Complexity of Chained Index</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.89">10.4230/LIPIcs.ITCS.2025.89</a>
</li>
<li>
<span class="authors">Yael Tauman Kalai and Raghuvansh R. Saxena</span>
<span class="title">Polynomial Size, Short-Circuit Resilient Circuits for NC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.90">10.4230/LIPIcs.ITCS.2025.90</a>
</li>
<li>
<span class="authors">Madhur Tulsiani and June Wu</span>
<span class="title">Simple Norm Bounds for Polynomial Random Matrices via Decoupling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.91">10.4230/LIPIcs.ITCS.2025.91</a>
</li>
<li>
<span class="authors">Virginia Vassilevska Williams and Alek Westover</span>
<span class="title">Listing 6-Cycles in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.92">10.4230/LIPIcs.ITCS.2025.92</a>
</li>
<li>
<span class="authors">S. Venkitesh</span>
<span class="title">Polynomials, Divided Differences, and Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.93">10.4230/LIPIcs.ITCS.2025.93</a>
</li>
<li>
<span class="authors">Alek Westover, Edward Yu, and Kai Zhe Zheng</span>
<span class="title">New Direct Sum Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.94">10.4230/LIPIcs.ITCS.2025.94</a>
</li>
<li>
<span class="authors">Mark Zhandry</span>
<span class="title">Toward Separating QMA from QCMA with a Classical Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.95">10.4230/LIPIcs.ITCS.2025.95</a>
</li>
<li>
<span class="authors">Jiayu Zhang</span>
<span class="title">Formulations and Constructions of Remote State Preparation with Verifiability, with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITCS.2025.96">10.4230/LIPIcs.ITCS.2025.96</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