About

The Journal of the ACM (JACM) provides coverage of the most significant work on principles of computer science, broadly construed. The scope of research covered encompasses contributions of lasting value to any area of computer science. To be accepted, a paper must be judged to be truly outstanding in its field. JACM is interested in work in core computer science and in work at the boundaries, both the boundaries of subdisciplines of computer science and the boundaries between computer science and other fields.

Recent Articles

• Arik Rinberg, Idit Keidar. Intermediate Value Linearizability: A Quantitative Correctness Criterion. Journal of the ACM, 70(2), April 2023.
• James B. Orlin, László A. Végh. Directed Shortest Paths via Approximate Cost Balancing. Journal of the ACM, 70(1), February 2023.
• Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato. A Correctness and Incorrectness Program Logic. Journal of the ACM, 70(2), April 2023.
• Peyman Afshani, Pingan Cheng. Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. Journal of the ACM, 70(2), April 2023.
• Xavier Goaoc, Emo Welzl. Convex Hulls of Random Order Types. Journal of the ACM, 70(1), February 2023.
• Joachim Kock. Whole-grain Petri Nets and Processes. Journal of the ACM, 70(1), February 2023.
• Bruno Bauwens, Marius Zimand. Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. Journal of the ACM, 70(2), April 2023.
• John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Journal of the ACM, 70(1), February 2023.
• Haitao Wang 0001. A New Algorithm for Euclidean Shortest Paths in the Plane. Journal of the ACM, 70(2), April 2023.
• Moritz Lichter. Separating Rank Logic from Polynomial Time. Journal of the ACM, 70(2), April 2023.