J. ACM
532 papers257 directions
The Journal of the ACM (J. ACM) is a long-standing publication venue for computer science research, with a history spanning from 1967 to the present. While it covers the breadth of computer science, it serves as a significant outlet for theoretical and foundational work in machine learning and artificial intelligence. The venue has published 677 papers in the analyzed corpus, reflecting a focus on rigorous mathematical analysis and the development of core computational principles.
Research at J. ACM frequently explores the intersection of complexity theory, geometry, and optimization. Key research directions include the complexity of geometric graph representations, matrix factorization, and the limits of convex relaxations. In the context of modern artificial intelligence, the journal features work on the generalization properties of overparameterized deep learning models, the gap between expressivity and learnability, and the geometric scaling of adversarial vulnerability. Other topics include multi-distribution learning, Weisfeiler-Leman refinements, and algorithmic game theory, such as envy-free cake-cutting.
The venue is associated with prominent researchers in the field, including Christos H. Papadimitriou, Joseph Halpern, Andrew Chi-Chih Yao, Tim Roughgarden, and Michael I. Jordan. Its role in the machine learning community is primarily centered on providing a forum for high-level theoretical contributions that establish the mathematical underpinnings of algorithms. This includes work on Steiner forests, planar min-cost flow, and the axiomatization of initial value problems, bridging the gap between abstract computational theory and practical algorithmic application.
Papers by Year
| 2026 | 8 |
| 2025 | 20 |
| 2024 | 21 |
| 2023 | 25 |
| 2022 | 30 |
| 2021 | 26 |
| 2020 | 26 |
| 2019 | 23 |
| 2018 | 21 |
| 2017 | 19 |
| 2016 | 23 |
| 2015 | 18 |
| 2014 | 18 |
| 2013 | 22 |
| 2012 | 15 |
| 2011 | 11 |
| 2010 | 16 |
| 2009 | 17 |
| 2008 | 11 |
| 2007 | 11 |
| 2006 | 8 |
| 2005 | 9 |
| 2004 | 13 |
| 2003 | 12 |
| 2002 | 8 |
| 2001 | 7 |
| 2000 | 14 |
| 1999 | 10 |
| 1998 | 10 |
| 1997 | 9 |
| 1996 | 3 |
| 1995 | 10 |
| 1994 | 19 |
| 1993 | 15 |
| 1992 | 6 |
| 1991 | 10 |
| 1990 | 5 |
| 1989 | 2 |
| 1988 | 4 |
| 1987 | 2 |
| 1986 | 6 |
| 1985 | 2 |
| 1984 | 7 |
| 1983 | 3 |
| 1982 | 6 |
| 1981 | 3 |
| 1980 | 6 |
| 1979 | 2 |
| 1978 | 2 |
| 1977 | 3 |
| 1976 | 2 |
| 1974 | 1 |
| 1971 | 1 |
| 1970 | 1 |
| 1969 | 2 |
| 1968 | 2 |
| 1967 | 1 |
| 1965 | 1 |
Top Research Directions
Research directions most represented by papers from this venue.
Top Authors
Impactful Papers
Papers from this venue that shaped research clusters.
Foundational
Noise-tolerant learning, the parity problem, and the statistical query model
foundational
Fundamental Limitations of the Statistic
2003
Algebraic Structures for Capturing the Provenance of SPARQL Queries
foundational
Non-Monotonic Data Provenance via Query
2016
Deciding First-Order Properties of Nowhere Dense Graphs
foundational
First Order Model Checking on Sparse Gra
2017
A random-sampling-based algorithm for learning intersections of halfspaces
foundational
Analyzing Log-Concave Distributions via
2010
Decomposable negation normal form
foundational
Treewidth Bounds for Knowledge Compilati
2001
Robust principal component analysis?
foundational
Convex Relaxation for Low Rank and Spars
2011
A learning theory approach to noninteractive database privacy
foundational
Protecting Global Dataset Properties Bey
2013
Sublinear optimization for machine learning
foundational
Scalable Statistical Inference via Subsa
2012
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
foundational
Strongly Polynomial Complexity Bounds fo
2004
Quantum lower bounds for the collision and the element distinctness problems
foundational
The Polynomial Method for Quantum Query
2004
Influential
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic C
influential
Symmetry Breaking in Anonymous Distribut
2020
Infinite-duration Bidding Games
influential
Bidding for Transitions in Graph Games
2019
Approaching the Chasm at Depth Four
influential
Approximating the Matrix Permanent
2014
Intrinsic Robustness of the Price of Anarchy
influential
Resource Augmentation for Online Algorit
2015
Sublinear optimization for machine learning
influential
The Empirical Validation Gap
2012
Directed Shortest Paths via Approximate Cost Balancing
influential
Algorithmic Complexity of Asymmetric Net
2023
Fast monte-carlo algorithms for finding low-rank approximations
influential
The Empirical Validation Gap
2004
A random-sampling-based algorithm for learning intersections of halfspaces
influential
Managing Hidden Constant Overhead in Alg
2010
Related Venues
Venues with the most similar research cluster distributions.
Esa67% similar · 632 papers
SODA66% similar · 2,036 papers
STOC66% similar · 1,631 papers
SIAM Journal on Computing65% similar · 966 papers
ICALP65% similar · 1,234 papers
FOCS63% similar · 1,306 papers
Approx-random59% similar · 404 papers
Stacs57% similar · 357 papers
ACM Trans. Algorithms57% similar · 355 papers
Fsttcs53% similar · 302 papers
Papers
« prev Page 11/11