Sign In

Communications of the ACM

Table of Contents

How should ACM publish computer research?

Norbert Wiener

A simple automatic derivative evaluation program

A procedure for automatic evaluation of total/partial derivatives of arbitrary algebraic functions is presented. The technique permits computation of numerical values of derivatives without developing analytical expressions for …

Investigation of a new analytical method for numerical derivative evaluation

A recently proposed analytical approach to numerical derivative evaluation is discussed. The technique is shown to be both accurate and easy to apply, though certain indicated modifications are required. Its use should greatly …

An alternate checksum method

To increase reliability of transmission between magnetic tape and core storage on an IBM 7090/7094, blocks or records of data are often assigned a word called a logical checksum. This is a number derived from the block by some …

Divide-and-correct methods for multiple precision division

A division problem is defined and notation to relate it to the problem of multiple precision operation in a digital computer is introduced. A basic divide-and-correct method for multiple precision division is formulated and its …

A method of syntax-checking ALGOL 60

A syntax checker was designed based on the syntax of ALGOL as described in the ALGOL 60 Report [Communications of the ACM, May 1960]. Since the definition of the elements of the language is recursive it seemed most desirable  …

A note on the formation of free list

The concept of an available-space list was introduced by Newell and Shaw [1] in 1957, and has since been incorporated into a number of different systems [2-5]. The available-space list (or “free list”) is a list of all available …

Algorithm 236: Bessel Functions of the First Kind

Algorithm 237: Greatest common divisor

Algorithm 239: Free field read

Algorithm 238: Conjugate gradient method

Remark on algorithm 162: XY move plotting

Certification of algorithm 209: Gauss

Comments on bit-sequencing of the ASCII in serial-by-bit data transmission

Remark on remarks on algorithm 48: of a complex number

Remark on algorithm 162: Near-minimax polynomial approximations and partitioning of intervals

A method of near-minimax polynomial approximation is described. As a by-product, this method provides a formula for an estimate of the maximum error associated with a given degree of approximation. Using this formula, a partitioning …

Machine controls for analysis of variance

A major problem in using the analysis of variance, as the number of factors increases, is the exponential rise in the number of interactions. Even though the experimenter may not be interested in these interactions it is impossible …

Final examination scheduling

A method for scheduling final examinations to yield a minimal number of student conflicts is described. The “minimization” is achieved by repetitively evaluating a nonlinear set of equations. Imbedded in the process is a random …

Formal parsing systems

Automatic syntactic analysis has recently become important for both natural language data processing and syntax-directed compilers. A formal parsing system G = (V, &mgr;, T, R) consists of two finite disjoint vocabularies, V and  …

A proposal on ACM organization

Comments on tape reels

In defense of the equivalence algorithm

Comments on computers in banking

President's letter to the ACM membership