World Library  
Flag as Inappropriate
Email this Article

Communications of the ACM

Communications of the ACM
Editor-in-chief Moshe Y. Vardi
Categories Computer science
Frequency Monthly
First issue 1957
Company Association for Computing Machinery
Country United States
Language English
Website .org.acmcacm
ISSN 0001-0782

Communications of the ACM is the monthly magazine of the Association for Computing Machinery (ACM). It was established in 1957, with Saul Rosen its first managing editor. It is sent to all ACM members.[1][2] Articles are intended for readers with backgrounds in all areas of computer science and information systems. The focus is on the practical implications of advances in information technology and associated management issues; ACM also publishes a variety of more theoretical journals.

The magazine straddles the boundary of a science magazine, trade magazine, and a scientific journal. While the content is subject to peer review, the articles published are often summaries of research that may also be published elsewhere. Material published must be accessible and relevant to a broad readership.[3]

From 1960 onward, CACM also published algorithms, expressed in ALGOL. The collection of algorithms later became known as the Collected Algorithms of the ACM.[4]


Notable articles

Some notable articles are:

  • The issue of what to call the then-fledgling field of computer science was raised by the editors of DATA-LINK in a letter to the editor in 1958. They called for giving the field a name "which is brief, definite, distinctive".[5] The call was echoed by a wide range of suggestions, including comptology (Quentin Correll),[6] hypology (P.A. Zaphyr),[7] and datalogy (Peter Naur).[8]
  • C. A. R. Hoare's Quicksort.[9]
  • Donald Loveland described in 1962 the DPLL algorithm, containing the essential algorithm on which most modern SAT solvers are based.[10]
  • The "Revised report on the algorithm language ALGOL 60": A landmark paper in programming language design describing the results of the international ALGOL committee.[11]
  • Kristen Nygaard and Ole-Johan Dahl's original paper on Simula-67.[12]
  • Edsger W. Dijkstra's famous letter inveighing against the use of GOTO.[13] The letter was reprinted in Jan 2008 in the 50th anniversary edition.[14]
  • Dijkstra's original paper on the THE operating system. This paper's appendix, arguably even more influential than its main body, introduced semaphore-based synchronization.[15]
  • Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman's first public-key cryptosystem (RSA).[16]

See also


  1. ^ Alain Chesnais (2013). "ACM's Annual Report for FY12". Communications of the ACM 56 (1): 11–15.  
  2. ^ Rosen's vita at
  3. ^ "Publications". Association for Computing Machinery. Retrieved 2011-12-05. 
  4. ^ Boisvert, Ronald F. (2000). "Mathematical software: past, present, and future". Mathematics and computers in simulation 54 (4): 227–241. 
  5. ^ Weiss, E. A.; Corley, Henry P. T. (1958). "Letters to the editor". Communications of the ACM 1 (4): 6.  
  6. ^ Communications of the ACM 1 (7): 2. 
  7. ^ Communications of the ACM 2 (1): 4. 
  8. ^ Naur, Peter (1966). "The science of datalogy". Communications of the ACM 9 (7): 485.  
  9. ^ C.A.R. Hoare (1961). "Partition: Algorithm 63, Quicksort: Algorithm 64, and Find: Algorithm 65". Communications of the ACM 4 (7): 321.  
  10. ^ M. Davis, G. Logemann, D. Loveland (1962). "A Machine Program for Theorem Proving". Communications of the ACM 5 (7): 394.  
  11. ^ Backus, J. W.; Wegstein, J. H.; Van Wijngaarden, A.; Woodger, M.; Nauer, P.; Bauer, F. L.; Green, J.; Katz, C.; McCarthy, J.; Perlis, A. J.; Rutishauser, H.; Samelson, K.; Vauquois, B. (1963). "Revised report on the algorithm language ALGOL 60". Communications of the ACM 6 (1): 1.  
  12. ^ K. Nygaard, O.-J. Dahl (1966). "Simula: An ALGOL-based simulation language". Communications of the ACM 9 (9): 671.  
  13. ^ E.W. Dijkstra (1968). "Go To statement considered harmful". Communications of the ACM 11 (3): 148.  
  14. ^ E.W. Dijkstra (2008) [1968]. "(A Look Back at) Go To Statement Considered Harmful".  
  15. ^ E.W. Dijkstra (1968). "Structure of the 'THE'-Multiprogramming System". Communications of the ACM 11 (5): 341.  
  16. ^ R.L. Rivest, A. Shamir, L.M. Adleman (1978). "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems". Communications of the ACM 21 (2): 120.  

External links

  • Official website
  • ISSN 0001-0782
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.