paper_id stringlengths 5 17 | title stringlengths 22 102 | authors stringlengths 11 141 | year int64 2.03k 2.03k | venue stringclasses 1
value | doi stringlengths 28 28 | dblp_key stringlengths 15 27 | dblp_url stringlengths 36 48 | pdf_path stringlengths 37 49 | dag stringlengths 30.4k 236k | num_nodes int64 22 72 | num_edges int64 36 236 |
|---|---|---|---|---|---|---|---|---|---|---|---|
AbboudKLPGSYY25 | Deterministic Almost-Linear-Time Gomory-Hu Trees | Amir Abboud; Rasmus Kyng; Jason Li 0006; Debmalya Panigrahi; Maximilian Probst Gutenberg; Thatchaphol Saranurak; Weixuan Yuan; Wuwei Yuan | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00035 | conf/focs/AbboudKLPGSYY25 | https://dblp.org/rec/conf/focs/AbboudKLPGSYY25 | data/papers/FOCS_2025/AbboudKLPGSYY25/paper.pdf | {"paper_title": "Deterministic Almost-Linear-Time Gomory-Hu Trees", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "First deterministic almost-linear-time algorithm for Gomory-Hu trees", "summary": "The paper gives the first deterministic algorithm that constructs a Gomory-Hu tree in almost... | 54 | 196 |
AgarwalaM25 | Bipartite Matching is in Catalytic Logspace | Aryan Agarwala; Ian Mertz | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00022 | conf/focs/AgarwalaM25 | https://dblp.org/rec/conf/focs/AgarwalaM25 | data/papers/FOCS_2025/AgarwalaM25/paper.pdf | {"paper_title": "Bipartite Matching is in Catalytic Logspace", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: bipartite matching in CLP and LOSSY[NC]", "summary": "The paper proves that bipartite maximum matching can be computed in catalytic logspace with polynomial time, and ... | 44 | 140 |
AliakbarpourBCL25 | Adversarially Robust Quantum State Learning and Testing | Maryam Aliakbarpour; Vladimir Braverman; Nai-Hui Chia; Yuhan Liu | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00013 | conf/focs/AliakbarpourBCL25 | https://dblp.org/rec/conf/focs/AliakbarpourBCL25 | data/papers/FOCS_2025/AliakbarpourBCL25/paper.pdf | {"paper_title": "Adversarially robust quantum state learning and testing", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main results on adversarially robust quantum state learning", "summary": "The paper studies quantum state tomography and testing when an adversary can arbitrarily alter... | 54 | 172 |
AlmanL25 | Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum | Josh Alman; Baitian Li | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00074 | conf/focs/AlmanL25 | https://dblp.org/rec/conf/focs/AlmanL25 | data/papers/FOCS_2025/AlmanL25/paper.pdf | {"paper_title": "Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Asymptotic spectrum framework for depth-2 circuits of Kronecker powers", "summary": "The paper studies depth-2 linear circuits for matrices of the form A^{\\o... | 36 | 91 |
AlmanNPS25 | Faster Exact Learning of k-Term DNFs with Membership and Equivalence Queries | Josh Alman; Shivam Nadimpalli; Shyamal Patel; Rocco A. Servedio | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00051 | conf/focs/AlmanNPS25 | https://dblp.org/rec/conf/focs/AlmanNPS25 | data/papers/FOCS_2025/AlmanNPS25/paper.pdf | {"paper_title": "Faster exact learning of k-term DNFs with membership and equivalence queries", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "First sub-2^k exact learning algorithm for k-term DNF with MQ and EQ", "summary": "The paper gives the first improvement in over three decades for ... | 58 | 214 |
AnKLL25 | Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics | Hyung-Chan An; Mong-Jen Kao; Changyeol Lee; Mu-Ting Lee | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00060 | conf/focs/AnKLL25 | https://dblp.org/rec/conf/focs/AnKLL25 | data/papers/FOCS_2025/AnKLL25/paper.pdf | {"paper_title": "Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of the paper and main results", "summary": "The paper studies hierarchical correlation clustering and its connection to fitting ... | 46 | 150 |
AzarmehrBGS25 | Lower Bounds for Non-adaptive Local Computation Algorithms | Amir Azarmehr; Soheil Behnezhad; Alma Ghafari; Madhu Sudan 0001 | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00078 | conf/focs/AzarmehrBGS25 | https://dblp.org/rec/conf/focs/AzarmehrBGS25 | data/papers/FOCS_2025/AzarmehrBGS25/paper.pdf | {"paper_title": "Lower Bounds for Non-adaptive Local Computation Algorithms", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main separation for non-adaptive LCAs", "summary": "The paper proves that non-adaptive local computation algorithms for constant-factor approximation of maximum matc... | 64 | 184 |
BallaHT25 | Factorization norms and an inverse theorem for MaxCut | Igor Balla; Lianna Hambardzumyan; István Tomon | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00049 | conf/focs/BallaHT25 | https://dblp.org/rec/conf/focs/BallaHT25 | data/papers/FOCS_2025/BallaHT25/paper.pdf | {"paper_title": "FACTORIZATION NORMS AND AN INVERSE THEOREM FOR MAXCUT", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contributions", "summary": "The paper proves that Boolean matrices with bounded gamma_2 norm, or even bounded normalized trace norm, must contain ... | 52 | 152 |
BansalJ25 | An Improved Bound for the Beck-Fiala Conjecture | Nikhil Bansal 0001; Haotian Jiang | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00015 | conf/focs/BansalJ25 | https://dblp.org/rec/conf/focs/BansalJ25 | data/papers/FOCS_2025/BansalJ25/paper.pdf | {"paper_title": "An Improved Bound for the Beck-Fiala Conjecture", "paper_url": null, "nodes": [{"id": "node_02", "type": "motivation", "title": "The Beck-Fiala conjecture and prior bounds", "summary": "The motivating problem is the Beck-Fiala conjecture, which predicts discrepancy O(sqrt{k}) for k-column-sparse set sy... | 43 | 136 |
BaoBMWWZ25 | Average Distortion Sketching | Yiqiao Bao; Anubhav Baweja; Nicolas Menand; Erik Waingarten; Nathan White; Tian Zhang 0009 | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00019 | conf/focs/BaoBMWWZ25 | https://dblp.org/rec/conf/focs/BaoBMWWZ25 | data/papers/FOCS_2025/BaoBMWWZ25/paper.pdf | {"paper_title": "Average-Distortion Sketching", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contributions", "summary": "The paper introduces average-distortion sketching, a distribution-aware relaxation of metric sketching that preserves distances on average whil... | 57 | 160 |
BasuHKL25 | Improved Lower Bounds for all Odd-Query Locally Decodable Codes | Arpon Basu; Jun-Ting Hsieh; Pravesh K. Kothari; Andrew D. Lin | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00066 | conf/focs/BasuHKL25 | https://dblp.org/rec/conf/focs/BasuHKL25 | data/papers/FOCS_2025/BasuHKL25/paper.pdf | {"paper_title": "Improved Lower Bounds for all Odd-Query Locally Decodable Codes", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: optimal polynomial lower bounds for odd-query LDCs", "summary": "The paper proves that for every odd q at least 3, any binary q-query LDC must sati... | 49 | 147 |
BedertNOZ25 | Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa | Benjamin Bedert; Tamio-Vesa Nakajima; Karolina Okrasa; Stanislav Zivný | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00129 | conf/focs/BedertNOZ25 | https://dblp.org/rec/conf/focs/BedertNOZ25 | data/papers/FOCS_2025/BedertNOZ25/paper.pdf | {"paper_title": "Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: strong sparsification for 1-in-3-SAT", "summary": "The paper introduces strong sparsification, where variables may be merged instead of con... | 49 | 116 |
BenDavidB25 | Direct Product Theorems for Randomized Query Complexity | Shalev Ben-David; Eric Blais | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00038 | conf/focs/BenDavidB25 | https://dblp.org/rec/conf/focs/BenDavidB25 | data/papers/FOCS_2025/BenDavidB25/paper.pdf | {"paper_title": "Direct Product Theorems for Randomized Query Complexity", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contributions", "summary": "The paper proves two new direct product theorems for randomized query complexity. The first gives an optimal charact... | 51 | 151 |
BergerGHK25 | Efficiently Batching Unambiguous Interactive Proofs | Bonnie Berger; Rohan Goyal; Matthew M. Hong; Yael Tauman Kalai | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00044 | conf/focs/BergerGHK25 | https://dblp.org/rec/conf/focs/BergerGHK25 | data/papers/FOCS_2025/BergerGHK25/paper.pdf | {"paper_title": "Efficiently Batching Unambiguous Interactive Proofs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: polylog-overhead batching for UIPs", "summary": "The paper gives a new way to batch public-coin unambiguous interactive proofs so that proving k instance... | 47 | 153 |
BernsteinBLST25 | Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs | Aaron Bernstein; Joakim Blikstad; Jason Li 0006; Thatchaphol Saranurak; Ta-Wei Tu | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00026 | conf/focs/BernsteinBLST25 | https://dblp.org/rec/conf/focs/BernsteinBLST25 | data/papers/FOCS_2025/BernsteinBLST25/paper.pdf | {"paper_title": "Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Near-quadratic combinatorial exact max-flow via shortcut graphs", "summary": "The paper gives a combinatorial algorithm for exact maximum flow in direct... | 51 | 183 |
BlancKST25 | Computational-Statistical Tradeoffs from NP-hardness | Guy Blanc; Caleb Koch 0001; Carmen Strassle; Li-Yang Tan | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00028 | conf/focs/BlancKST25 | https://dblp.org/rec/conf/focs/BlancKST25 | data/papers/FOCS_2025/BlancKST25/paper.pdf | {"paper_title": "Computational-Statistical Tradeoffs from NP-hardness", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "NP-hardness-based computational-statistical tradeoffs in learning", "summary": "The paper proves that sharp sample-vs-runtime tradeoffs in PAC learning can be based on sta... | 56 | 154 |
BlikstadSVW25 | Online Edge Coloring: Sharp Thresholds | Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00094 | conf/focs/BlikstadSVW25 | https://dblp.org/rec/conf/focs/BlikstadSVW25 | data/papers/FOCS_2025/BlikstadSVW25/paper.pdf | {"paper_title": "Online Edge Coloring: Sharp Thresholds", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Sharp thresholds for online edge coloring", "summary": "The paper proves near-optimal online edge coloring guarantees at the exact degree thresholds suggested by old lower bounds. It gi... | 64 | 202 |
BourneufCT25 | A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number | Romain Bourneuf; Pierre Charbit; Stéphan Thomassé | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00007 | conf/focs/BourneufCT25 | https://dblp.org/rec/conf/focs/BourneufCT25 | data/papers/FOCS_2025/BourneufCT25/paper.pdf | {"paper_title": "Domination versus fractional chromatic number; applications to local tournament coloring and majority digraphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main themes and results", "summary": "This portion of the paper studies how domination in tournaments and related... | 62 | 165 |
BravermanH25 | Undirected Multicast Network Coding Gaps via Locally Decodable Codes | Mark Braverman; Zhongtian He | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00142 | conf/focs/BravermanH25 | https://dblp.org/rec/conf/focs/BravermanH25 | data/papers/FOCS_2025/BravermanH25/paper.pdf | {"paper_title": "Undirected Multicast Network Coding Gaps via Locally Decodable Codes", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of undirected multi-source multicast coding gaps via LDCs", "summary": "The paper studies how much network coding can improve throughput over Stei... | 48 | 155 |
BuT25 | Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness | Xiaolin Bu; Biaoshuai Tao | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00141 | conf/focs/BuT25 | https://dblp.org/rec/conf/focs/BuT25 | data/papers/FOCS_2025/BuT25/paper.pdf | {"paper_title": "Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Randomness enables truthful almost-envious-free allocation", "summary": "The paper studies randomized truthful mechanisms for a... | 54 | 171 |
BuhaiHJK25 | The Quasi-Polynomial Low-Degree Conjecture is False | Rares-Darius Buhai; Jun-Ting Hsieh; Aayush Jain; Pravesh K. Kothari | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00134 | conf/focs/BuhaiHJK25 | https://dblp.org/rec/conf/focs/BuhaiHJK25 | data/papers/FOCS_2025/BuhaiHJK25/paper.pdf | {"paper_title": "The Quasi-Polynomial Low-Degree Conjecture is False", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main counterexamples", "summary": "The paper disproves the low-degree conjecture of Hopkins by constructing permutation-invariant planted distributions w... | 39 | 123 |
BuhaiHSV25 | Finding Colorings in One-Sided Expanders | Rares-Darius Buhai; Yiding Hua; David Steurer; Andor Vári-Kakas | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00054 | conf/focs/BuhaiHSV25 | https://dblp.org/rec/conf/focs/BuhaiHSV25 | data/papers/FOCS_2025/BuhaiHSV25/paper.pdf | {"paper_title": "Coloring and Independent Sets on One-Sided Expanders via Threshold Rank", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of spectral recovery and hardness for almost-colorable one-sided expanders", "summary": "The paper develops spectral algorithms and matching ha... | 70 | 221 |
CenFLLP25 | Fast Algorithms for Graph Arboricity and Related Problems | Ruoxu Cen; Henry L. Fleischmann; George Z. Li; Jason Li 0006; Debmalya Panigrahi | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00050 | conf/focs/CenFLLP25 | https://dblp.org/rec/conf/focs/CenFLLP25 | data/papers/FOCS_2025/CenFLLP25/paper.pdf | {"paper_title": "Fast Algorithms for Graph Arboricity and Related Problems", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of fast algorithms for arboricity and cut hierarchy", "summary": "The paper gives faster exact algorithms for two related graph problems: computing arboricit... | 53 | 172 |
ChenAN25 | Learning quantum Gibbs states locally and efficiently | Chi-Fang Chen; Anurag Anshu; Quynh T. Nguyen | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00076 | conf/focs/ChenAN25 | https://dblp.org/rec/conf/focs/ChenAN25 | data/papers/FOCS_2025/ChenAN25/paper.pdf | {"paper_title": "Learning quantum Gibbs states locally and efficiently", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Local and efficient learning of quantum Gibbs Hamiltonians", "summary": "The paper studies how to recover a local quantum Hamiltonian from copies of its Gibbs state using... | 51 | 174 |
ChenCCYZ25 | Rapid Mixing on Random Regular Graphs beyond Uniqueness | Xiaoyu Chen; Zejia Chen; Zongchen Chen; Yitong Yin; Xinyuan Zhang | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00115 | conf/focs/ChenCCYZ25 | https://dblp.org/rec/conf/focs/ChenCCYZ25 | data/papers/FOCS_2025/ChenCCYZ25/paper.pdf | {"paper_title": "Rapid Mixing on Random Regular Graphs beyond Uniqueness", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contribution", "summary": "The paper proves that Glauber dynamics for the hardcore model mixes rapidly on random regular graphs well beyond the ... | 49 | 166 |
ChenFGZZ25 | Deterministic Counting from Coupling Independence | Xiaoyu Chen; Weiming Feng 0001; Heng Guo 0001; Xinyuan Zhang; Zongrui Zou | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00036 | conf/focs/ChenFGZZ25 | https://dblp.org/rec/conf/focs/ChenFGZZ25 | data/papers/FOCS_2025/ChenFGZZ25/paper.pdf | {"paper_title": "DETERMINISTIC COUNTING FROM COUPLING INDEPENDENCE", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Deterministic counting from coupling independence", "summary": "The paper gives a general deterministic approximate counting framework for bounded-degree spin systems based o... | 50 | 163 |
ChenFJMYZ25 | Faster Mixing of the Jerrum-Sinclair Chain | Xiaoyu Chen; Weiming Feng 0001; Zhe Ju; Tianshun Miao; Yitong Yin; Xinyuan Zhang | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00053 | conf/focs/ChenFJMYZ25 | https://dblp.org/rec/conf/focs/ChenFJMYZ25 | data/papers/FOCS_2025/ChenFJMYZ25/paper.pdf | {"paper_title": "Improved Mixing of Glauber-Type Dynamics for the Hardcore Model via Localization and Transport", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main mixing-time improvements", "summary": "The paper studies Markov chains for sampling from the hardcore mod... | 26 | 36 |
ChenHHLMT25 | Incompressibility and Spectral Gaps of Random Circuits | Chi-Fang Chen; Jeongwan Haah; Jonas Haferkamp; Yunchao Liu; Tony Metger; Xinyu Tan | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00069 | conf/focs/ChenHHLMT25 | https://dblp.org/rec/conf/focs/ChenHHLMT25 | data/papers/FOCS_2025/ChenHHLMT25/paper.pdf | {"paper_title": "Incompressibility and spectral gaps of random circuits", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: t-independent spectral gaps and incompressibility of random circuits", "summary": "The paper proves that random reversible circuits and random quantum circu... | 50 | 140 |
DaiGP25 | Constant Approximation of Arboricity in Near-Optimal Sublinear Time | Jiangqi Dai; Mohsen Ghaffari 0001; Julian Portmann | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00030 | conf/focs/DaiGP25 | https://dblp.org/rec/conf/focs/DaiGP25 | data/papers/FOCS_2025/DaiGP25/paper.pdf | {"paper_title": "Constant Approximation of Arboricity in Near-Optimal Sublinear Time", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Constant-factor arboricity approximation in near-optimal sublinear time", "summary": "The paper gives a randomized sublinear-time algorithm that approximate... | 42 | 144 |
DalzellGHMSNKB25 | A Distillation-Teleportation Protocol for Fault-Tolerant QRAM | 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 | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00008 | conf/focs/DalzellGHMSNKB25 | https://dblp.org/rec/conf/focs/DalzellGHMSNKB25 | data/papers/FOCS_2025/DalzellGHMSNKB25/paper.pdf | {"paper_title": "A distillation–teleportation protocol for fault-tolerant QRAM", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: fault-tolerant QRAM from a noisy specialized device", "summary": "The paper gives a protocol for implementing logical QRAM fault tolerantly usi... | 36 | 109 |
DiakonikolasK25 | Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models | Ilias Diakonikolas; Daniel M. Kane | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00064 | conf/focs/DiakonikolasK25 | https://dblp.org/rec/conf/focs/DiakonikolasK25 | data/papers/FOCS_2025/DiakonikolasK25/paper.pdf | {"paper_title": "Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "General implicit high-order moment tensor estimation and learning applications", "summary": "The paper develops a general polynomial-time frame... | 42 | 145 |
DiakonikolasKLP25 | PTF Testing Lower Bounds for Non-Gaussian Component Analysis | Ilias Diakonikolas; Daniel M. Kane; Sihan Liu; Thanasis Pittas | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00107 | conf/focs/DiakonikolasKLP25 | https://dblp.org/rec/conf/focs/DiakonikolasKLP25 | data/papers/FOCS_2025/DiakonikolasKLP25/paper.pdf | {"paper_title": "PTF Testing Lower Bounds for Non-Gaussian Component Analysis", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "First non-trivial PTF testing lower bounds via NGCA", "summary": "The paper studies lower bounds against low-degree Polynomial Threshold Function tests, a stronger... | 22 | 37 |
GallNT25 | Group Order is in QCMA | François Le Gall; Harumichi Nishimura; Dhara Thakkar | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00059 | conf/focs/GallNT25 | https://dblp.org/rec/conf/focs/GallNT25 | data/papers/FOCS_2025/GallNT25/paper.pdf | {"paper_title": "Group Order is in QCMA", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: Group Order Verification is in QCMA", "summary": "The paper proves that the order of a finite black-box group can be verified with a classical witness and a polynomial-time quantum verifie... | 58 | 182 |
GhaffariG25 | Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set | Mohsen Ghaffari 0001; Christoph Grunau | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00139 | conf/focs/GhaffariG25 | https://dblp.org/rec/conf/focs/GhaffariG25 | data/papers/FOCS_2025/GhaffariG25/paper.pdf | {"paper_title": "Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contribution", "summary": "The paper develops a new deterministic parallel derandomization framework ba... | 40 | 107 |
GolowichG25 | Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks | Louis Golowich; Venkatesan Guruswami | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00082 | conf/focs/GolowichG25 | https://dblp.org/rec/conf/focs/GolowichG25 | data/papers/FOCS_2025/GolowichG25/paper.pdf | {"paper_title": "Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: near-good quantum codes with transversal CCZ and sublinear checks", "summary": "The paper constructs the... | 46 | 121 |
GoosHIS25 | Sign-Rank of k-Hamming Distance is Constant | Mika Göös; Nathaniel Harms; Valentin Imbach; Dmitry Sokolov 0001 | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00123 | conf/focs/GoosHIS25 | https://dblp.org/rec/conf/focs/GoosHIS25 | data/papers/FOCS_2025/GoosHIS25/paper.pdf | {"paper_title": "Sign-Rank of k-Hamming Distance is Constant", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: k-Hamming Distance has constant sign-rank", "summary": "The paper proves that the sign-rank of the exact k-Hamming Distance matrix is bounded by 2^{O(k)}, independent ... | 61 | 178 |
GregorioDFS25 | Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade | Simone Di Gregorio 0001; Paul Dütting; Federico Fusco 0001; Chris Schwiegelshohn | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00083 | conf/focs/GregorioDFS25 | https://dblp.org/rec/conf/focs/GregorioDFS25 | data/papers/FOCS_2025/GregorioDFS25/paper.pdf | {"paper_title": "Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: learning profit-optimal bilateral trade mechanisms", "summary": "The paper studies repeated bilateral trade from the broker's perspecti... | 28 | 50 |
Gupta25 | Improved 2-Approximate Shortest Paths for close vertex pairs | Manoj Gupta 0002 | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00065 | conf/focs/Gupta25 | https://dblp.org/rec/conf/focs/Gupta25 | data/papers/FOCS_2025/Gupta25/paper.pdf | {"paper_title": "Improved 2-Approximate Shortest Paths for close vertex pairs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: near-quadratic 2-approximation for much closer pairs", "summary": "The paper gives the first improvement in over 25 years on computing 2-approximate s... | 48 | 172 |
GuptaKLSY25 | A Little Clairvoyance Is All You Need | Anupam Gupta 0001; Haim Kaplan; Alexander Lindermayr; Jens Schlöter; Sorrachai Yingchareonthawornchai | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00010 | conf/focs/GuptaKLSY25 | https://dblp.org/rec/conf/focs/GuptaKLSY25 | data/papers/FOCS_2025/GuptaKLSY25/paper.pdf | {"paper_title": "A Little Clairvoyance Is All You Need", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: constant competitiveness from any positive clairvoyance", "summary": "The paper studies online single-machine flow-time minimization in the ε-clairvoyant model, where ... | 59 | 187 |
HarveyH25 | Integer multiplication is at least as hard as matrix transposition | David Harvey; Joris van der Hoeven | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00072 | conf/focs/HarveyH25 | https://dblp.org/rec/conf/focs/HarveyH25 | data/papers/FOCS_2025/HarveyH25/paper.pdf | {"paper_title": "INTEGER MULTIPLICATION IS AT LEAST AS HARD AS MATRIX TRANSPOSITION", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main thesis: transposition reduces to multiplication", "summary": "The paper proves that, on multitape Turing machines, matrix transposition can be reduced t... | 51 | 161 |
HsiehLMRZ25 | Explicit Lossless Vertex Expanders | Jun-Ting Hsieh; Alexander Lubotzky; Sidhanth Mohanty; Assaf Reiner; Rachel Yun Zhang | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00046 | conf/focs/HsiehLMRZ25 | https://dblp.org/rec/conf/focs/HsiehLMRZ25 | data/papers/FOCS_2025/HsiehLMRZ25/paper.pdf | {"paper_title": "Explicit Lossless Vertex Expanders", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "First explicit constant-degree lossless vertex expanders", "summary": "The paper gives the first explicit deterministic construction of constant-degree lossless vertex expanders, resolving ... | 55 | 156 |
HuKLYZZ25 | Static Retrieval Revisited: To Optimality and Beyond | Yang Hu; William Kuszmaul; Jingxun Liang; Huacheng Yu; Junkai Zhang; Renfei Zhou | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00126 | conf/focs/HuKLYZZ25 | https://dblp.org/rec/conf/focs/HuKLYZZ25 | data/papers/FOCS_2025/HuKLYZZ25/paper.pdf | {"paper_title": "Static Retrieval Revisited: To Optimality and Beyond", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Tight trade-offs for static retrieval and a way around them via augmented retrieval", "summary": "The paper proves a tight lower bound for the static retrieval problem, sh... | 48 | 123 |
HuangK25 | Parallel Repetition for Post-Quantum Arguments | Andrew Huang 0002; Yael Tauman Kalai | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00100 | conf/focs/HuangK25 | https://dblp.org/rec/conf/focs/HuangK25 | data/papers/FOCS_2025/HuangK25/paper.pdf | {"paper_title": "Parallel Repetition for Post-Quantum Arguments", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: post-quantum parallel repetition for public-coin and 3-message arguments", "summary": "The paper proves that parallel repetition amplifies soundness against q... | 57 | 191 |
HuangSWZ25 | Edge-weighted Matching in the Dark | Zhiyi Huang 0002; Enze Sun 0001; Xiaowei Wu 0001; Jiahao Zhao | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00043 | conf/focs/HuangSWZ25 | https://dblp.org/rec/conf/focs/HuangSWZ25 | data/papers/FOCS_2025/HuangSWZ25/paper.pdf | {"paper_title": "Edge-weighted Matching in the Dark", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contribution", "summary": "The paper studies oblivious bipartite matching with edge weights, where the algorithm knows vertex sets and weights but not which edges ex... | 56 | 145 |
HuangT25 | Obfuscation of Unitary Quantum Programs | Mi-Ying Miryam Huang; Er-Cheng Tang | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00088 | conf/focs/HuangT25 | https://dblp.org/rec/conf/focs/HuangT25 | data/papers/FOCS_2025/HuangT25/paper.pdf | {"paper_title": "Obfuscation of Unitary Quantum Programs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "First ideal obfuscation for approximately unitary quantum programs with quantum I/O", "summary": "The paper constructs the first quantum state obfuscation scheme in the classical oracl... | 57 | 175 |
KalachevP25 | Maximally Extendable Product Codes are Good Coboundary Expanders | Gleb Kalachev; Pavel Panteleev | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00079 | conf/focs/KalachevP25 | https://dblp.org/rec/conf/focs/KalachevP25 | data/papers/FOCS_2025/KalachevP25/paper.pdf | {"paper_title": "Maximally Extendable Product Codes are Good Coboundary Expanders", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: random code collections are product-expanding", "summary": "The paper proves that for any fixed number of component codes and any fixed target rat... | 47 | 128 |
KelleyL25 | More efficient sifting for grid norms, and applications to multiparty communication complexity | Zander Kelley; Xin Lyu | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00080 | conf/focs/KelleyL25 | https://dblp.org/rec/conf/focs/KelleyL25 | data/papers/FOCS_2025/KelleyL25/paper.pdf | {"paper_title": "More efficient sifting for grid norms, and applications to multiparty communication complexity", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contributions", "summary": "The paper improves the sifting method for grid norms of somewhat dense bipart... | 42 | 119 |
KesselheimMPS25 | Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives | Thomas Kesselheim; Marco Molinaro 0001; Kalen Patton; Sahil Singla 0001 | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00073 | conf/focs/KesselheimMPS25 | https://dblp.org/rec/conf/focs/KesselheimMPS25 | data/papers/FOCS_2025/KesselheimMPS25/paper.pdf | {"paper_title": "Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Integral online algorithms via packing reductions and random activation", "summary": "The paper develops direct integral online algorithms fo... | 56 | 167 |
KhouryS25 | Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching | Seri Khoury; Aaron Schild | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00120 | conf/focs/KhouryS25 | https://dblp.org/rec/conf/focs/KhouryS25 | data/papers/FOCS_2025/KhouryS25/paper.pdf | {"paper_title": "Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result and self-reduction framework", "summary": "The paper proves a new randomized LOCAL lower bound for maximal matching: Ω(min{log Δ... | 43 | 156 |
KleinbergW25 | Density Measures for Language Generation | Jon M. Kleinberg; Fan Wei | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00034 | conf/focs/KleinbergW25 | https://dblp.org/rec/conf/focs/KleinbergW25 | data/papers/FOCS_2025/KleinbergW25/paper.pdf | {"paper_title": "Density Measures for Language Generation", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contributions", "summary": "The paper studies breadth in language generation in the limit by measuring how dense an algorithm's outputs are inside the true lan... | 40 | 111 |
KookV25 | Faster Logconcave Sampling from a Cold Start in High Dimension | Yunbum Kook; Santosh S. Vempala | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00052 | conf/focs/KookV25 | https://dblp.org/rec/conf/focs/KookV25 | data/papers/FOCS_2025/KookV25/paper.pdf | {"paper_title": "Faster Logconcave Sampling from a Cold Start in High Dimension", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Sub-cubic cold-start sampling via relaxed warmness and improved LSI", "summary": "The paper gives the first sub-cubic algorithms for sampling convex bodies and g... | 48 | 149 |
KothariMW25 | Overcomplete Tensor Decomposition via Koszul-Young Flattenings | Pravesh K. Kothari; Ankur Moitra; Alexander S. Wein | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00098 | conf/focs/KothariMW25 | https://dblp.org/rec/conf/focs/KothariMW25 | data/papers/FOCS_2025/KothariMW25/paper.pdf | {"paper_title": "Overcomplete Tensor Decomposition via Koszul–Young Flattenings", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: decomposition up to nearly n2+n3 via Koszul–Young flattenings", "summary": "The paper gives a polynomial-time algorithm for rank detection, de... | 41 | 129 |
KumarS25 | Almost Tight Additive Guarantees for k-Edge-Connectivity | Nikhil Kumar 0001; Chaitanya Swamy | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00014 | conf/focs/KumarS25 | https://dblp.org/rec/conf/focs/KumarS25 | data/papers/FOCS_2025/KumarS25/paper.pdf | {"paper_title": "Almost Tight Additive Guarantees for k-Edge-Connectivity", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of nearly tight additive guarantees for k-edge connectivity", "summary": "The paper gives LP-rounding algorithms for k-ECSS that trade a small additive loss i... | 42 | 136 |
KuszmaulLZ25 | Fingerprint Filters Are Optimal | William Kuszmaul; Jingxun Liang; Renfei Zhou | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00055 | conf/focs/KuszmaulLZ25 | https://dblp.org/rec/conf/focs/KuszmaulLZ25 | data/papers/FOCS_2025/KuszmaulLZ25/paper.pdf | {"paper_title": "Fingerprint Filters Are Optimal", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: fingerprint-filter space is optimal for dynamic filters", "summary": "The paper proves a sharp information-theoretic lower bound for dynamic approximate membership filters. It sho... | 46 | 118 |
Larrauri25 | Ineffectiveness for Search and Undecidability of PCSP Meta-Problems | Alberto Larrauri | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00070 | conf/focs/Larrauri25 | https://dblp.org/rec/conf/focs/Larrauri25 | data/papers/FOCS_2025/Larrauri25/paper.pdf | {"paper_title": "Ineffectiveness for Search and Undecidability of PCSP Meta-Problems", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contribution: hardness of rounding and undecidable meta-problems for PCSP algorithms", "summary": "The paper studies whether standard tractability algo... | 44 | 148 |
LeviMS25 | Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent | Matan Levi; Jonathan Mosheiff; Nikhil Shagrithaya | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00112 | conf/focs/LeviMS25 | https://dblp.org/rec/conf/focs/LeviMS25 | data/papers/FOCS_2025/LeviMS25/paper.pdf | {"paper_title": "Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main equivalence between random RS codes and random linear codes", "summary": "The paper shows that for a broad class of local linear-combinatorial pro... | 46 | 144 |
LiLZ25 | Adaptivity Gaps for Stochastic Probing with Subadditive Functions | Jian Li; Yinchen Liu; Yiran Zhang | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00012 | conf/focs/LiLZ25 | https://dblp.org/rec/conf/focs/LiLZ25 | data/papers/FOCS_2025/LiLZ25/paper.pdf | {"paper_title": "Adaptivity Gaps for Stochastic Probing with Subadditive Functions", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main contributions on adaptivity gaps for norms and subadditive objectives", "summary": "The paper studies stochastic probing with prefix-closed constraints a... | 72 | 236 |
LiTZ25 | Paths and Intersections: Exact Emulators for Planar Graphs | George Z. Li; Zihan Tan; Tianyi Zhang | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00101 | conf/focs/LiTZ25 | https://dblp.org/rec/conf/focs/LiTZ25 | data/papers/FOCS_2025/LiTZ25/paper.pdf | {"paper_title": "Paths and Intersections: Exact Emulators for Planar Graphs", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Exact planar emulators of size O(f^2 k^2)", "summary": "The paper studies exact distance-preserving planar emulators for planar graphs with terminals lying on at mos... | 28 | 41 |
MancinskaSSV25 | Gap-preserving reductions and RE-completeness of independent set games | Laura Mancinska; Pieter Spaas; Taro Spirig; Matthijs Vernooij | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00056 | conf/focs/MancinskaSSV25 | https://dblp.org/rec/conf/focs/MancinskaSSV25 | data/papers/FOCS_2025/MancinskaSSV25/paper.pdf | {"paper_title": "Gap-preserving reductions and RE-completeness of independent set games", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: gap-preserving reduction to independent set games", "summary": "The paper develops a framework for gap-preserving reductions between gapped ... | 51 | 144 |
MenuhinN25 | Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations | Boaz Menuhin; Moni Naor | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00122 | conf/focs/MenuhinN25 | https://dblp.org/rec/conf/focs/MenuhinN25 | data/papers/FOCS_2025/MenuhinN25/paper.pdf | {"paper_title": "Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Tight memory-vs-predictability tradeoff for permutation generation", "summary": "The paper studies how well a memory-limited Dealer can... | 59 | 155 |
NagdaR25 | On optimal distinguishers for Planted Clique | Ansh Nagda; Prasad Raghavendra | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00090 | conf/focs/NagdaR25 | https://dblp.org/rec/conf/focs/NagdaR25 | data/papers/FOCS_2025/NagdaR25/paper.pdf | {"paper_title": "On optimal distinguishers for Planted Clique", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contributions", "summary": "The paper studies the best distinguishing advantage achievable by efficient algorithms for Planted Clique. Assuming the Planted... | 59 | 185 |
OkoroaforKK25 | Near-Optimal Algorithms for Omniprediction | Princewill Okoroafor; Robert Kleinberg; Michael P. Kim | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00084 | conf/focs/OkoroaforKK25 | https://dblp.org/rec/conf/focs/OkoroaforKK25 | data/papers/FOCS_2025/OkoroaforKK25/paper.pdf | {"paper_title": "Near-Optimal Algorithms for Omniprediction", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Paper overview and main contributions", "summary": "The paper develops near-optimal algorithms for omniprediction in both online and offline settings. Its central message is that on... | 38 | 98 |
Sellke25 | Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses | Mark Sellke | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00137 | conf/focs/Sellke25 | https://dblp.org/rec/conf/focs/Sellke25 | data/papers/FOCS_2025/Sellke25/paper.pdf | {"paper_title": "TIGHT LOW DEGREE HARDNESS FOR OPTIMIZING PURE SPHERICAL SPIN GLASSES", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Main result: stable and low-degree algorithms cannot beat ALG(p)", "summary": "The paper proves that constant-degree polynomial algorithms, and more genera... | 51 | 166 |
SrivastavaT25 | List Decoding Expander-Based Codes up to Capacity in Near-Linear Time | Shashank Srivastava; Madhur Tulsiani | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00077 | conf/focs/SrivastavaT25 | https://dblp.org/rec/conf/focs/SrivastavaT25 | data/papers/FOCS_2025/SrivastavaT25/paper.pdf | {"paper_title": "List Decoding Expander-Based Codes up to Capacity in Near-Linear Time", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Regularity-based framework for fast list decoding and recovery of expander codes", "summary": "The paper develops a general framework using weak graph reg... | 57 | 155 |
Wang25 | Shortest Paths on Convex Polyhedral Surfaces | Haitao Wang 0001 | 2,025 | FOCS 2025 | 10.1109/FOCS63196.2025.00121 | conf/focs/Wang25 | https://dblp.org/rec/conf/focs/Wang25 | data/papers/FOCS_2025/Wang25/paper.pdf | {"paper_title": "Shortest Paths on Convex Polyhedral Surfaces", "paper_url": null, "nodes": [{"id": "node_01", "type": "overview", "title": "Overview of improved shortest-path data structures and edge-sequence algorithm", "summary": "The paper studies exact shortest paths on convex polyhedral surfaces. Its main contrib... | 56 | 172 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.