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.

The Empirical Validation Gap 12
Transitioning from Monte Carlo to Deterministic Graph Algorithms 10
Proving Computational Intractability Through Hardness Reductions 6
Managing Hidden Constant Overhead in Algorithm Design 4
Tightening Theoretical Bounds by Optimizing Constant Factors 4
Overcoming Fundamental Impossibilities in Mechanism Design 4
Combinatorial Bounds for Graph Cut Enumeration 3
Overcoming Dependencies in Probabilistic Existence Proofs 3
Smoothed Analysis of Algorithms and Complexity 3
Approximating Asymmetric Traveling Salesman Problems via Integrality Gaps 3
Generalizing Graph Algorithms to Directed and Weighted Networks 3
From Fractional Solutions to Discrete Decisions 3
Tightening the Approximation Hardness Gap 3
Robust Algorithms Against Adaptive Adversaries 3
Oracle Efficient Reductions for Online Learning 2

Top Authors

AuthorPapers
Christos Papadimitriou23
Joseph Halpern22
Andrew C Yao10
Tim Roughgarden9
Nir N Shavit7
Robert Kleinberg7
Yishay Mansour7
Anupam Gupta6
Aravind Srinivasan6
Kurt Mehlhorn6
Sanjeev Arora6
Aleksandrs Slivkins5
Alexandros Hollender5
Daniel Rosenkrantz5
Maria Florina Balcan5
Martin Grohe5
Michael Jordan5
MohammadTaghi Hajiaghayi5
Rachid Guerraoui5
Rajeev Alur5

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Axiomatic Definitions of Programming Languages: A Theoretical Assessment1982
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions1982
Inference of Reversible Languages1982
On Parallel Computation for the Knapsack Problem1982
The complexity of restricted spanning tree problems1982
A Lower Bound to Finding Convex Hulls1981
On the complexity of integer programming1981
Should Tables Be Sorted?1981
Codes: Unequal Probabilities, Unequal Letter Cost1980
Computations of Bilinear Forms over Finite Fields1980
External Hashing Schemes for Collections of Data Structures1980
Flowshop scheduling with limited temporary storage1980
Information Bounds Are Weak in the Shortest Distance Problem1980
New Algorithms for Bin Packing1980
Optimality of the Fast Fourier transform1979
The serializability of concurrent database updates1979
k+1 Heads Are Better than k1978
The Analysis of Hashing Techniques That Exhibit k-ary Clustering1978
A Study of Schedules as Models of Synchronous Parallel Computation1977
On Equivalence and Containment Problems for Formal Languages1977
On Time Versus Space1977
Lower Bounds on Merging Networks1976
On the complexity of edge traversing1976
Efficient Planarity Testing1974
An Overview of the Theory of Computational Complexity1971
Two-way balloon automata and AFL1970
Programmed Grammars and Classes of Formal Languages1969
Some Results on Tape-Bounded Turing Machines1969
Decidable and Undecidable Questions About Automata1968
Relations Between Time and Tape Complexities1968
Matrix Equations and Normal Forms for Context-Free Grammars1967
An Investigation of Some Computational Aspects of Integer Programming1965

« prev Page 11/11