acm-header
Sign In

Communications of the ACM

Table of Contents


Format effectors in ISO7 and ASCII


Additional comments on a problem in concurrent programming control


Call for information: law and data processing


Aesop and the referee: a fable


More on processing 64-channel cards


President's letter to the ACM membership

Computer programming deals with an enormous variety of activities and is carried on by people with a great variety of backgrounds. It seems clear that part but not all of this activity is evolving toward a distinct professional …

The emergence of a profession

Computer programming deals with an enormous variety of activities and is carried on by people with a great variety of backgrounds. It seems clear that part but not all of this activity is evolving toward a distinct professional …

A reply to Fulkerson's comments


Should there be a CS undergraduate program?


Application of level changing to a multilevel storage organization

A technique for organizing the devices of a computer storage system is described. This technique, called the multilevel store, provides a means for economically satisfying the requirements for very large storage capacities of …

Structure of a LISP system using two-level storage

In an ideal list-processing system there would be enough core memory to contain all the data and programs. Described in this paper are a number of techniques that have been used to build a LISP system utilizing a drum for its …

On the automatic simplification of source-language programs

Methods of simplification that can be applied automatically to programs written in an ALGOL-like language are discussed. The simplifications are based on the form of the program and the knowledge obtained by a processor, without …

Automatic dimensioning

Examples of algorithms that will accomplish automatic storage reservation without the need for explicit array declarations are described.

An application of FORMAC

A nonlinear circuit analysis problem is stated and the way in which it was solved using FORMAC is indicated. The solution of the problem using FORMAC was notable since several other methods that were tried failed. The problem …

An efficient procedure for the generation of closed subsets

An efficient algorithm is described for generating subsets of a set S which satisfy constraints of the form: “If si is a member of the subset, then sj must also be a member of the subset.” The algorithm has been programmed in …

Computer typesetting of ALGOL

An application of computer-aided typesetting is introduced. A working method is described for publishing ALGOL by computerized translation from Hardware into Reference representation, computerized planning of typographical layout …

Methods of evaluating polynomial approximations in function evaluation routines

The method of nested multiplication is commonly used in function evaluation routines to evaluate approximation polynomials. New polynomial evaluation methods have been developed in recent years which require fewer multiplications …

Error-free methods for statistical computations

Neely has discussed computational error generated by some algorithms used to compute various statistics. In the present paper methods are described which are error-free, simple in concept, and usually less costly in machine time …

Algorithm 297: Eigenvalues and Eigenvectors of the symmetric system


Tensor calculations on computer: appendix

In the main text of the paper [Comm. ACM 9, 12 (Dec. 1966), 864], a FORMAC program was discussed which is capable of calculating various quantities of interest in tensor calculus. This Appendix is intended as an example of the …

An algorithm for generating root locus diagrams

A technique for using a digital computer to draw both ordinary and time-lag root locus diagrams is described. Ordinary diagrams are drawn much faster and more accurately than ever before. Time-lag diagrams, which had been impossible …

Remark on Algorithm 281: Abscissas and weights for Romberg quadrature


The Nebulous future of machine translation

A report by the National Academy of Sciences that examines machine translation against the light of human translation has disturbed a good many research administrators in the government. So much bad publicity has been engendered …

“Pānini-Backus Form” suggested