default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID66th FOCS 2025: Sydney, Australia
- 66th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2025, Sydney, Australia, December 14-17, 2025. IEEE 2025, ISBN 979-8-3315-7132-0
- Romain Bourneuf, Pierre Charbit, Stéphan Thomassé:
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. 1-37 - Alexander M. Dalzell, András Gilyén, Connor T. Hann, Sam McArdle, Grant Salton, Quynh T. Nguyen, Aleksander Kubica, Fernando G. S. L. Brandão:
A Distillation-Teleportation Protocol for Fault-Tolerant QRAM. 38-74 - Oliver Janzer
, Peter Manohar:
A kq/q-2 Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. 75-85 - Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai:
A Little Clairvoyance Is All You Need. 86-118 - Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten:
A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams. 119-148 - Jian Li, Yinchen Liu, Yiran Zhang:
Adaptivity Gaps for Stochastic Probing with Subadditive Functions. 149-185 - Maryam Aliakbarpour, Vladimir Braverman, Nai-Hui Chia, Yuhan Liu:
Adversarially Robust Quantum State Learning and Testing. 186-204 - Nikhil Kumar, Chaitanya Swamy:
Almost Tight Additive Guarantees for k-Edge-Connectivity. 205-219 - Nikhil Bansal, Haotian Jiang:
An Improved Bound for the Beck-Fiala Conjecture. 220-232 - Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland:
An Improved Greedy Approximation for (Metric) k-Means. 233-240 - Lorenzo Beretta, Vincent Cohen-Addad, Rajesh Jayaram, Erik Waingarten:
Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair. 241-266 - Shuichi Hirahara, Naoto Ohsaka:
Asymptotically Optimal Inapproximability of Ek-SAT Reconfiguration. 267-276 - Yiqiao Bao, Anubhav Baweja, Nicolas Menand, Erik Waingarten, Nathan White, Tian Zhang:
Average Distortion Sketching. 277-302 - Yiding Feng, Yaonan Jin:
Beyond Regularity: Simple versus Optimal Mechanisms, Revisited. 303-342 - George Lu, Jad Silbak, Daniel Wichs:
Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions. 343-359 - Aryan Agarwala, Ian Mertz:
Bipartite Matching is in Catalytic Logspace. 360-372 - Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest. 373-444 - Clayton Thomas:
Characterization of Priority-Neutral Matching Lattices. 445-454 - Michal Koucký, Ian Mertz, Edward Pyne, Sasha Sami:
Collapsing Catalytic Classes. 455-463 - Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu:
Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs. 464-485 - Vladimir Lysikov, Michael Walter:
Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness. 486-511 - Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan:
Computational-Statistical Tradeoffs from NP-hardness. 512-530 - Lasse Wulf:
Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings). 531-551 - Jiangqi Dai, Mohsen Ghaffari, Julian Portmann:
Constant Approximation of Arboricity in Near-Optimal Sublinear Time. 552-564 - Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
Constant Rate Codes for Adaptive Broadcasts Do Not Exist. 565-584 - Rahul Ilango, Alex Lombardi:
Cryptography Meets Worst-case Complexity: Optimal Security and More From iO and Worst-case Assumptions. 585-614 - Micha Christoph, Nemanja Draganic, António Girão, Eoin Hurley, Lukas Michel, Alp Müyesser:
Cycle-factors of regular graphs via entropy. 615-619 - Jon M. Kleinberg, Fan Wei:
Density Measures for Language Generation. 620-658 - Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan:
Deterministic Almost-Linear-Time Gomory-Hu Trees. 659-666 - Xiaoyu Chen, Weiming Feng, Heng Guo, Xinyuan Zhang, Zongrui Zou:
Deterministic Counting from Coupling Independence. 667-683 - Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf:
Deterministic factorization of constant-depth algebraic circuits in subexponential time. 684-709 - Shalev Ben-David, Eric Blais:
Direct Product Theorems for Randomized Query Complexity. 710-733 - Hsien-Chih Chang, Jonathan Conroy:
Distance Approximating Minors for Planar and Minor-Free Graphs. 734-754 - Sepehr Assadi, Janani Sundaresan:
Distributed Triangle Detection is Hard in Few Rounds. 755-766 - Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance. 767-786 - Tuukka Korhonen:
Dynamic Treewidth in Logarithmic Time. 787-796 - Zhiyi Huang, Enze Sun, Xiaowei Wu, Jiahao Zhao:
Edge-weighted Matching in the Dark. 797-817 - Bonnie Berger, Rohan Goyal, Matthew M. Hong, Yael Tauman Kalai:
Efficiently Batching Unambiguous Interactive Proofs. 818-863 - Alexandr Andoni, Negev Shekel Nosatzki:
Embeddings into Similarity Measures for Nearest Neighbor Search. 864-893 - Jun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty, Assaf Reiner, Rachel Yun Zhang:
Explicit Lossless Vertex Expanders. 894-911 - Adam Bouland, Ishaun Datta, Bill Fefferman, Felipe Hernandez:
Exponential improvements to the average-case hardness of BosonSampling. 912-933 - Ronen Shaltiel:
Extractors for Samplable Distributions with Polynomially Small Min-Entropy. 934-946 - Igor Balla, Lianna Hambardzumyan, István Tomon:
Factorization norms and an inverse theorem for MaxCut. 947-963 - Ruoxu Cen, Henry L. Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi:
Fast Algorithms for Graph Arboricity and Related Problems. 964-982 - Josh Alman, Shivam Nadimpalli, Shyamal Patel, Rocco A. Servedio:
Faster Exact Learning of k-Term DNFs with Membership and Equivalence Queries. 983-996 - Yunbum Kook, Santosh S. Vempala:
Faster Logconcave Sampling from a Cold Start in High Dimension. 997-1006 - Xiaoyu Chen, Weiming Feng, Zhe Ju, Tianshun Miao, Yitong Yin, Xinyuan Zhang:
Faster Mixing of the Jerrum-Sinclair Chain. 1007-1028 - Rares-Darius Buhai, Yiding Hua, David Steurer, Andor Vári-Kakas:
Finding Colorings in One-Sided Expanders. 1029-1058 - William Kuszmaul, Jingxun Liang, Renfei Zhou:
Fingerprint Filters Are Optimal. 1059-1073 - Laura Mancinska, Pieter Spaas, Taro Spirig, Matthijs Vernooij:
Gap-preserving reductions and RE-completeness of independent set games. 1074-1090 - Shunhua Jiang, Michael Kapralov, Lawrence Li, Aaron Sidford:
Generalized Flow in Nearly-linear Time on Moderately Dense Graphs. 1091-1099 - Rahul Ilango:
Gödel in Cryptography: Effectively Zero-Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness. 1100-1127 - François Le Gall, Harumichi Nishimura, Dhara Thakkar:
Group Order is in QCMA. 1128-1143 - Hyung-Chan An, Mong-Jen Kao, Changyeol Lee, Mu-Ting Lee:
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics. 1144-1169 - Ruiquan Gao, Alexandros Hollender, Aviad Rubinstein:
High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich. 1184-1197 - Sílvia Casacuberta, Parikshit Gopalan, Varun Kanade, Omer Reingold:
How Global Calibration Strengthens Multiaccuracy. 1198-1227 - Ilias Diakonikolas, Daniel M. Kane:
Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models. 1228-1247 - Manoj Gupta:
Improved 2-Approximate Shortest Paths for close vertex pairs. 1248-1261 - Arpon Basu, Jun-Ting Hsieh, Pravesh K. Kothari, Andrew D. Lin:
Improved Lower Bounds for all Odd-Query Locally Decodable Codes. 1262-1285 - Dor Minzer, Kai Zhe Zheng:
Improved Round-by-round Soundness IOPs via Reed-Muller Codes. 1286-1294 - Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee, Xuandi Ren:
Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices. 1295-1303 - Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp, Yunchao Liu, Tony Metger, Xinyu Tan:
Incompressibility and Spectral Gaps of Random Circuits. 1304-1312 - Alberto Larrauri:
Ineffectiveness for Search and Undecidability of PCSP Meta-Problems. 1313-1350 - Guy Blanc, Clément L. Canonne, Erik Waingarten:
Instance-Optimal Uniformity Testing and Tracking. 1351-1365 - David Harvey, Joris van der Hoeven:
Integer multiplication is at least as hard as matrix transposition. 1366-1381 - Thomas Kesselheim, Marco Molinaro, Kalen Patton, Sahil Singla:
Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives. 1382-1410 - Josh Alman, Baitian Li:
Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum. 1411-1441 - Nick Fischer, Vasileios Nakos:
ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling. 1442-1457 - Chi-Fang Chen, Anurag Anshu, Quynh T. Nguyen:
Learning quantum Gibbs states locally and efficiently. 1458-1464 - Shashank Srivastava, Madhur Tulsiani:
List Decoding Expander-Based Codes up to Capacity in Near-Linear Time. 1465-1487 - Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Madhu Sudan:
Lower Bounds for Non-adaptive Local Computation Algorithms. 1488-1511 - Gleb Kalachev, Pavel Panteleev:
Maximally Extendable Product Codes are Good Coboundary Expanders. 1512-1524 - Zander Kelley, Xin Lyu:
More efficient sifting for grid norms, and applications to multiparty communication complexity. 1525-1536 - Yumou Fei, Dor Minzer, Shuo Wang:
Multi-Pass Streaming Lower Bounds for Approximating Max-Cut. 1537-1560 - Louis Golowich, Venkatesan Guruswami:
Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks. 1561-1569 - Simone Di Gregorio, Paul Dütting, Federico Fusco, Chris Schwiegelshohn:
Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade. 1570-1594 - Princewill Okoroafor, Robert Kleinberg, Michael P. Kim:
Near-Optimal Algorithms for Omniprediction. 1595-1609 - Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang:
Near-Optimal Fault-Tolerant Strong Connectivity Preservers. 1610-1638 - Ce Jin, Tomasz Kociumaka:
Near-Optimal Property Testers for Pattern Matching. 1639-1647 - Shuichi Hirahara, Rahul Ilango:
NP-hardness of the Minimum Circuit Size Problem from Well-Studied Assumptions. 1648-1664 - Mi-Ying (Miryam) Huang, Er-Cheng Tang:
Obfuscation of Unitary Quantum Programs. 1665-1671 - Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer:
On Inverse Theorems and Combinatorial Lines. 1672-1684 - Ansh Nagda, Prasad Raghavendra:
On optimal distinguishers for Planted Clique. 1685-1702 - Abhishek Jain, Zhengzhong Jin, Surya Mathialagan, Omer Paneth:
On Succinct Obfuscation via Propositional Proofs. 1703-1740 - Liyan Chen, Zhengzhong Jin:
On the Impossibility of SNARGs with Short CRS : (or: Revisiting Gentry-Wichs Barrier in the Non-adaptive Setting). 1741-1760 - Sanjeev Khanna, Aaron Putterman, Junkai Song:
On the Parallel Complexity of Finding a Matroid Basis. 1761-1786 - Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring: Sharp Thresholds. 1787-1812 - Nikhil Bansal, Zhiyi Huang, Zixuan Zhu:
Optimal 4-Approximation for the Correlated Pandora's Problem. 1813-1828 - Eleon Bach, Sophie Huiberts:
Optimal Smoothed Analysis of the Simplex Method. 1829-1856 - Jonathan Leake, Kasper Lindberg, Shayan Oveis Gharan:
Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences. 1857-1870 - Pravesh K. Kothari, Ankur Moitra, Alexander S. Wein:
Overcomplete Tensor Decomposition via Koszul-Young Flattenings. 1871-1882 - Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang:
Parallel (1+ε)-Approximate Multi-Commodity Min-Cost Flow in Almost Optimal Depth and Work. 1883-1893 - Andrew Huang, Yael Tauman Kalai:
Parallel Repetition for Post-Quantum Arguments. 1894-1902 - George Z. Li, Zihan Tan, Tianyi Zhang:
Paths and Intersections: Exact Emulators for Planar Graphs. 1903-1926 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz:
Pattern Matching under Weighted Edit Distance. 1927-1935 - William Swartworth, David P. Woodruff, Samson Zhou:
Perfect Lp Sampling with Polylogarithmic Update Time. 1936-1960 - Maximilian Gorsky, Michal T. Seweryn, Sebastian Wiederrecht:
Polynomial bounds for the Graph Minor Structure Theorem. 1961-1978 - Robin Bowers, Marius Garbea, Emmanouil Pountourakis, Samuel Taggart:
Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More. 1979-2002 - Tal Herman, Guy N. Rothblum:
Proving Natural Distribution Properties is Harder than Testing Them. 2003-2016 - Ilias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis Pittas:
PTF Testing Lower Bounds for Non-Gaussian Component Analysis. 2017-2026 - Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney:
Quasipolynomial Bounds for the Corners Theorem. 2027-2036 - Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber:
Query-Efficient Fixpoints of ℓp-Contractions. 2037-2053 - Arun Jambulapati, Jonathan Li, Kevin Tian:
Radial Isotropic Position via an Implicit Newton's Method. 2054-2087 - Shai Evra, Brooke Feigon, Kathrin Maurischat, Ori Parzanchevski:
Ramanujan bigraphs and applications. 2088-2096 - Matan Levi, Jonathan Mosheiff, Nikhil Shagrithaya:
Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent. 2097-2131 - Rasmus Kyng, Maximilian Probst Gutenberg, Tim Rieder:
Random-Shift Revisited: Tight Approximations for Tree Embeddings and ℓ₁-Oblivious Routings. 2132-2142 - Abhibhav Garg, Rafael Oliveira, Akash Kumar Sengupta:
Rank Bounds and PIT for depth-4 circuits with top fan-in 3 and constant bottom fan-in via a non-linear Edelstein-Kelly theorem. 2143-2169 - Xiaoyu Chen, Zejia Chen, Zongchen Chen, Yitong Yin, Xinyuan Zhang:
Rapid Mixing on Random Regular Graphs beyond Uniqueness. 2170-2193 - Eric Culf, Kieran Mastel:
RE-completeness of entangled constraint satisfaction problems. 2194-2230 - Ilias Diakonikolas, Giannis Iakovidis, Daniel M. Kane, Nikos Zarifis:
Robust Learning of Multi-index Models via Iterative Subspace Approximation. 2231-2239 - Sumegha Garg, Akash Kumar Sengupta:
Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes. 2240-2265 - David P. Woodruff, Taisuke Yasuda:
Root Ridge Leverage Score Sampling for ℓp Subspace Approximation. 2266-2291 - Seri Khoury, Aaron Schild:
Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching. 2292-2305 - Haitao Wang:
Shortest Paths on Convex Polyhedral Surfaces. 2306-2327 - Boaz Menuhin, Moni Naor:
Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations. 2328-2352 - Mika Göös, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov:
Sign-Rank of k-Hamming Distance is Constant. 2353-2368 - Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Solving Linear Inequalities over the Space of Convex Sets & its Applications to Cryptography and Hydrodynamics. 2369-2380 - Ishani Karmarkar, Liam O'Carroll, Aaron Sidford:
Solving Zero-Sum Games with Fewer Matrix-Vector Products. 2381-2391 - Yang Hu, William Kuszmaul, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou:
Static Retrieval Revisited: To Optimality and Beyond. 2392-2409 - Anindya De, Sanjeev Khanna, Nathan White:
Stochastic Knapsack without Relaxing the Capacity. 2410-2445 - Antonios Antoniadis, Ruben Hoeksma, Kevin Schewior, Marc Uetz:
Stochastic scheduling with Bernoulli-type jobs through policy stratification. 2446-2469 - Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivný:
Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. 2470-2479 - Oliver Korten, Toniann Pitassi, Russell Impagliazzo:
Stronger Cell Probe Lower Bounds via Local PRGs. 2480-2504 - Yuval Ishai, Hanjun Li, Huijia Lin:
Succinct Homomorphic MACs from Groups and Applications. 2505-2545 - Robert Krauthgamer, Nir Petruschka, Shay Sapir:
The Power of Recursive Embeddings for ℓp Metrics. 2546-2554 - Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki:
The Proof Analysis Problem. 2555-2576 - Rares-Darius Buhai, Jun-Ting Hsieh, Aayush Jain, Pravesh K. Kothari:
The Quasi-Polynomial Low-Degree Conjecture is False. 2577-2590 - Gorjan Alagic, Joseph Carolan, Christian Majenz, Saliha Tokat:
The Sponge Is Quantum Indifferentiable. 2591-2630 - Lijie Chen, Binghui Peng, Hongxun Wu:
Theoretical limitations of multi-layer Transformer. 2631-2653 - Mark Sellke:
Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses. 2654-2665 - Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance. 2666-2693 - Mohsen Ghaffari, Christoph Grunau:
Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set. 2694-2727 - Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng:
Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. 2728-2765 - Xiaolin Bu, Biaoshuai Tao:
Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness. 2766-2795 - Mark Braverman, Zhongtian He:
Undirected Multicast Network Coding Gaps via Locally Decodable Codes. 2796-2812 - Jesper Nederlof:
Weighted k-Path and Other Problems in Almost O*(2k) Deterministic Time via Dynamic Representative Sets†. 2813-2824
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 2026-07-19 01:28 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
