ACM

R. O. Fisher, C. D. Shepard
Pages 77-81

A use of fast and slow memories in list-processing languages

Jacques Cohen
Pages 82-86

Abacus computation in number systems of bases other than ten

James Wing
Page 86

Algorithm 296: Generalized least squares fit by orthogonal polynomials

G. J. Makinson
Pages 87-88

Algorithm 295: Exponential curve fit

H. Späth
Page 87

Sorting by replacement selecting

Betty Jane Gassner
Pages 89-93

Problems in the statistical analysis of simulation experiments: the comparision of means and the length of sample records

George S. Fishman
Pages 94-99

Invariant imbedding and the numerical integration of boundary-value problems for unstable linear systems of ordinary differential equations

R. E. Bellman, H. H. Kagiwada, R. E. Kalaba
Pages 100-102

Parameters for pseudo Runge-Kutta methods

George D. Byrne
Pages 102-104

27 bits are not enough for 8-digit accuracy

I. Bennett Goldberg
Pages 105-106

A modified Newton method for polynomials

L. W. Ehrlich
Pages 107-108

Programming the tabular method of analysis of variance for factorial experiments

S. G. Carmer
Pages 109-110

Testing a random number generator

Samuel Gorenstein
Pages 111-118

Computer representation of planar regions by their skeletons

John L. Pfaltz, Azriel Rosenfeld
Pages 119-122

Stat-Pack: a biostatistical programming package

Stan Shannon, Claudia Henschke
Pages 123-125

Pros and cons of patenting computer programs

James P. Titus
Pages 126-127

Communications of the ACM

Table of Contents

Time sharing on a computer with a small memory