On the Capabilities of While, Repeat, and Exit Statements.
Localization of the Roots of a Polynomial (Remark on Algorithm 429).
Fen-An Axiomatic Basis for Program Semantics.
Clenshaw-Curtis Quadrature (Remark on Algorithm 424).
An Efficient Prime Number Generator (Remark on Algorithm 357).
Complex Gamma Function (Remark and Certification on Algorithm 404).
Inductive Methods for Proving Properties of Programs.
The Complex Method for Constrained Optimization [E4] (Algorithm 454).
Hu-Tucker Minimum Redundancy Alphabetic Coding Method (Remark on Algorithm 428).
A Generalization of AVL Trees.
Graph Plotter (Remark on Algorithm 412).
Petri Nets and Speed Independent Design.
Rosenbrock Function Minimization [E4] (Algorithm 450).
Enumerating Combinations of m Out of n Objects [G6] (Algorithm 452).
A Learning Program Which Plays Partnership Dominoes.
Gaussian Quadrature Formulas for Bromwich's Integral [D1] (Algorithm 453).
Chi-Square Quantiles [G1] (Algorithm 451).