January 1964 Table of Contents | Communications of the ACM

Home → Magazine Archive → January 1964 (Vol. 7, No. 1)

Egler's procedure refuted

Michael Montalbano

Page 1

Eliminate stack mechanisms in computer hardware?

H. Kanner, C. Robinson, P. Kosinski

Page 1

In defense of ALGOL 60 as a publication language

J. R. Voss

Page 2

SLIP

L. D. Yarbrough, J. Weizenbaum

Page 2

More indiscretions

J. C. Richter, Geogre H. Mealy

Pages 2-3

“Simple I/O” MAD statements

Bernard A. Galler

Page 3

A fast procedure for generating normal random variables

A technique for generating normally distributed random numbers is described. It is faster than those currently in general use and is readily applicable to both binary and decimal computers.

G. Marsaglia, M. D. MacLaren, T. A. Bray

Pages 4-10

Floating-point arithmetic with 84-bit numbers

A classic and straightforward technique is presented which is not limited to the size or type of number representation used or multiple precision arithmetic.

Robert T. Gregory, James L. Raney

Pages 10-13

A note on multiplying boolean matrices II

In a note by Baker [1], a method is given for getting the limiting connectivity matrix, B, of a matrix whose entries are Boolean 0's and 1's. Harary [2] suggests determining An-1 since An-1 = An = ··· , wheren is the order of …

D. R. Comstock

Page 13

A fortran post-mortem procedure

W. Kahan, J. J. Leppik

Page 15

GARGOYLE: a language for compiler writing

Jan V. Garwick

Pages 16-20

An example in “significant-digit” arithmetic

Different methods of handling the summing process for the geometric series are shown to give results indicating widely differing significances when carried out in a machine incorporating “significant-digit” arithmetic.

R. H. Miller

Page 21

On the numerical solution of boundary value problems for linear ordinary differential equations

A numerical method is presented for the solution of boundary value problems involving linear ordinary differential equations. The method described is noniterative and makes use of any one-step numerical integration scheme to …

James T. Day, George W. Collins

Pages 22-23

An efficient composite formula for multidimensional quadrature

A (2s+1)-point, second-degree quadrature formula for integration over an s-dimensional hyper-rectangle is presented. All but one of the points lie on the surface with weights of opposite sign attached to points on opposite faces …

Henry C. Thacher

Pages 23-25

GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

Given a pair of directed line graphs, the problem of ascertaining whether or not they are isomorphic is one for which no efficient algorithmic solution is known. Since a straightforward enumerative algorithm might require 40partially …

Stephen H. Unger

Pages 26-34

Digital computer determination of alpha source activity

A technique is described for determining the activity and homogeneity of an alpha source. It is believed that the technique, using a digital computer, has many uses and applications in the field of nuclear physics. The technique …

Donald Robbins, W. E. Taylor

Pages 34-38

On optimal search techniques

Arthur F. Kaupe

Page 38

More on the reference counter method of erasing list structures

J. Weizenbaum

Page 38

Analysis of decay-type data

A comparative study has been made of a variety of numerical techniques for fitting experimental data of the decay type by forms involving the sums of exponentials. Statistical errors of the fitted parameters are also calculated …

Beatrice H. Worsley

Pages 39-44

Table of Contents

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine