Table of Contents

• Derandomized Squaring: An Analytical Insight into Its True BehaviorGil Cohen, Itay Cohen 0003, Gal Maor, Yuval Peled. [doi]
• Round-Vs-Resilience Tradeoffs for Binary Feedback ChannelsMark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang 0007. [doi]
• Complexity Classification of Product State Problems for Local HamiltoniansJohn Kallaugher, Ojas Parekh, Kevin Thompson 0007, Yipu Wang, Justin Yirka. [doi]
• Data Reconstruction: When You See It and When You Don'tEdith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia. [doi]
• Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer ChasingXinyu Mao, Guangxu Yang, Jiapeng Zhang. [doi]
• Locally Private Histograms in All Privacy RegimesClément L. Canonne, Abigail Gentle. [doi]
• Query Complexity of Stochastic Minimum Vertex CoverMahsa Derakhshan, Mohammad Saneian, Zhiyang Xun. [doi]
• Accumulation Without HomomorphismBenedikt Bünz, Pratyush Mishra, Wilson Nguyen, William Wang. [doi]
• On Fault Tolerant Single-Shot Logical State Preparation and Robust Long-Range EntanglementThiago Bergamaschi, Yunchao Liu. [doi]
• Toward the Impossibility of Perfect Complete Quantum PKE from OWFsLongcheng Li, Qian Li, Xingjian Li 0006, Qipeng Liu 0001. [doi]
• Information Design with Unknown Prior (Extended Abstract)Tao Lin, Ce Li. [doi]
• Online Balanced Allocation of Dynamic ComponentsRajmohan Rajaraman, Omer Wasim. [doi]
• A Lower Bound on the Trace Norm of Boolean Matrices and Its ApplicationsTsun Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley. [doi]
• Formulations and Constructions of Remote State Preparation with Verifiability, with ApplicationsJiayu Zhang. [doi]
• Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity TestingDeeparnab Chakrabarty, C. Seshadhri 0001. [doi]
• A Quantum Unique Games ConjectureHamoon Mousavi, Taro Spirig. [doi]
• Provability of the Circuit Size Hierarchy and Its ConsequencesMarco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira, Dimitrios Tsintsilidas. [doi]
• Tight Bounds on List-Decodable and List-Recoverable Zero-Rate CodesNicolas Resch, Chen Yuan 0003, Yihan Zhang 0001. [doi]
• Random Restrictions of Bounded Low Degree Polynomials Are JuntasSreejata Kishor Bhattacharya. [doi]
• Sparsity Lower Bounds for Probabilistic PolynomialsJosh Alman, Arkadev Chattopadhyay, Ryan Williams 0001. [doi]
• Stable Matching with InterviewsItai Ashlagi, Jiale Chen 0003, Mohammad Roghani, Amin Saberi. [doi]
• Low Sensitivity HopsetsVikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao 0001, Nicole Wein. [doi]
• Differential Privacy on Trust GraphsBadih Ghazi, Ravi Kumar 0001, Pasin Manurangsi, Serena Wang 0001. [doi]
• Nearest Neighbor Complexity and Boolean CircuitsMason DiCicco, Vladimir Podolskii 0001, Daniel Reichman 0001. [doi]
• Approximate Unitary k-Designs from Shallow, Low-Communication Circuits (Extended Abstract)Nicholas LaRacuente, Felix Leditzky. [doi]
• Eulerian Orientations and Hadamard Codes: A Novel Connection via CountingShuai Shao 0001, Zhuxiao Tang. [doi]
• Simple Norm Bounds for Polynomial Random Matrices via DecouplingMadhur Tulsiani, June Wu. [doi]
• Single-Round Proofs of Quantumness from Knowledge AssumptionsPetia Arabadjieva, Alexandru Gheorghiu, Victor Gitton, Tony Metger. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Improved Lower Bounds for 3-Query Matching Vector CodesDivesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi. [doi]
• Settling the Complexity of Testing Grainedness of Distributions, and Application to Uniformity Testing in the Huge Object ModelClément L. Canonne, Sayantan Sen, Joy Qiping Yang. [doi]
• The Randomness Complexity of Differential PrivacyClément L. Canonne, Francis E. Su, Salil P. Vadhan. [doi]
• Quantum Communication Complexity of Classical AuctionsAviad Rubinstein, Zixin Zhou. [doi]
• Listing 6-Cycles in Sparse GraphsVirginia Vassilevska Williams, Alek Westover. [doi]
• Bosonic Quantum Computational ComplexityUlysse Chabaud, Michael Joseph, Saeed Mehraban, Arsalan Motamedi. [doi]
• The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding MulticollisionsHuck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz. [doi]
• Polynomial Size, Short-Circuit Resilient Circuits for NCYael Tauman Kalai, Raghuvansh R. Saxena. [doi]
• Combinatorial Pen Testing (Or Consumer Surplus of Deferred-Acceptance Auctions)Aadityan Ganesh, Jason D. Hartline. [doi]
• Learning-Augmented Streaming Algorithms for Approximating MAX-CUTYinhao Dong, Pan Peng 0001, Ali Vakilian. [doi]
• A Universal Sequence of Tensors for the Asymptotic Rank ConjecturePetteri Kaski, Mateusz Michalek. [doi]
• Diversity in Evolutionary Dynamics (Extended Abstract)Yuval Rabani, Leonard J. Schulman, Alistair Sinclair. [doi]
• Estimating Euclidean Distance to LinearityAndrej Bogdanov, Lorenzo Taschin. [doi]
• Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal AssumptionsJad Silbak, Daniel Wichs. [doi]
• Rank Lower Bounds on Non-Local Quantum ComputationVahid R. Asadi, Eric Culf, Alex May 0003. [doi]
• Deterministic Approximation for the Volume of the Truncated Fractional Matching PolytopeHeng Guo 0001, Vishvajeet N. [doi]
• Entry-Specific Matrix Estimation Under Arbitrary Sampling Patterns Through the Lens of Network Flows (Extended Abstract)Yudong Chen 0001, Xumei Xi, Christina Lee Yu. [doi]
• Finite Matrix Multiplication Algorithms from Infinite GroupsJonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, Chris Umans. [doi]
• Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Linear Integer ArithmeticGeri Gokaj, Marvin Künnemann. [doi]
• Toward Separating QMA from QCMA with a Classical OracleMark Zhandry. [doi]
• New Pseudorandom Generators and Correlation Bounds Using ExtractorsVinayak M. Kumar. [doi]
• A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid UnionsNoga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, Hongao Wang, S. Matthew Weinberg, Qianfan Zhang 0002. [doi]
• Fully Characterizing Lossy Catalytic ComputationMarten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker. [doi]
• Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted GraphsJinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, Julian Werthmann. [doi]
• Doubly Sub-Linear Interactive Proofs of ProximityNoga Amir, Oded Goldreich 0001, Guy N. Rothblum. [doi]
• Algorithmic Collusion Without ThreatsEshwar Ram Arunachaleswaran, Natalie Collina, Sampath Kannan, Aaron Roth 0001, Juba Ziani. [doi]
• Randomized Lifting to Semi-Structured Communication Complexity via Linear DiversityVladimir Podolskii 0001, Alexander Shekhovtsov. [doi]
• Exponential-Time Approximation (Schemes) for Vertex-Ordering ProblemsMatthias Bentert, Fedor V. Fomin, Tanmay Inamdar 0002, Saket Saurabh 0001. [doi]
• Quantum 2-SAT on Low Dimensional Systems Is QMAsubscript{1}-Complete: Direct Embeddings and Black-Box SimulationDorian Rudolph, Sevag Gharibian, Daniel Nagaj. [doi]
• Error Correction for Message StreamsMeghal Gupta, Rachel Yun Zhang. [doi]
• Data-Driven Solution PortfoliosMarina Drygala, Silvio Lattanzi, Andreas Maggiori, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii. [doi]
• When to Give up on a Parallel ImplementationNathan S. Sheffield, Alek Westover. [doi]
• Sketching, Moment Estimation, and the Lévy-Khintchine Representation TheoremSeth Pettie, Dingyu Wang. [doi]
• Backdoor Defense, Learnability and ObfuscationPaul F. Christiano, Jacob Hilton, Victor Lecomte, Mark Xu. [doi]
• Catalytic CommunicationEdward Pyne, Nathan S. Sheffield, William Wang. [doi]
• Optimal Communication Complexity of Chained IndexJanani Sundaresan. [doi]
• The Computational Complexity of Factored GraphsShreya Gupta, Boyang Huang, Russell Impagliazzo, Stanley Woo, Christopher Ye 0001. [doi]
• Error-Correcting Graph CodesSwastik Kopparty, Aditya Potukuchi, Harry Sha. [doi]
• Incompressible Functional EncryptionRishab Goyal, Venkata Koppula, Mahesh Sreekumar Rajasree, Aman Verma. [doi]
• Space Complexity of Minimum Cut Problems in Single-Pass StreamsMatthew Ding 0001, Alexandro Garces, Jason Li 0006, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff. [doi]
• Parameterized Geometric Graph Modification with Disk ScalingFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Partial Minimum Branching Program Size Problem Is ETH-HardLudmila Glinskih, Artur Riazanov. [doi]
• Online Versus Offline Adversaries in Property TestingEsty Kelman, Ephraim Linder, Sofya Raskhodnikova. [doi]
• Fine-Grained Equivalence for Problems Related to Integer Linear ProgrammingLars Rohwedder, Karol Wegrzycki. [doi]
• New Direct Sum TestsAlek Westover, Edward Yu, Kai Zhe Zheng. [doi]
• Simple Is COOL: Graded Dispersal and Its Applications for Byzantine Fault ToleranceIttai Abraham, Gilad Asharov, Anirudh Chandramouli. [doi]
• Extracting Dual Solutions via Primal OptimizersYair Carmon, Arun Jambulapati, Liam O'Carroll, Aaron Sidford. [doi]
• Succinct Fermion Data StructuresJoseph Carolan, Luke Schaeffer. [doi]
• Edge-Minimum Walk of Modular Length in Polynomial TimeAntoine Amarilli, Benoît Groz, Nicole Wein. [doi]
• Graph Reconstruction via MIS QueriesChristian Konrad 0001, Conor O'Sullivan, Victor Traistaru. [doi]
• Polynomials, Divided Differences, and CodesS. Venkitesh. [doi]
• On White-Box Learning and Public-Key EncryptionYanyi Liu, Noam Mazor, Rafael Pass. [doi]
• Concentration of Submodular Functions and Read-k Families Under Negative DependenceSharmila Duppala, George Li 0002, Juan Luque, Aravind Srinivasan, Renata Valieva. [doi]
• Differential Privacy and Sublinear Time Are Incompatible SometimesJeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee. [doi]
• Hardness of Sampling for the Anti-Ferromagnetic Ising Model on Random GraphsNeng Huang, Will Perkins 0001, Aaron Potechin. [doi]
• A High Dimensional Cramer's Rule Connecting Homogeneous Multilinear Equations to HyperdeterminantsAntoine Joux, Anand Kumar Narayanan. [doi]
• Quantum Advantage and Lower Bounds in Parallel Query ComplexityJoseph Carolan, Amin Shiraz Gilani, Mahathi Vempati. [doi]
• List Decoding Bounds for Binary Codes with Noiseless FeedbackMeghal Gupta, Rachel Yun Zhang. [doi]
• Sublinear Metric Steiner Tree via Improved Bounds for Set CoverSepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian. [doi]
• Adjacency Labeling Schemes for Small ClassesÉdouard Bonnet, Julien Duron, John Sylvester 0001, Viktor Zamaraev. [doi]
• Confusion Matrix Design for Downstream Decision-Making (Extended Abstract)Yiding Feng, Wei Tang. [doi]
• Robust Restaking NetworksNaveen Durvasula, Tim Roughgarden. [doi]
• Sampling List PackingsEvan Camrud, Ewan Davies, Alex Karduna, Holden Lee. [doi]
• The Local Hamiltonian Problem for Quasi-Quantum States: A Toy Model for the Quantum PCP Conjecture (Extended Abstract)Itai Arad, Miklos Santha. [doi]
• Unraveling Universally Closest Refinements via Symmetric Density Decomposition and Fisher Market EquilibriumT.-H. Hubert Chan, Quan Xue. [doi]
• Simultaneous Haar Indistinguishability with Applications to Unclonable CryptographyPrabhanjan Ananth, Fatih Kaleoglu, Henry Yuen. [doi]
• Facility Location on High-Dimensional Euclidean SpacesEuiwoong Lee, Kijung Shin. [doi]