default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th ITCS 2025: New York, NY, USA
- Raghu Meka
:
16th Innovations in Theoretical Computer Science Conference, ITCS 2025, January 7-10, 2025, Columbia University, New York, NY, USA. LIPIcs 325, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-361-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxii
- Ittai Abraham, Gilad Asharov, Anirudh Chandramouli:
Simple Is COOL: Graded Dispersal and Its Applications for Byzantine Fault Tolerance. 1:1-1:20 - Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi:
Improved Lower Bounds for 3-Query Matching Vector Codes. 2:1-2:19 - Josh Alman, Arkadev Chattopadhyay, Ryan Williams:
Sparsity Lower Bounds for Probabilistic Polynomials. 3:1-3:25 - Noga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, Hongao Wang, S. Matthew Weinberg, Qianfan Zhang:
A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. 4:1-4:22 - Antoine Amarilli, Benoît Groz, Nicole Wein:
Edge-Minimum Walk of Modular Length in Polynomial Time. 5:1-5:23 - Noga Amir, Oded Goldreich, Guy N. Rothblum:
Doubly Sub-Linear Interactive Proofs of Proximity. 6:1-6:25 - Prabhanjan Ananth, Fatih Kaleoglu, Henry Yuen:
Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography. 7:1-7:23 - Petia Arabadjieva, Alexandru Gheorghiu, Victor Gitton, Tony Metger:
Single-Round Proofs of Quantumness from Knowledge Assumptions. 8:1-8:16 - Itai Arad, Miklos Santha:
The Local Hamiltonian Problem for Quasi-Quantum States: A Toy Model for the Quantum PCP Conjecture (Extended Abstract). 9:1-9:1 - Eshwar Ram Arunachaleswaran, Natalie Collina, Sampath Kannan, Aaron Roth, Juba Ziani:
Algorithmic Collusion Without Threats. 10:1-10:21 - Vahid R. Asadi, Eric Culf, Alex May:
Rank Lower Bounds on Non-Local Quantum Computation. 11:1-11:18 - Itai Ashlagi, Jiale Chen, Mohammad Roghani, Amin Saberi:
Stable Matching with Interviews. 12:1-12:19 - Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, Nicole Wein:
Low Sensitivity Hopsets. 13:1-13:23 - Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz:
The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions. 14:1-14:22 - Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh:
Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. 15:1-15:18 - Thiago Bergamaschi, Yunchao Liu:
On Fault Tolerant Single-Shot Logical State Preparation and Robust Long-Range Entanglement. 16:1-16:9 - Sreejata Kishor Bhattacharya:
Random Restrictions of Bounded Low Degree Polynomials Are Juntas. 17:1-17:21 - Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, Chris Umans:
Finite Matrix Multiplication Algorithms from Infinite Groups. 18:1-18:23 - Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee:
Differential Privacy and Sublinear Time Are Incompatible Sometimes. 19:1-19:18 - Andrej Bogdanov, Lorenzo Taschin:
Estimating Euclidean Distance to Linearity. 20:1-20:18 - Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Adjacency Labeling Schemes for Small Classes. 21:1-21:22 - Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang:
Round-Vs-Resilience Tradeoffs for Binary Feedback Channels. 22:1-22:23 - Benedikt Bünz, Pratyush Mishra, Wilson Nguyen, William Wang:
Accumulation Without Homomorphism. 23:1-23:25 - Evan Camrud, Ewan Davies, Alex Karduna, Holden Lee:
Sampling List Packings. 24:1-24:15 - Clément L. Canonne, Abigail Gentle:
Locally Private Histograms in All Privacy Regimes. 25:1-25:24 - Clément L. Canonne, Sayantan Sen, Joy Qiping Yang:
Settling the Complexity of Testing Grainedness of Distributions, and Application to Uniformity Testing in the Huge Object Model. 26:1-26:19 - Clément L. Canonne, Francis E. Su, Salil P. Vadhan:
The Randomness Complexity of Differential Privacy. 27:1-27:21 - Amir Carmel, Chengzhi Guo, Shaofeng H.-C. Jiang, Robert Krauthgamer:
Coresets for 1-Center in 𝓁₁ Metrics. 28:1-28:20 - Yair Carmon, Arun Jambulapati, Liam O'Carroll, Aaron Sidford:
Extracting Dual Solutions via Primal Optimizers. 29:1-29:24 - Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira, Dimitrios Tsintsilidas:
Provability of the Circuit Size Hierarchy and Its Consequences. 30:1-30:22 - Joseph Carolan, Amin Shiraz Gilani, Mahathi Vempati:
Quantum Advantage and Lower Bounds in Parallel Query Complexity. 31:1-31:14 - Joseph Carolan, Luke Schaeffer:
Succinct Fermion Data Structures. 32:1-32:21 - Ulysse Chabaud, Michael Joseph, Saeed Mehraban, Arsalan Motamedi:
Bosonic Quantum Computational Complexity. 33:1-33:19 - Deeparnab Chakrabarty, C. Seshadhri:
Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing. 34:1-34:15 - T.-H. Hubert Chan, Quan Xue:
Unraveling Universally Closest Refinements via Symmetric Density Decomposition and Fisher Market Equilibrium. 35:1-35:23 - Yudong Chen, Xumei Xi, Christina Lee Yu:
Entry-Specific Matrix Estimation Under Arbitrary Sampling Patterns Through the Lens of Network Flows (Extended Abstract). 36:1-36:2 - Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Aleksandar Nikolov, Toniann Pitassi, Morgan Shirley:
A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications. 37:1-37:15 - Paul F. Christiano, Jacob Hilton, Victor Lecomte, Mark Xu:
Backdoor Defense, Learnability and Obfuscation. 38:1-38:21 - Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia:
Data Reconstruction: When You See It and When You Don't. 39:1-39:23 - Gil Cohen, Itay Cohen, Gal Maor, Yuval Peled:
Derandomized Squaring: An Analytical Insight into Its True Behavior. 40:1-40:24 - Mahsa Derakhshan, Mohammad Saneian, Zhiyang Xun:
Query Complexity of Stochastic Minimum Vertex Cover. 41:1-41:12 - Mason DiCicco, Vladimir Podolskii, Daniel Reichman:
Nearest Neighbor Complexity and Boolean Circuits. 42:1-42:23 - Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, David P. Woodruff:
Space Complexity of Minimum Cut Problems in Single-Pass Streams. 43:1-43:23 - Yinhao Dong, Pan Peng, Ali Vakilian:
Learning-Augmented Streaming Algorithms for Approximating MAX-CUT. 44:1-44:24 - Jinfeng Dou, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, Julian Werthmann:
Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. 45:1-45:26 - Marina Drygala, Silvio Lattanzi, Andreas Maggiori, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii:
Data-Driven Solution Portfolios. 46:1-46:15 - Sharmila Duppala, George Li, Juan Luque, Aravind Srinivasan, Renata Valieva:
Concentration of Submodular Functions and Read-k Families Under Negative Dependence. 47:1-47:16 - Naveen Durvasula, Tim Roughgarden:
Robust Restaking Networks. 48:1-48:21 - Yiding Feng, Wei Tang:
Confusion Matrix Design for Downstream Decision-Making (Extended Abstract). 49:1-49:1 - Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker:
Fully Characterizing Lossy Catalytic Computation. 50:1-50:13 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Parameterized Geometric Graph Modification with Disk Scaling. 51:1-51:17 - Aadityan Ganesh, Jason D. Hartline:
Combinatorial Pen Testing (Or Consumer Surplus of Deferred-Acceptance Auctions). 52:1-52:22 - Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Serena Wang:
Differential Privacy on Trust Graphs. 53:1-53:23 - Ludmila Glinskih, Artur Riazanov:
Partial Minimum Branching Program Size Problem Is ETH-Hard. 54:1-54:22 - Geri Gokaj, Marvin Künnemann:
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Linear Integer Arithmetic. 55:1-55:25 - Rishab Goyal, Venkata Koppula, Mahesh Sreekumar Rajasree, Aman Verma:
Incompressible Functional Encryption. 56:1-56:22 - Heng Guo, Vishvajeet N:
Deterministic Approximation for the Volume of the Truncated Fractional Matching Polytope. 57:1-57:14 - Shreya Gupta, Boyang Huang, Russell Impagliazzo, Stanley Woo, Christopher Ye:
The Computational Complexity of Factored Graphs. 58:1-58:19 - Meghal Gupta, Rachel Yun Zhang:
Error Correction for Message Streams. 59:1-59:18 - Meghal Gupta, Rachel Yun Zhang:
List Decoding Bounds for Binary Codes with Noiseless Feedback. 60:1-60:20 - Neng Huang, Will Perkins, Aaron Potechin:
Hardness of Sampling for the Anti-Ferromagnetic Ising Model on Random Graphs. 61:1-61:23 - Antoine Joux, Anand Kumar Narayanan:
A High Dimensional Cramer's Rule Connecting Homogeneous Multilinear Equations to Hyperdeterminants. 62:1-62:16 - John Kallaugher, Ojas Parekh, Kevin Thompson, Yipu Wang, Justin Yirka:
Complexity Classification of Product State Problems for Local Hamiltonians. 63:1-63:32 - Petteri Kaski, Mateusz Michalek:
A Universal Sequence of Tensors for the Asymptotic Rank Conjecture. 64:1-64:24 - Esty Kelman, Ephraim Linder, Sofya Raskhodnikova:
Online Versus Offline Adversaries in Property Testing. 65:1-65:18 - Christian Konrad, Conor O'Sullivan, Victor Traistaru:
Graph Reconstruction via MIS Queries. 66:1-66:19 - Swastik Kopparty, Aditya Potukuchi, Harry Sha:
Error-Correcting Graph Codes. 67:1-67:20 - Vinayak M. Kumar:
New Pseudorandom Generators and Correlation Bounds Using Extractors. 68:1-68:23 - Nicholas LaRacuente, Felix Leditzky:
Approximate Unitary k-Designs from Shallow, Low-Communication Circuits (Extended Abstract). 69:1-69:2 - Euiwoong Lee, Kijun Shin:
Facility Location on High-Dimensional Euclidean Spaces. 70:1-70:21 - Longcheng Li, Qian Li, Xingjian Li, Qipeng Liu:
Toward the Impossibility of Perfect Complete Quantum PKE from OWFs. 71:1-71:16 - Tao Lin, Ce Li:
Information Design with Unknown Prior (Extended Abstract). 72:1-72:1 - Yanyi Liu, Noam Mazor, Rafael Pass:
On White-Box Learning and Public-Key Encryption. 73:1-73:22 - Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian:
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. 74:1-74:24 - Xinyu Mao, Guangxu Yang, Jiapeng Zhang:
Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing. 75:1-75:14 - Hamoon Mousavi, Taro Spirig:
A Quantum Unique Games Conjecture. 76:1-76:16 - Seth Pettie, Dingyu Wang:
Sketching, Moment Estimation, and the Lévy-Khintchine Representation Theorem. 77:1-77:23 - Vladimir Podolskii, Alexander Shekhovtsov:
Randomized Lifting to Semi-Structured Communication Complexity via Linear Diversity. 78:1-78:21 - Edward Pyne, Nathan S. Sheffield, William Wang:
Catalytic Communication. 79:1-79:24 - Yuval Rabani, Leonard J. Schulman, Alistair Sinclair:
Diversity in Evolutionary Dynamics (Extended Abstract). 80:1-80:3 - Rajmohan Rajaraman, Omer Wasim:
Online Balanced Allocation of Dynamic Components. 81:1-81:23 - Nicolas Resch, Chen Yuan, Yihan Zhang:
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. 82:1-82:21 - Lars Rohwedder, Karol Wegrzycki:
Fine-Grained Equivalence for Problems Related to Integer Linear Programming. 83:1-83:18 - Aviad Rubinstein, Zixin Zhou:
Quantum Communication Complexity of Classical Auctions. 84:1-84:27 - Dorian Rudolph, Sevag Gharibian, Daniel Nagaj:
Quantum 2-SAT on Low Dimensional Systems Is QMAsubscript{1}-Complete: Direct Embeddings and Black-Box Simulation. 85:1-85:24 - Shuai Shao, Zhuxiao Tang:
Eulerian Orientations and Hadamard Codes: A Novel Connection via Counting. 86:1-86:13 - Nathan S. Sheffield, Alek Westover:
When to Give up on a Parallel Implementation. 87:1-87:18 - Jad Silbak, Daniel Wichs:
Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions. 88:1-88:23 - Janani Sundaresan:
Optimal Communication Complexity of Chained Index. 89:1-89:18 - Yael Tauman Kalai, Raghuvansh R. Saxena:
Polynomial Size, Short-Circuit Resilient Circuits for NC. 90:1-90:18 - Madhur Tulsiani, June Wu:
Simple Norm Bounds for Polynomial Random Matrices via Decoupling. 91:1-91:22 - Virginia Vassilevska Williams, Alek Westover:
Listing 6-Cycles in Sparse Graphs. 92:1-92:21 - S. Venkitesh:
Polynomials, Divided Differences, and Codes. 93:1-93:25 - Alek Westover, Edward Yu, Kai Zhe Zheng:
New Direct Sum Tests. 94:1-94:26 - Mark Zhandry:
Toward Separating QMA from QCMA with a Classical Oracle. 95:1-95:19 - Jiayu Zhang:
Formulations and Constructions of Remote State Preparation with Verifiability, with Applications. 96:1-96:19
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-03 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
