*George E. Forsythe*

Pages 697-699

*Walter F. Bauer*

Page 700

*Robert W. Floyd*

Page 701

*J. Boothroyd*

Page 701

*J. H. Halton*

Pages 701-702

*T. A. Bray*

Pages 702-703

*I. Clausen, L. Hansson*

Page 702

*Vic Hasselblad, Jeff Rulifson*

Page 702

A table of formulas for certain integrals involving Legendre functions has been constructed mechanically by a program which performed algebraic operations. The formulas are all rational algebraic expressions in a single variable …

*H. D. Wactlar, M. P. Barnett*

Pages 704-710

Presented in this paper is a technique for determining the relative effects of the internal speed of the computer and the speed of the input-output units upon the overall speed of the system. Equations are derived which permit …

*Peter White*

Pages 711-714

In January of 1960, the late Hans J. Maehly completed a summary of approximations to the elementary functions for the CDC-1604 computer. The approximations and techniques suggested by Maehly are equally applicable to the second …

*W. J. Cody*

Pages 715-718

Techniques are developed for manipulating bits using only FORTRAN II. These techniques allow individual bits to be tested, certain fields to be shifted, and numbers coded in BCD to be converted to Binary.
*C. A. Oster*

Pages 719-721

*M. J. Garber, Conrad Miziumski*

Page 721

The United States Military Academy is faced with the situation whereby 700 cadets may

in a single subject prepare computer programs

in class one day and get their solutions in the form of a computer runoff at their next class …

*William F. Luebbert*

Pages 722-723

In simulating the operation of a large storage computer on the IBM 7094, a technique was developed whereby sections of the computer memory which were stored on magnetic tape (IBM 729 Mod II tape drive) could be rewritten without …

*James A. Miller*

Page 723

I was so impressed and pleased by RDNUM, A. Hassitt's General-Purpose Input Routine [

Comm. ACM 7, 6 (June 1964), 350-355], that I have transliterated it into FORTRAN II for the IBM 7094. In doing this I stumbled across solutions …

*Michael J. Synge*

Page 723

A family of test matrices with the following properties is described here: (a) an explicit inverse is given; (b) the characteristic polynomial is easily obtained; (c) a large measure of control over the eigenvalues is possible …

*A. C. R. Newbery*

Page 724

The test matrices given by M. L. Pei [

Comm. ACM 5, 10 (Oct. 1962), 508] and R. D. Rodman [

Comm. ACM 6, 9 (Sept. 1963, 515] are special cases of a general class of matrices with complex elements for which an explicit form of the …

*Randall E. Cline*

Pages 724-725

Tests of significance based on analysis of variance calculations often require the determination of the probabilities of obtaining values of

F greater than those arising from the analysis. These probabilities are customarily

F …

*K. W. Smillie, T. H. Anstey*

Page 725

Scanning text on a computer, as in forming word lists or editing, usually involves isolating and identifying certain characters or classes of characters. For example, if we scan text to form a list of words, the definition of …

*James J. Baker*

Page 726

The letter by Ackermann appearing in the

Communications of the ACM of May 1964, presented one of a number of the very interesting uses of the FORTRAN II CHAIN procedure. Another unusual application of this procedure has been
…

*D. G. Drath*

Page 726

The second Remes algorithm is used to approximate the integrals Kis by rational functions. The related coefficients for the approximations of Ki1, Ki2, Ki3 are given for different precisions.
*I. Gargantini, T. Pomentale*

Pages 727-730

This paper is dedicated to the proposition that, in order to take full advantage for real-time computations of highly parallel computers as can be expected to be available in the near future, much of numerical analysis will have …

*J. Nievergelt*

Pages 731-733

A few remarks are given on the relations between syntax and semantics in the programming languages.
The aim is to point out that, it is true that the grammar of a contex-free language should be conceived not only as a strings …

*L. Petrone, C. E. Vandoni*

Pages 734-735

The very generality of a language like ALGOL renders it inefficient when a number of programs have to be written all dealing with a fairly narrow range of problems. This can be largely overcome by the construction of a package …

*M. J. R. Healy*

Page 735

*Donald E. Knuth*

Pages 735-736

*John M. Scofield*

Page 736

*Richard D. Whittaker*

Page 736