Time sharing on a computer with a small memory
Pages 77-81
Home → Magazine Archive → February 1967 (Vol. 10, No. 2)
Time sharing on a computer with a small memory
Pages 77-81
A use of fast and slow memories in list-processing languages
Pages 82-86
Abacus computation in number systems of bases other than ten
Page 86
Algorithm 295: Exponential curve fit
Page 87
Algorithm 296: Generalized least squares fit by orthogonal polynomials
Pages 87-88
Sorting by replacement selecting
Pages 89-93
Pages 94-99
Pages 100-102
Parameters for pseudo Runge-Kutta methods
Pages 102-104
27 bits are not enough for 8-digit accuracy
Pages 105-106
A modified Newton method for polynomials
Pages 107-108
Programming the tabular method of analysis of variance for factorial experiments
Pages 109-110
Testing a random number generator
Pages 111-118
Computer representation of planar regions by their skeletons
Pages 119-122
Stat-Pack: a biostatistical programming package
Pages 123-125
Pros and cons of patenting computer programs
Pages 126-127
Create a Web Account
If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access premium content and site features. If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.