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
Most published authors
FOCS papers
4,193 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2022 | Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. | Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein |
| 2022 | Streaming Facility Location in High Dimension via Geometric Hashing. | Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Vesel, Mingwei Yang |
| 2022 | Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring. | Gil Cohen, Tal Yankovitz |
| 2022 | Correlation Clustering with Sherali-Adams. | Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman |
| 2022 | Fitting Metrics and Ultrametrics with Minimum Disagreements. | Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay |
| 2022 | Factorial Lower Bounds for (Almost) Random Order Streams. | Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price |
| 2022 | Memory Bounds for Continual Learning. | Xi Chen, Christos H. Papadimitriou, Binghui Peng |
| 2022 | Survivable Network Design Revisited: Group-Connectivity. | Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang |
| 2022 | Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. | Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2022 | On Weighted Graph Sparsification by Linear Sketching. | Yu Chen, Sanjeev Khanna, Huan Li |
| 2022 | Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains (extended abstract). | Yuansi Chen, Ronen Eldan |
| 2022 | Optimal mixing for two-state anti-ferromagnetic spin systems. | Xiaoyu Chen, Weiming Feng, Yitong Yin, Xinyuan Zhang |
| 2022 | Tight Bounds for Quantum State Certification with Incoherent Measurements. | Sitan Chen, Jerry Li, Brice Huang, Allen Liu |
| 2022 | Constant Approximation of Min-Distances in Near-Linear Time. | Shiri Chechik, Tianyi Zhang |
| 2022 | Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz |
| 2022 | Improved Lower Bounds for Submodular Function Minimization. | Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford |
| 2022 | Algorithms for the ferromagnetic Potts model on expanders. | Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap |
| 2022 | Shortest Paths without a Map, but with an Entropic Regularizer. | Sbastien Bubeck, Christian Coester, Yuval Rabani |
| 2022 | A Characterization of Multiclass Learnability. | Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff |
| 2022 | Determinant Maximization via Matroid Intersection Algorithms. | Adam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali |
| 2022 | The Power of Uniform Sampling for Coresets. | Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer, Chris Schwiegelshohn, Mads Bech Toftrup, Xuan Wu |
| 2022 | Fast Deterministic Fully Dynamic Distance Approximation. | Jan van den Brand, Sebastian Forster, Yasamin Nazari |
| 2022 | New Additive Spanner Lower Bounds by an Unlayered Obstacle Product. | Greg Bodwin, Gary Hoppenworth |
| 2022 | Nearly Optimal Communication and Query Complexity of Bipartite Matching. | Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | Fast Multivariate Multipoint Evaluation Over All Finite Fields. | Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans |
476–500 of 4,193← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing
- AALENEXWorkshop on Algorithm Engineering and Experiments