462 | -- | 467 | Michael H. Smith. A Learning Program Which Plays Partnership Dominoes |
468 | -- | 474 | Bruce J. MacLennan. Fen-An Axiomatic Basis for Program Semantics |
474 | -- | 481 | David Misunas. Petri Nets and Speed Independent Design |
482 | -- | 483 | Marek Machura, Andrzej Mulawa. Rosenbrock Function Minimization [E4] (Algorithm 450) |
483 | -- | 485 | Richard B. Goldstein. Chi-Square Quantiles [G1] (Algorithm 451) |
485 | -- | 0 | C. N. Liu, D. T. Tang. Enumerating Combinations of m Out of n Objects [G6] (Algorithm 452) |
486 | -- | 487 | Robert Piessens. Gaussian Quadrature Formulas for Bromwich's Integral [D1] (Algorithm 453) |
487 | -- | 489 | Joel A. Richardson, J. L. Kuester. The Complex Method for Constrained Optimization [E4] (Algorithm 454) |
489 | -- | 0 | G. Andrejkova, J. Vinar. Complex Gamma Function (Remark and Certification on Algorithm 404) |
490 | -- | 0 | Edward J. Williams. Localization of the Roots of a Polynomial (Remark on Algorithm 429) |
490 | -- | 0 | J. G. Byrne. Hu-Tucker Minimum Redundancy Alphabetic Coding Method (Remark on Algorithm 428) |
491 | -- | 502 | Zohar Manna, Stephen Nes, Jean Vuillemin. Inductive Methods for Proving Properties of Programs |
503 | -- | 512 | W. W. Peterson, Tadao Kasami, Nobuki Tokura. On the Capabilities of While, Repeat, and Exit Statements |
513 | -- | 517 | Caxton C. Foster. A Generalization of AVL Trees |