Write in a clean editor, then format for Journal of the ACM in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Journal of the ACM is a peer-reviewed journal published by ACM, covering Complexity and Algorithms in Graphs, semigroups and automata theory, Logic, programming, and type systems. Over its lifetime it has published 3,296 papers, which have received 401,898 citations.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. Journal of the ACM 12, 3, Article 45 (2023).
Formats any DOI in Journal of the ACM style. No sign-up. |
| Publishes research in | Complexity and Algorithms in Graphs semigroups and automata theory Logic, programming, and type systems Algorithms and Data Compression Optimization and Search Problems |
| ISSN | 0004-5411 |
| Citation impact (2-yr) | 4.19 |
| h-index | 294 |
| i10-index | 2,343 |
| Top institutions publishing here | Massachusetts Institute of Technology |
| Journal website | jacm.acm.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a…
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It…
This article is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the low-rank and the sparse components exactly by solving a very…
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast,…
article Free Access`` Direct Search'' Solution of Numerical and Statistical Problems Authors: Robert Hooke Wesinghouse Research Laboratories, Pittsburgh, Pennsylvania Wesinghouse Research Laboratories, Pittsburgh, PennsylvaniaView Profile , T. A. Jeeves Wesinghouse Research Laboratories, Pittsburgh, Pennsylvania Wesinghouse Research Laboratories, Pittsburgh, PennsylvaniaView Profile Authors Info & Claims Journal of the ACMVolume 8Issue 2April 1961 pp 212–229https://doi.org/10.1145/321062.321069Published:01 April 1961Publication…
