Skip to content
  • Architecture and Hardware
  • Artificial Intelligence and Machine Learning
  • Computer History
  • Computing Applications
  • Computing Profession
  • Data and Information
  • Education
  • HCI
  • Philosophy of Computing
  • Security and Privacy
  • Society
  • Software Engineering and Programming Languages
  • Systems and Networking
  • Theory
September 2025 cover

Latest Issue

September 2025, Vol. 68 No. 9

Previous Issue

August 2025, Vol. 68 No. 8
Explore the archive
Search
  • Settings
  • Sign Out
Sign In
Join ACM

Topics

  • Architecture and Hardware
  • Artificial Intelligence and Machine Learning
  • Computer History
  • Computing Applications
  • Computing Profession
  • Data and Information
  • Education
  • HCI
  • Philosophy of Computing
  • Security and Privacy
  • Society
  • Software Engineering and Programming Languages
  • Systems and Networking
  • Theory

Sections

  • Research and Advances
  • Opinion
  • Practice
  • News
  • Research Highlights
  • Careers

Magazine

  • Latest Issue
  • Magazine Archive
  • Editorial Staff and Board
  • Submit an Article
  • Alerts & Feeds
  • Author Guidelines

CACM Web Account

Membership in ACM includes a subscription to Communications of the ACM (CACM), the computing industry's most trusted source for staying connected to the world of advanced computing.

Sign In Sign Up

Communications of the ACM

  • About Us
  • Frequently Asked Questions
  • Contact Us

Follow Us

  • CACM on Twitter
  • CACM on Reddit
  • CACM on LinkedIn

October 1979 - Vol. 22 No. 10

October 1979 issue cover image
  • Share
    • Twitter
    • Reddit
    • Hacker News
  • Join the Discussion
  • View in the ACM Digital Library

Features

Research and Advances Oct 1 1979

Comment on “an optimal evaluation of Boolean expressions in an online query system”

P. D. Laird
Research and Advances Oct 1 1979

On the proof of correctness of a calendar program

Leslie Lamport
Research and Advances Oct 1 1979

Line numbers made cheap

Paul Klint
Research and Advances Oct 1 1979

An algorithm for planning collision-free paths among polyhedral obstacles

Tomás Lozano-Pérez and Michael A. Wesley
Opinion Oct 1 1979

ACM forum

Robert L. Ashenhurst

Advertisement

Recent Issues

Explore the Issue Archive
  1. September 2025 cover
    September 2025 Vol. 68 No. 9
  2. August 2025 cover
    August 2025 Vol. 68 No. 8
  3. July 2025 cover
    July 2025 Vol. 68 No. 7
  4. June 2025 CACM cover
    June 2025 Vol. 68 No. 6
  • Publication Policies
  • Send us Feedback
  • Send a Letter to the Editor
  • Contact the Publisher
  • Contact the Editor-in-Chief

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More
  • Previous Issue
  • Next Issue
  • CACM on Twitter
  • CACM on Reddit
  • CACM on LinkedIn

Topics

  • Architecture and Hardware
  • Artificial Intelligence and Machine Learning
  • Computer History
  • Computing Applications
  • Computing Profession
  • Data and Information
  • Education
  • HCI
  • Philosophy of Computing
  • Security and Privacy
  • Society
  • Software Engineering and Programming Languages
  • Systems and Networking
  • Theory

Magazine

  • Latest Issue
  • Magazine Archive
  • Editorial Staff and Board
  • Submit an Article
  • Alerts & Feeds
  • Author Guidelines

Communications of the ACM

  • About Us
  • Frequently Asked Questions
  • Contact Us
  • For Advertisers
  • Join ACM

© 2025 Communications of the ACM. All Rights Reserved.

  • Cookie Notice
  • Privacy Policy