Sign In

Communications of the ACM

Table of Contents


ACM president's letter: and in the corner …


A case study in programming for parallel-processors

An affirmative partial answer is provided to the question of whether it is possible to program parallel-processor computing systems to efficiently decrease execution time for useful problems. Parallel-processor systems are multiprocessor …

Is automatic “folding” of programs efficient enough to displace manual?

The operation of “folding” a program into the available memory is discussed. Measurements by Brawn et al. and by Nelson on an automatic folding mechanism of simple design, a demand paging unit built at the IBM Research Center …

Numerical analysis in a Ph.D. computer science program

Numerical Analysis is the study of methods and procedures used to obtain“approximate solutions” to mathematical problems. Much of the emphasis is on scientific calculation. The difficulties of education in such a broad area center …

Advanced cryptographic techniques for computer

Cryptographic techniques which can be used to maintain the confidentiality of information processed by computers are dealt with. Special emphasis is paid to the unique characteristics of computer files that make many cryptographic …

Optimization of expressions in Fortran

A method of optimizing the computation of arithmetic and indexing expressions of a Fortran program is presented. The method is based on a linear analysis of the definition points of the variables and the branching and DO loop …

On the downhill method

The downhill method is a numerical method for solving complex equations ƒ(z) = 0 on which the only restriction is that the function w = ƒ(z) must be analytical. An introduction to this method is given and a critical review of …

Productivity of multiprogrammed computers—progress in developing an analytic prediction method

Multiprogramming as it is discussed here is a mode of computer operation in which two or more programs are concurrently in processor memory and proceeding, each using the same central processor unit (CPU) and input-output (I/O) …

Algorithm 364: coloring polygonal regions [Z]


Algorithm 365: complex root finding [C5]


Algorithm 366: regression using certain direct product matrices [G2]


Algorithm 367: analysis of variance for balanced experiments [G2]


Certification of algorithm 147 [S14]: PSIF


Remark on algorithm 300 [S22]: Coulomb wave functions


Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration


Certification of algorithm 229 [B1]: elementary functions by continued fractions


Optimal code for serial and parallel computation


A fast random number generator for IBM 360

Marsaglia and Bray [1] recommend incorporating two-line random number generators directly into FORTRAN programs. One of the advantages of this is the time saved in avoiding linkage to and fro from a subroutine. Implicit in their …

Presentation of alphameric characters for information processing

This proposed American National Standard has been accepted for publication by American National Standards Committee X3, Computers and Information Processing. In order that the final version of the proposed standard reflect the …