default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID57th STOC 2025: Prague, Czechia
- Michal Koucký, Nikhil Bansal:
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czechia, June 23-27, 2025. ACM 2025, ISBN 979-8-4007-1510-5
Best Papers
- Yeyuan Chen
, Zihan Zhang:
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. 1-12 - R. Ryan Williams:
Simulating Time with Square-Root Space. 13-23 - Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang:
Vizing's Theorem in Near-Linear Time. 24-35 - Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin:
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. 36-44 - Mitali Bafna, Dor Minzer, Nikhil Vyas, Zhiwei Yun:
Quasi-Linear Size PCPs with Small Soundness from HDX. 45-53
Session 2A
- Euiwoong Lee, Ola Svensson, Theophile Thiery:
Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. 54-61 - Amey Bhangale, Subhash Khot, Dor Minzer:
On Approximability of Satisfiable k-CSPs: V. 62-71 - Sergey Avvakumov, Marek Filakovský, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of 4-Colouring k-Colourable Graphs. 72-83 - Aaron Potechin, Jeff Xu:
Sum-of-Squares Lower Bounds for Coloring Random Graphs. 84-95 - Max Hopkins:
Hypercontractivity on HDX II: Symmetrization and q-Norms. 96-103 - Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer:
Parallel Repetition for 3-Player XOR Games. 104-110
Session 2B
- Tuukka Korhonen:
Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More. 111-119 - Ruoxu Cen, Jason Li, Debmalya Panigrahi:
Network Unreliability in Almost-Linear Time. 120-131 - Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Deterministic Dynamic Maximal Matching in Sublinear Update Time. 132-143 - Julia Chuzhoy, Ohad Trabelsi:
Breaking the O(m2n)-Time Barrier for Vertex-Weighted Global Minimum Cut. 144-155 - Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokolowski:
Fully Dynamic Biconnectivity in Õ(log² n) Time. 156-165 - Zhuan Khye Koh, Omri Weinstein, Sorrachai Yingchareonthawornchai:
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth. 166-177
Session 2C
- Dakshita Khurana, Kabir Tomer:
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P Hardness. 178-188 - William Kretschmer, Luowen Qian, Avishay Tal:
Quantum-Computable One-Way Functions without One-Way Functions. 189-200 - John Bostanci, Barak Nehoran, Mark Zhandry:
A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire. 201-212 - Aparna Gupte, Jiahui Liu, Justin Raizes, Bhaskar Roberts, Vinod Vaikuntanathan:
Quantum One-Time Programs, Revisited. 213-221 - Alexander Kulpe, Giulio Malavolta, Connor Paddock, Simon Schmidt, Michael Walter:
A Bound on the Quantum Value of All Compiled Nonlocal Games. 222-233 - Sam Gunn, Yael Tauman Kalai, Anand Natarajan, Ági Villányi:
Classical Commitments to Quantum States. 234-244
Session 2D
- Michael Jaber, Vinayak M. Kumar, David Zuckerman:
Linear Hashing Is Optimal. 245-255 - Alexandr Andoni, Shunhua Jiang, Omri Weinstein:
A Framework for Building Data Structures from Communication Protocols. 256-267 - Michael A. Bender, William Kuszmaul, Renfei Zhou:
Optimal Non-oblivious Open Addressing. 268-277 - Yang Hu, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou:
Optimal Static Dictionary with Worst-Case Constant Query Time. 278-289 - Dominik Kempa, Tomasz Kociumaka:
On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM. 290-300
4A
- Felix Joos, Marcus Kühn:
The Hypergraph Removal Process. 301-309 - Kiril Bangachev, Guy Bresler:
Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration. 310-321 - Huy Tuan Pham:
A Sharp Version of Talagrand's Selector Process Conjecture and an Application to Rounding Fractional Covers. 322-328 - Nemanja Draganic, Michael Krivelevich:
Disjoint Connected Dominating Sets in Pseudorandom Graphs. 329-335 - Asaf Ferber, Adva Mond:
Minimum Degree Edge-Disjoint Hamilton Cycles in Random Directed Graphs. 336-347 - Jason Gaitonde, Ankur Moitra, Elchanan Mossel:
Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics. 348-359
4B
- Mark Braverman, Or Zamir:
Optimality of Frequency Moment Estimation. 360-370 - Zengfeng Huang, Zhongzheng Xiong, Xiaoyi Zhu, Zhewei Wei:
Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models. 371-382 - Dingyu Wang:
Harmonic Decomposition in Data Sketches. 383-394 - Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou:
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness. 395-406 - Sanjeev Khanna, Aaron Putterman, Madhu Sudan:
Efficient Algorithms and New Characterizations for CSP Sparsification. 407-416 - Sepehr Assadi, Sanjeev Khanna, Aaron Putterman:
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. 417-428
4C
- Sitan Chen, Weiyuan Gong, Qi Ye, Zhihan Zhang:
Stabilizer Bootstrapping: A Recipe for Efficient Agnostic Tomography and Magic Estimation. 429-438 - Marcel Hinsche, Jonas Helsen:
Single-Copy Stabilizer Testing. 439-450 - Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco D'Amore, Massimo Equi, François Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren:
Distributed Quantum Advantage for Local Problems. 451-462 - Adam Bouland, Tudor Giurgica-Tiron, John Wright:
The State Hidden Subgroup Problem and an Efficient Algorithm for Locating Unentanglement. 463-470 - Jiaqing Jiang, Jielun Chen, Norbert Schuch, Dominik Hangleiter:
Positive Bias Makes Tensor-Network Contraction Tractable. 471-482
4D
- Tomer Ezra, Daniel Schoepflin, Ariel Shaulker:
Multi-parameter Mechanisms for Consumer Surplus Maximization. 483-494 - Nikolai Gravin, Jianhao Jia:
Approximation Guarantees of Median Mechanism in ℝᵈ. 495-506 - Eleni Batziou, John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani:
Monotone Contractions. 507-517 - Ashkan Soleymani, Georgios Piliouras, Gabriele Farina:
Faster Rates for No-Regret Learning in General Games via Cautious Optimism. 518-529 - Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm:
Computational Lower Bounds for No-Regret Learning in Normal-Form Games. 530-541 - Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Charilaos Pipis, Jon Schneider:
Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games. 542-553
5A
- James Cook, Jiatu Li, Ian Mertz, Edward Pyne:
The Structure of Catalytic Space: Capturing Randomness and Time via Compression. 554-564 - Yuting Fang, Mika Göös, Nathaniel Harms, Pooya Hatami:
Constant-Cost Communication Is Not Reducible to k-Hamming Distance. 565-571 - Simon Mackenzie, Abdallah Saffidine:
Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity. 572-583 - Yaroslav Alekseev, Dmitry Itsykson:
Lifting to Bounded-Depth and Regular Resolutions over Parities via Games. 584-595 - Marshall Ball, Ronen Shaltiel, Jad Silbak:
Extractors for Samplable Distributions with Low Min-Entropy. 596-603 - Eshan Chattopadhyay, Jesse Goodman:
Leakage-Resilient Extractors against Number-on-Forehead Protocols. 604-614
5B
- Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson:
A (2+ε)-Approximation Algorithm for Metric k-Median. 615-624 - Farzam Ebrahimnejad, Ansh Nagda, Shayan Oveis Gharan:
On Approximability of the Permanent of PSD Matrices. 625-630 - Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari:
Rounding Large Independent Sets on Expanders. 631-642 - Alan Chang, Assaf Naor, Kevin Ren:
Optimal Rounding for Sparsest Cut. 643-652 - Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr:
A 5/4-Approximation for Two-Edge Connectivity. 653-664 - Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Di Yue:
Near-Optimal Dimension Reduction for Facility Location. 665-676
5C
- Samuel Dai, Ray Li:
Locality vs Quantum Codes. 677-688 - Louis Golowich, Ting-Chun Lin:
Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes. 689-696 - Quynh T. Nguyen:
Good Binary Quantum Codes with Transversal CCZ Gate. 697-706 - Louis Golowich, Venkatesan Guruswami:
Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates. 707-717 - Jayadev Acharya, Abhilash Dharmavarapu, Yuhan Liu, Nengkun Yu:
Pauli Measurements Are Not Optimal for Single-Copy Tomography. 718-729 - Quynh T. Nguyen, Christopher A. Pattison:
Quantum Fault Tolerance with Constant-Space and Logarithmic-Time Overheads. 730-737 - André Chailloux, Jean-Pierre Tillich:
Quantum Advantage from Soft Decoders. 738-749
5D
- Matthias Christandl, Koen Hoeberechts, Harold Nieuwboer, Péter Vrana, Jeroen Zuiddam:
Asymptotic Tensor Rank Is Characterized by Polynomials. 750-755 - Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam:
Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information. 756-765 - Joshua A. Grochow, Youming Qiao:
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials IV: Linear-Length Reductions and Their Applications. 766-776 - Joshua A. Grochow, Youming Qiao, Katherine E. Stange, Xiaorui Sun:
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials V: Over Commutative Rings. 777-784 - Shuichi Hirahara, Nobutaka Shimizu:
Error-Correction of Matrix Multiplication Algorithms. 785-794 - Afonso S. Bandeira, Kevin Lucca, Petar Nizic-Nikolac, Ramon van Handel:
Matrix Chaos Inequalities and Chaos of Combinatorial Type. 795-805
6A
- Fermi Ma, Hsin-Yuan Huang:
How to Construct Random Unitaries. 806-809 - Swastik Kopparty, Mrinal Kumar, Harry Sha:
High Rate Multivariate Polynomial Evaluation Codes. 810-821 - Afonso S. Bandeira, Sivakanth Gopi, Haotian Jiang, Kevin Lucca, Thomas Rothvoss:
Tensor Concentration Inequalities: A Geometric Approach. 822-832 - Jun-Ting Hsieh, Ting-Chun Lin, Sidhanth Mohanty, Ryan O'Donnell, Rachel Yun Zhang:
Explicit Two-Sided Vertex Expanders beyond the Spectral Barrier. 833-842 - Fernando Granha Jeronimo, Tushant Mittal, Shashank Srivastava, Madhur Tulsiani:
Explicit Codes Approaching Generalized Singleton Bound using Expanders. 843-854 - Francisco Pernice, Oscar Sprumont, Mary Wootters:
List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel. 855-866
6B
- Zongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, Yitong Yin:
Counting Random k-SAT near the Satisfiability Threshold. 867-878 - Xiaoyu Chen, Zongchen Chen, Yitong Yin, Xinyuan Zhang:
Rapid Mixing at the Uniqueness Threshold. 879-890 - Youngtak Sohn, Alexander S. Wein:
Sharp Phase Transitions in Estimation with Low-Degree Polynomials. 891-902 - Jingcheng Liu, Chunyang Wang, Yitong Yin, Yixiao Yu:
Phase Transitions via Complex Extensions of Markov Chains. 903-914 - Brice Huang, Sidhanth Mohanty, Amit Rajaraman, David X. Wu:
Weak Poincaré Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses. 915-923 - Yunbum Kook, Santosh S. Vempala:
Sampling and Integration of Logconcave Functions by Algorithmic Diffusion. 924-932
6C
- Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan:
Universal SNARGs for NP from Proofs of Correctness. 933-943 - Liyan Chen, Cody Freitag, Zhengzhong Jin, Daniel Wichs:
Unambiguous SNARGs for P from LWE with Applications to PPAD Hardness. 944-954 - Liyan Chen, Zhengzhong Jin, Daniel Wichs:
Succinct Non-interactive Arguments of Proximity. 955-964 - Benny Applebaum, Oded Nir:
The Meta-complexity of Secret Sharing. 965-976 - Lijie Chen, Ron D. Rothblum, Roei Tell:
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). 977-985 - Tom Gur, Jack O'Connor, Nicholas Spooner:
A Zero-Knowledge PCP Theorem. 986-994
6D
- Renato Ferreira Pinto Jr., Nathaniel Harms:
Testing Support Size More Efficiently Than Learning Histograms. 995-1006 - Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Amit Levi, Gopinath Mishra, Sayantan Sen:
Testing vs Estimation for Index-Invariant Properties in the Huge Object Model. 1007-1018 - Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten:
Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. 1019-1030 - Cameron Seth:
A Tolerant Independent Set Tester. 1031-1042 - Talya Eden, Reut Levi, Dana Ron, Ronitt Rubinfeld:
Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. 1043-1054 - Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Ronitt Rubinfeld:
Stochastic Matching via In-n-Out Local Computation Algorithms. 1055-1066
7A
- Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Characterizing and Testing Principal Minor Equivalence of Matrices. 1067-1078 - Abhibhav Garg, Rafael Oliveira, Nitin Saxena:
Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals. 1079-1086 - Robert Andrews, Deepanshu Kush, Roei Tell:
Polynomial-Time PIT from (Almost) Necessary Assumptions. 1087-1095 - Albert Atserias, Iddo Tzameret:
Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets. 1096-1107 - Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams:
When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. 1108-1117 - Igor Pak, Colleen Robichaux:
Vanishing of Schubert Coefficients. 1118-1129
7B
- Niv Buchbinder, Moran Feldman:
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. 1130-1141 - Neta Singer, Theophile Thiery:
Better Approximation for Weighted k-Matroid Intersection. 1142-1153 - Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang:
Solving the Correlation Cluster LP in Sublinear Time. 1154-1165 - Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad:
Fully Dynamic k-Median with Near-Optimal Update Time and Recourse. 1166-1177 - An La, Hung Le:
Dynamic Locality Sensitive Orderings in Doubling Metrics. 1178-1189 - Sanjeev Khanna, Huan Li, Aaron Putterman:
Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification. 1190-1200
7C
- Andrew Zhao:
Learning the Structure of Any Hamiltonian from Minimal Assumptions. 1201-1211 - Ainesh Bakshi, John Bostanci, William Kretschmer, Zeph Landau, Jerry Li, Allen Liu, Ryan O'Donnell, Ewin Tang:
Learning the Closest Product State. 1212-1221 - Saeed Mehraban, Mehrdad Tahmasbi:
Improved Bounds for Testing Low Stabilizer Complexity States. 1222-1233 - Srinivasan Arunachalam, Arkopal Dutt:
Polynomial-Time Tolerant Testing Stabilizer States. 1234-1241 - Pulkit Sinha:
Dimension Independent and Computationally Efficient Shadow Tomography. 1242-1253 - Zongbo Bao, Philippe van Dordrecht, Jonas Helsen:
Tolerant Testing of Stabilizer States with a Polynomial Gap via a Generalized Uncertainty Relation. 1254-1262 - Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez:
Testing and Learning Structured Quantum Hamiltonians. 1263-1270
7D
- Peter Davies-Peck:
On the Locality of the Lovász Local Lemma. 1271-1282 - Hagit Attiya, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Hash Tables. 1283-1294 - Amirreza Akbari, Xavier Coiteux-Roy, Francesco D'Amore, François Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Václav Rozhon, Jukka Suomela:
Online Locality Meets Distributed Quantum Computing. 1295-1306 - Yann Bourreau, Sebastian Brandt, Alexandre Nolin:
Faster Distributed Δ-Coloring via Ruling Subgraphs. 1307-1318 - Mitali Bafna, Dor Minzer:
Constant Degree Networks for Almost-Everywhere Reliable Transmission. 1319-1328
8A
- Fabian Egidy, Christian Glaßer:
Optimal Proof Systems for Complex Sets Are Hard to Find. 1329-1340 - Stefan Grosser, Marco Carmosino:
Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the Gap. 1341-1347 - Lijie Chen, Jiatu Li, Jingxun Liang:
Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin. 1348-1358 - Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov:
Supercritical Tradeoffs for Monotone Circuits. 1359-1370 - Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang:
Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. 1371-1382 - Josh Alman, Jingxun Liang:
Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification. 1383-1394
8B
- Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang:
Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations. 1395-1405 - Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam:
The Cost of Consistency: Submodular Maximization with Constant Recourse. 1406-1417 - Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Tight Results for Online Convex Paging. 1418-1429 - Enze Sun, Zhihao Gavin Tang, Yifan Wang:
Online Stochastic Matching with Unknown Arrival Order: Beating 0.5 against the Online Optimum. 1430-1441 - Rohan Ghuge, Sahil Singla, Yifan Wang:
Single-Sample and Robust Online Resource Allocation. 1442-1453 - Alireza AmaniHamedani, Ali Aouad, Amin Saberi:
Adaptive Approximation Schemes for Matching Queues. 1454-1464
8C
- Mika Göös, Tom Gur, Siddhartha Jain, Jiawei Li:
Quantum Communication Advantage in TFNP. 1465-1475 - Anurag Anshu, Yangjing Dong, Fengning Ou, Penghui Yao:
On the Computational Power of QAC0 with Barely Superlinear Ancillae. 1476-1487 - Cambyse Rouzé, Daniel Stilck França, Álvaro M. Alhambra:
Efficient Thermalization and Universal Quantum Computing with Quantum Gibbs Samplers. 1488-1495 - Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Vinod Vaikuntanathan, Katherine Van Kirk:
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth. 1496-1507 - Christian Majenz, Giulio Malavolta, Michael Walter:
Permutation Superposition Oracles for Quantum Query Lower Bounds. 1508-1519 - Jiahui Liu, Saachi Mutreja, Henry Yuen:
QMA vs QCMA and Pseudorandomness. 1520-1531
8D
- Natalie Collina, Surbhi Goel, Varun Gupta, Aaron Roth:
Tractable Agreement Protocols. 1532-1543 - Moshe Babaioff, Uriel Feige:
Share-Based Fairness for Arbitrary Entitlements. 1544-1555 - Maxwell Allman, Itai Ashlagi, Amin Saberi, Sophie H. Yu:
From Signaling to Interviews in Random Matching Markets. 1556-1567 - Ashish Goel, Mohak Goyal, Kamesh Munagala:
Metric Distortion of Small-Group Deliberation. 1568-1579 - Jugal Garg, Aniket Murhekar, John Qin:
Constant-Factor EFX Exists for Chores. 1580-1589 - Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang:
Six Candidates Suffice to Win a Voter Majority. 1590-1601
9A
- Joshua Cook, Dana Moshkovitz:
Time and Space Efficient Deterministic Decoders. 1602-1613 - Joshua Brakensiek, Venkatesan Guruswami:
Redundancy Is All You Need. 1614-1625 - Pachara Sawettamalya, Huacheng Yu:
Strong XOR Lemma for Information Complexity. 1626-1637 - Omar Alrabiah, Prabhanjan Ananth, Miranda Christ, Yevgeniy Dodis, Sam Gunn:
Ideal Pseudorandom Codes. 1638-1647 - Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan:
Improved PIR Schemes using Matching Vectors and Derivatives. 1648-1656 - Joey Rivkin, Gregory Valiant, Paul Valiant:
A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities. 1657-1667
9B
- Shuangping Li, Tselil Schramm, Kangjie Zhou:
Discrepancy Algorithms for the Binary Perceptron. 1668-1679 - Ilias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis Pittas:
Entangled Mean Estimation in High Dimensions. 1680-1688 - Ilias Diakonikolas, Samuel B. Hopkins, Ankit Pensia, Stefan Tiegel:
SoS Certifiability of Subgaussian Distributions and Its Algorithmic Applications. 1689-1700 - Ilias Diakonikolas, Samuel B. Hopkins, Ankit Pensia, Stefan Tiegel:
SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More. 1701-1709 - Siu On Chan, Hiu Tsun Ng:
How Random CSPs Fool Hierarchies: II. 1710-1721 - Tali Kaufman, Izhar Oppenheim, Shmuel Weinberger:
Coboundary Expansion of Coset Complexes. 1722-1731
9C
- Alkis Kalavasis, Anay Mehrotra, Grigoris Velegkas:
On the Limits of Language Generation: Trade-Offs between Hallucination and Mode-Collapse. 1732-1743 - Sitan Chen, Yuanzhi Li:
Provably Learning a Multi-head Attention Layer. 1744-1754 - Allen Liu, Ankur Moitra:
Model Stealing for Any Low-Rank Language Model. 1755-1761 - Lunjia Hu, Kevin Tian, Chutong Yang:
Omnipredicting Single-Index Models with Multi-index Models. 1762-1773 - Gautam Chandrasekaran, Adam R. Klivans:
Learning the Sherrington-Kirkpatrick Model Even at Low Temperature. 1774-1784 - Shafi Goldwasser, Jonathan Shafer, Neekon Vafa, Vinod Vaikuntanathan:
Oblivious Defense in ML Models: Backdoor Removal without Detection. 1785-1794
9D
- Boning Meng, Juqiu Wang, Mingji Xia:
The FPᴺᴾ versus #P Dichotomy for #EO. 1795-1806 - Daniel M. Kane, Anthony Ostuni, Kewen Wu:
Locally Sampleable Uniform Symmetric Distributions. 1807-1816 - Rohit Chatterjee, Srijita Kundu, Supartha Podder:
Uncloneable Quantum States Are Necessary as Proofs and Advice. 1817-1827 - Zeph Landau, Yunchao Liu:
Learning Quantum States Prepared by Shallow Circuits in Polynomial Time. 1828-1838 - Karoliina Lehtinen, Aditya Prakash:
The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently. 1839-1850 - Clotilde Bizière, Wojciech Czerwinski:
Reachability in One-Dimensional Pushdown Vector Addition Systems Is Decidable. 1851-1862
10A
- Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa:
Cryptographic Characterization of Quantum Advantage. 1863-1874 - Damiano Abram, Giulio Malavolta, Lawrence Roy:
Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits. 1875-1886 - Yuval Ishai, Yifan Song:
Protecting Computations against Continuous Bounded-Communication Leakage. 1887-1897 - Youlong Ding, Aayush Jain, Ilan Komargodski:
A New Approach for LPN-Based Pseudorandom Functions: Low-Depth and Key-Homomorphic. 1898-1909 - Kiril Bangachev, Guy Bresler, Stefan Tiegel, Vinod Vaikuntanathan:
Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations. 1910-1920 - Riddhi Ghosal, Isaac M. Hair, Aayush Jain, Amit Sahai:
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy k-LIN over Expanders. 1921-1932
10B
- Chun-Hung Liu, Youngho Yoo:
Disjoint Paths Problem with Group-Expressable Constraints. 1933-1943 - Jan Dreier, Szymon Torunczyk:
Merge-Width and First-Order Model Checking. 1944-1955 - Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi:
All-Pairs Shortest Paths with Few Weights per Node. 1956-1964 - Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. 1965-1974 - Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
Subexponential Parameterized Algorithms for Hitting Subgraphs. 1975-1984 - Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Output-Sensitive Approximate Counting via a Measure-Bounded Hyperedge Oracle, or: How Asymmetry Helps Estimate k-Clique Counts Faster. 1985-1996
10C
- Moïse Blanchard:
Agnostic Smoothed Online Learning. 1997-2006 - Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich, Robert Kleinberg, Princewill Okoroafor:
Breaking the T^(2/3) Barrier for Sequential Calibration. 2007-2018 - Vincent Cohen-Addad, Silvio Lattanzi, Chris Schwiegelshohn:
Almost Optimal PAC Learning for k-Means. 2019-2030 - Guy Blanc, Gregory Valiant:
Adaptive and Oblivious Statistical Adversaries Are Equivalent. 2031-2042 - Bogdan Chornomaz, Shay Moran, Tom Waknine:
On Reductions and Representations of Learning Problems in Euclidean Spaces. 2043-2054 - Josh Alman, Shivam Nadimpalli, Shyamal Patel, Rocco A. Servedio:
DNF Learning via Locally Mixing Random Walks. 2055-2061
10D
- Elchanan Mossel, Allan Sly, Youngtak Sohn:
Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor Graphs. 2062-2073 - Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Balázs Maga, Tamás Schwarcz:
Matroid Products via Submodular Coupling. 2074-2085 - Lin Chen, Yuchen Mao, Guochuan Zhang:
Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses. 2086-2097 - Michael Anastos, Matthew Kwan, Benjamin Moore:
Smoothed Analysis for Graph Isomorphism. 2098-2106 - Dmitriy Kunisky, Daniel A. Spielman, Alexander S. Wein, Xifan Yu:
Statistical Inference of a Ranked Community in a Directed Graph. 2107-2117
11A
- Mitali Bafna, Karthik C. S., Dor Minzer:
Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. 2118-2129 - Édouard Bonnet:
Treewidth Inapproximability and Tight ETH Lower Bound. 2130-2135 - Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu:
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. 2136-2144 - Karl Bringmann, Egor Gorbachev:
A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends. 2145-2156 - Egor Gorbachev, Tomasz Kociumaka:
Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. 2157-2166 - Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. 2167-2178
11B
- Kim-Manuel Klein, Janina Reuter:
Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm. 2179-2190 - Neekon Vafa, Vinod Vaikuntanathan:
Symmetric Perceptrons, Number Partitioning and Lattices. 2191-2202 - Li Chen, Andrei Graur, Aaron Sidford:
Accelerated Approximate Optimization of Multi-commodity Flows on Directed Graphs. 2203-2212 - Adrian Vladu:
Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices. 2213-2224 - Ruichen Jiang, Aryan Mokhtari, Francisco Patitucci:
Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods. 2225-2236 - Misha Ivkov, Tselil Schramm:
Fast, Robust Approximate Message Passing. 2237-2248
11C
- Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann:
Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. 2249-2256 - Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than:
Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. 2257-2268 - Sepehr Assadi, Gary Hoppenworth, Nicole Wein:
Covering Approximate Shortest Paths with DAGs. 2269-2280 - Jonathan Conroy, Arnold Filtser:
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs. 2281-2292 - Yonggang Jiang, Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness. 2293-2304 - Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai:
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations. 2305-2316
11D
- Shinwoo An, Eunjin Oh, Jie Xue:
Approximation Algorithms for the Geometric Multimatching Problem. 2317-2328 - Siu-Wing Cheng, Haoqiang Huang, Shuo Zhang:
Constant Approximation of Fréchet Distance in Strongly Subquadratic Time. 2329-2340 - Prashanti Anderson, Ainesh Bakshi, Mahbod Majid, Stefan Tiegel:
Sample-Optimal Private Regression in Polynomial Time. 2341-2349 - Ephraim Linder, Sofya Raskhodnikova, Adam D. Smith, Thomas Steinke:
Privately Evaluating Untrusted Black-Box Functions. 2350-2361 - Haim Kaplan, Yishay Mansour, Shay Moran, Uri Stemmer, Nitzan Tur:
On Differentially Private Linear Algebra. 2362-2373 - Xin Lyu, Kunal Talwar:
Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis. 2374-2385
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-07-15 20:52 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:
