LIPIcs, Volume 325, ITCS 2025

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