Skip to content

IEEE Symposium on Foundations of Computer Science

FOCS

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

30.0% (2023)

Fields of research

Theory of Computation

Papers indexed

4,193

1960–2025

Papers per year

1960142 peak2025

FOCS papers

4,193 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2015Local Correlation Breakers and Applications to Three-Source Extractors and Mergers.Gil Cohen
2015New Unconditional Hardness Results for Dynamic and Online Problems.Raphal Clifford, Allan Grnlund, Kasper Green Larsen
2015Input Sparsity and Hardness for Robust Subspace Approximation.Kenneth L. Clarkson, David P. Woodruff
2015Approximate Modularity.Flavio Chierichetti, Abhimanyu Das, Anirban Dasgupta, Ravi Kumar
2015Mixture Selection, Mechanism Design, and Signaling.Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng
2015On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms.Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
2015Towards an Optimal Method for Dynamic Planar Point Location.Timothy M. Chan, Yakov Nekrich
2015Hardness of Approximation in PSPACE and Separation Results for Pebble Games.Siu Man Chan, Massimo Lauria, Jakob Nordstrm, Marc Vinyals
2015Pattern-Avoiding Access in Binary Search Trees.Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
2015A Holant Dichotomy: Is the FKT Algorithm Universal?Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams
2015Differentially Private Release and Learning of Threshold Functions.Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan
2015Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping.Karl Bringmann, Marvin Knnemann
2015Tight Hardness of the Non-commutative Grothendieck Problem.Jop Brit, Oded Regev, Rishi Saket
2015Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness.Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette
2015Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs.Charles Bordenave, Marc Lelarge, Laurent Massouli
2015Indistinguishability Obfuscation from Functional Encryption.Nir Bitansky, Vinod Vaikuntanathan
2015On the Cryptographic Hardness of Finding a Nash Equilibrium.Nir Bitansky, Omer Paneth, Alon Rosen
2015Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters.Dominic W. Berry, Andrew M. Childs, Robin Kothari
2015No Small Linear Program Approximates Vertex Cover within a Factor 2 - e.Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson
2015Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks.John Augustine, Gopal Pandurangan, Peter Robinson, Scott T. Roche, Eli Upfal
2015Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.Gilad Asharov, Gil Segev
2015Heavy-Tailed Independent Component Analysis.Joseph Anderson, Navin Goyal, Anupama Nandi, Luis Rademacher
2015Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP.Nima Anari, Shayan Oveis Gharan
2015Optimal Induced Universal Graphs and Adjacency Labeling for Trees.Stephen Alstrup, Sren Dahlgaard, Mathias Bk Tejs Knudsen
2015Welfare Maximization with Limited Interaction.Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
1,1761,200 of 4,193← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.