Communications of the ACM
|Editor-in-chief||Moshe Y. Vardi|
|Company||Association for Computing Machinery|
Communications of the ACM is the monthly magazine of the Association for Computing Machinery (ACM). It was established in 1957 and is sent to all ACM members. 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.
- 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". The call was echoed by a wide range of suggestions, including comptology (Quentin Correll), hypology (P.A. Zaphyr), and datalogy (Peter Naur).
- C. A. R. Hoare's Quicksort.
- Martin Davis, George Logemann, and Donald Loveland described in 1962 the DPLL algorithm, containing the essential algorithm on which most modern SAT solvers are based.
- The "Revised report on the algorithm language ALGOL 60": A landmark paper in programming language design describing the results of the international ALGOL committee.
- Kristen Nygaard and Ole-Johan Dahl's original paper on Simula-67.
- Edsger W. Dijkstra's famous letter inveighing against the use of GOTO. The letter was reprinted in Jan 2008 in the 50th anniversary edition.
- 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.
- Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman's first public-key cryptosystem (RSA).
- Alain Chesnais (2013). "ACM's Annual Report for FY12". Communications of the ACM 56 (1): 11–15. doi:10.1145/2398356.2398362.
- "Publications". Association for Computing Machinery. Retrieved 2011-12-05.
- Weiss, E. A.; Corley, Henry P. T. (1958). "Letters to the editor". Communications of the ACM 1 (4): 6. doi:10.1145/368796.368802.
- Communications of the ACM 1 (7): 2. Missing or empty
- Communications of the ACM 2 (1): 4. Missing or empty
- Communications of the ACM 9 (7): 485. doi:10.1145/365719.366510. Missing or empty
- C.A.R. Hoare (1961). "Partition: Algorithm 63, Quicksort: Algorithm 64, and Find: Algorithm 65". Communications of the ACM 4 (7): 321. doi:10.1145/366622.366644.
- M. Davis, G. Logemann, D. Loveland (1962). "A Machine Program for Theorem Proving". Communications of the ACM 5 (7): 394. doi:10.1145/368273.368557.
- 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. doi:10.1145/366193.366201.
- K. Nygaard, O.-J. Dahl (1966). "Simula: An ALGOL-based simulation language". Communications of the ACM 9 (9): 671. doi:10.1145/365813.365819.
- E.W. Dijkstra (1968). "Go To statement considered harmful". Communications of the ACM 11 (3): 148. doi:10.1145/362929.362947.
- E.W. Dijkstra (2008) . "(A Look Back at) Go To Statement Considered Harmful". Association for Computing Machinery. Retrieved 2008-06-12.
- E.W. Dijkstra (1968). "Structure of the 'THE'-Multiprogramming System". Communications of the ACM 11 (5): 341. doi:10.1145/363095.363143.
- 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. doi:10.1145/359340.359342.