ACM

John E. Kumpf, C. M. Sidlo, R. W. Bemer
Page 0.11

Algorithms 21: Bessel function for a set of integer orders

W. Börsch-Supan
Page 600

Algorithm 22: Riccati-Bessel functions of first and second kind

H. Oser
Page 600

Algorithm 24: solution of tri-diagonal linear equations

B. Leavenworth
Page 602

Remark on algorithm 15: rootfinder II

George E. Forsythe, John G. Herriot
Page 602

Algorithm 25: real zeros of an arbitrary function

B. Leavenworth
Page 602

The assignment problem is formulated and briefly discussed. An efficient algorithm for its solution is presented in ALGOL code. An empirical relation between solution time and the size of the problem is given, based on extensive … Roland Silver
Pages 603-604

Algorithm 28: least squares fit by orthogonal polynomials

John G. Mackinney
Page 604

Algorithm 29: polynomial transformer

John G. Mackinney
Page 604

An algorithm for the assignment problem

Roland Silver
Pages 605-606

Compilation for two computers with NELIAC

NELIAC, a compiler based on ALGOL, was developed at the U. S. Navy Electronics Laboratory, San Diego, California, as a “bootstrap” compiler for the Remington Rand Univac COUNTESS computer. This compiler was used to generate a … Kleber S. Masterson
Pages 607-611

Least squares fitting of a great circle through points on a sphere

version of itself which, running as a COUNTESS program, generated machine code for the Control Data Corporation CDC-1604 computer. This second compiler was then used to generate a version of NELIAC for the CDC-1604. All three … Leendert De Witte
Pages 611-613

Over all computation control and labelling

The primary function of computer installation is (as everyone knows) to solve useful problems. The programs that accomplish such solutions are called production programs, and when they are applied to a particular set of dataproduction … Anatol Holt
Pages 614-615

A simple technique for coding differential equations

A computer program that will solve an arbitrary system of first-order differential equations according to some conventional numerical method may be considered to have two distinct parts. The main program performs all of the operations … P. Sefton, R. Vaillancourt
Pages 616-617

An estimation of the relative efficiency of two internal sorting methods

This report concerns the IBM 705, models I and II. It is a study of the machine time required by two internal sorting methods, the conventional two-way merge, and a form of the binary search, which is due to D. Mordy, of the … H. Nagler
Pages 618-620

The sumador chino

On a recent motor trip through Mexico, the writer came across an adding device which was referred to as a sumador chino (Chinese adder). A survey of the more available literature on the history of mathematics and on instruments … James L. Rogers
Pages 621-622

Character scanning on the IBM 7070

One general requirement in the construction of symbol manipulators and automatic programming systems is the need to scan a line of information, usually from left to right, and to break down or subdivided this line into words, … A. E. Speckhard
Page 622

Communications of the ACM

Table of Contents

Letters to the editor

From the president of ACM