Communications of the ACM (CACM), Volume 6, 1963

Volume 6, Number 1, January 1963

• John W. Backus, Friedrich L. Bauer, Julien Green, C. Katz, John McCarthy, Alan J. Perlis, Heinz Rutishauser, Klaus Samelson, Bernard Vauquois, Joseph Henry Wegstein, Adriaan van Wijngaarden, Michael Woodger, Peter Naur:
  Revised report on the algorithm language ALGOL 60. 1-17
  
• Michael Woodger:
  Supplement to the ALGOL 60 report. 18-20
  
• R. E. Utman:
  Suggestions on ALGOL 60 (ROME) issues. 20-23
  
• Melvin E. Conway, Joseph Speroni:
  Arithmetizing declarations: an application to COBOL. 24-27
  
• A. K. Scidmore, B. L. Weinberg:
  Storage and search properties of a tree-organized memory system. 28-31
  
• Mandalay Grems:
  Terms frequently combined in problem description. 31
  
• M. J. R. Healy, B. P. Bogert:
  FORTRAN subroutines for time series analysis. 32-34
  
• George Marsaglia:
  Generating discrete random variables in a computer. 37-38
  
• Peter Naur:
  Remarks on algorithm 42: invert. 38
  
• Peter G. Behrenz:
  Certification of algorithm 31: gamma function. 38
  
• Peter Naur:
  Remarks on and certification of algorithm 50: inverse of a finite segment of the Hilbert matrix. 38-39
  
• Peter Naur:
  Remarks on and certification of algorithm 52: a set of test matrices. 39
  
• Peter Naur:
  Certification of algorithm for calculating primes by means of GPS. 39
  
• Peter Naur:
  Remark on algorithm 107: Gauss's method. 39
  
• Peter Naur:
  Certification of algorithms 117 and 118 magic squares (even and odd orders). 39-40
  
• Peter Naur:
  Certification of algorithms 120 and matrix inversion by Gauss-Jordan inversion II. 40
  

Volume 6, Number 2, February 1963

• Joan C. Miller, Clifford J. Maloney:
  Systematic mistake analysis of digital computer programs. 58-63
  
• Lynn Yarbrough:
  Decimal-to-binary conversion of short fields. 63-64
  
• Mandalay Grems:
  Glossary construction. 64-65
  
• Theodore S. Lewis:
  Character manipulation in FORTRAN. 65
  
• William C. White, Marvin B. Shapiro, Arnold W. Pratt:
  Linear programming applied to ultraviolet absorption spectroscopy. 66-67
  
• Heinz Rutishauser:
  Algorithm 150: syminv2. 67-68
  
• Henry F. Walter:
  Algorithm 151: location of a vector in a lexicographically ordered list. 68
  
• John Hopley:
  Algorithm 152: Nexcom. 68
  
• Friedrich L. Bauer:
  Algorithm 153: gomory. 68
  
• Henry C. Thacher Jr.:
  Certification of algorithm 32: multint. 69
  
• Noelle A. Meyer:
  Certification of algorithm 73: incomplete elliptic integrals. 69
  

Volume 6, Number 3, March 1963

• Victor H. Yngve, Jean E. Sammet:
  Toward better documentation of programming languages: introduction. 76
  
• Peter Naur:
  Documentation problems: ALGOL 60. 77-79
  
• Joseph F. Cunningham:
  COBOL. 79-82
  
• Victor H. Yngve:
  COMIT. 83-84
  
• William P. Heising:
  Fortran. 85-86
  
• Allen Newell:
  Documentation of IPL-V. 86-89
  
• Christopher J. Shaw:
  Jovial and its documentation. 89-91
  
• Maurice H. Halstead:
  NELIAC. 91-92
  
• Robert J. Mayer:
  Selective instruction trap for the 7090. 101
  
• M. Douglas McIlroy:
  A variant method of file searching. 101
  
• William S. LaSor:
  Test matrix for inversion. 102
  
• Charles J. Mifsud:
  Algorithm 155: combination in any order. 103
  
• Charles J. Mifsud:
  Algorithm 156: algebra of sets. 103
  
• Charles J. Mifsud:
  Algorithm 154: combination in lexicographical order. 103
  
• Charles J. Mifsud:
  Algorithm 157: Fourier series approximation. 103
  
• David W. Digby:
  Algorithm 159: determinant. 104
  
• Henry C. Thacher Jr.:
  Certification of algorithm 96: ancestor. 104-105
  
• Eva S. Clark:
  Certification of algorithm 79: difference expression coefficients. 104
  
• Henry E. Fettis:
  Algorithm 158 (algorithm 134, revised) exponention of series. 104
  
• K. M. Bosworth:
  Certifications of algorithms 117 and 118 magic square (odd and even orders)2. 105
  
• Donald L. Laughlin:
  Remark on algorithm 133: random. 105
  
• Peter J. Brown:
  Note on the proof of the non-existence of a phrase structure grammar for ALGOL 60. 105
  
• Gene Thomas Thompson:
  Characteristic values and vectors of defective matrices. 106-107
  
• Perry A. Scheinok:
  A computational extension of the variate difference method. 107-108
  
• H. A. Luther:
  An interative factorization techniques for polynomials. 108-110
  
• Max Goldstein:
  Significance arithmetic on a digital computer. 111-117
  
• W. D. Climenson:
  RECOL - a retrieval command language. 117-122
  
• Virginia W. Whitley:
  Everyman's information retrieval system. 123-126
  

Volume 6, Number 4, April 1963

• W. Barkley Fritz:
  Selected definitions. 152-158
  
• H. V. Wright, M. L. Wolfson:
  Algorithm 161: combinatorial of M things taken one at a time, two at a time, up to N at a time. 161
  
• Henry E. Fettis:
  Algorithm 163: modified Hankel function. 161-162
  
• Fred G. Stockton:
  Algorithm 162: XYmove plotting. 161
  
• M. L. Wolfson, H. V. Wright:
  Algorithm 160: combinatorial of M things taken N at a time. 161
  
• R. E. Clark, Robert N. Kubik, L. P. Phillips:
  Algorithm 164: orthogonal polynomial least squares surface fit. 162-163
  
• Henry C. Thacher Jr.:
  Algorithm 165: complete elliptic integrals. 163-164
  
• Robert D. Rodman:
  Algorithm 166: MonteCarlo. 164
  
• William Kahan, I. Farkas:
  Algorithm 167: calculation of confluent divided differences. 164-165
  
• William Kahan, I. Farkas:
  Algorithm 169: Newton interpolation with forward divided differences. 165
  
• Paul E. Hennion:
  Algorithm 170: reduction of a matrix containing polynomial elements. 165-166
  
• William Kahan, I. Farkas:
  Algorithm 168: Newton interpolation with backward divided differences. 165
  
• Henry C. Thacher Jr.:
  Certification of algorithm 55: complete elliptic integral of the first kind. 166-167
  
• Henry C. Thacher Jr.:
  Certification of algorithm 149: complete elliptic integral. 166-167
  
• Robert P. Hale:
  Certification of algorithm 91: Chebyshev curvefit. 167
  
• Jesse H. Poore Jr.:
  Certification of algorithm 133: random. 167
  
• Reind P. van de Riet:
  Certification of algorithm 73: incomplete elliptic integrals. 167
  
• William M. McKeeman:
  Certification of algorithm 145: adaptive numerical integration by Simpson's rule. 167-168
  
• Henry C. Thacher Jr.:
  Certification of algorithm 147: PSIF. 168
  
• Dmitri Thoro:
  Certification of algorithm 148: term of magic square. 168
  
• J. N. R. Barnecut:
  Certification of algorithm 148: term of magic square. 168
  
• Miriam G. Shoffner, Peter J. Brown:
  A suggested method of making fuller use of strings in ALGOL 60. 169-171
  
• Brian Gluss:
  Least squares fitting of planes to surfaces using dynamic programming. 172-175
  

Volume 6, Number 5, May 1963

• C. C. Gotlieb:
  Sorting on computers. 194-201
  
• Martin A. Goetz:
  Internal and tape sorting using the replacement-selection technique. 201-206
  
• Thomas N. Hibbard:
  An empirical study of minimal storage sorting. 206-213
  
• Harold H. Manker:
  Multiphase sorting. 214-217
  
• W. David Malcolm Jr.:
  String distribution for the polyphase sort. 217-220
  
• R. L. Gilstad:
  Read-backward polyphase sorting. 220-223
  
• Martin A. Goetz, Gloria S. Toth:
  A comparison between the polyphase and oscillating sort techniques. 223-225
  
• Norman C. French:
  Computer planned collates. 225-227
  
• William S. Cooke:
  A tape file merge pattern generator. 227-230
  
• John B. Glore:
  Sorting nonredundant files - techniques used in the FACT compiler. 231-240
  
• Joel Falkin, Sal Savastano Jr.:
  Sorting with large volume, random access, drum storage. 240-244
  
• Martin A. Goetz:
  Organization and structure of data on disk file memory systems for efficient sorting and other data processing programs. 245-248
  
• George U. Hubbard:
  Some characteristics of sorting computing systems using random access storage devices. 248-255
  
• J. B. Paterson:
  The COBOL sorting verb. 255-258
  
• Michael H. Hall:
  A method of comparing the time requirements of sorting methods. 259-263
  
• Martin A. Goetz:
  Design and characteristics of a variable-length record sort using new fixed-length record sorting techniques. 264-267
  
• David J. Waks:
  Conversion, reconversion and comparison techniques in variable-length sorting. 267-272
  
• Edward H. Sussenguth Jr.:
  Use of Tree Structures for Processing Files. 272-279
  

Volume 6, Number 6, June 1963

• Saul Gorn:
  Structures of standards-processing organizations in the computer area. 294-305
  
• Robert W. Bemer:
  A note on range transformations for square root and logarithm. 306-307
  
• Elizabeth Wall, Richard M. Brown:
  A penny-matching program. 307-308
  
• Catherine Britton, I. F. Wagner:
  A computer program for analysis of variance for a 2-level factorial design. 308-309
  
• John E. Fedako:
  1410 Fortran edit feature. 310-311
  
• Thomas G. Sanborn:
  Self-inverse conversion table. 310
  
• John Caffrey:
  Another test matrix for determinants and inverses. 310
  
• Otomar Hájek:
  Algorithm 173: assign. 311
  
• Allan Gibb:
  Algorithm 174: a posteriori bounds on a zero of a polynomial. 311-312
  
• Christopher J. Shaw, T. N. Trimble:
  Algorithm 175: shuttle sort. 312-313
  
• T. D. Arthurs:
  Algorithm 176: least squares surface fit. 313
  
• Arthur F. Kaupe Jr.:
  Algorithm 178: direct search. 313-314
  
• Michael J. Synge:
  Algorithm 177: least squares solution with constraints. 313
  
• Oliver G. Ludwig:
  Algorithm 179: incomplete beta ratio. 314
  
• Henry C. Thacher Jr.:
  Algorithm 180: error function - large X. 314-315
  
• H. R. Schwarz:
  Algorithm 183: reduction of a symmetric bandmatrix to triple diagonal form. 315-316
  
• William M. McKeeman, Lawrence G. Tesler:
  Algorithm 182: nonrecursive adaptive integration. 315
  
• Henry C. Thacher Jr., Paul Shaman:
  Algorithm 181: complementary error function - large X. 315
  
• Kazuo Isoda:
  Certification of algorithm 74: curve fitting with constraints. 316
  
• Henry C. Thacher Jr.:
  Certification of algorithm 123: real error function, ERF (x). 316
  
• Richard W. Conway, William L. Maxwell:
  CORC: the Cornell computing language. 317-321
  
• Marek Greniewski, Wladyslaw M. Turski:
  The external language KLIPA for the URAL-2 digital computer. 321-324
  
• H. N. Cantrell:
  Incompressible flow network calculations. 325-328
  
• Thomas Schick:
  Disk file sorting. 330-331
  
• Harry Rudloe, Martin Deutsch, Thomas Marill:
  PIP: a photo-interpretive program for the analysis of spark-chamber data. 332-335
  
• Raymond A. Kliphardt:
  DESCRIPTRAN: automated descriptive geometry. 336-339
  

Volume 6, Number 7, July 1963

• Harry D. Huskey, Ralph Love, Niklaus Wirth:
  A syntactic description of BC NELIAC. 367-375
  
• Robert V. Head:
  Real-time programming specifications. 376-383
  
• Otto C. Juelich:
  Further remarks on sampling a tape file - III. 384
  
• S. H. Eisman:
  Polynomial evaluation revisited. 384-385
  
• Robert M. Gordon:
  Checking for loops in networks. 384
  
• John Hopley:
  Algorithm 152: Nexcom. 385
  
• A. Colker:
  Algorithm 184: Erlang probalility for curve fitting. 386
  
• Reind P. van de Riet:
  Algorithm 186: complex arithmetic. 386-387
  
• A. Colker:
  Algorithm 185: normal probability for curve fitting. 386
  
• Reind P. van de Riet:
  Algorithm 187: differences and derivatives. 387
  
• F. Rodriguez-Gil:
  Algorithm 188: smoothing 1. 387
  
• F. Rodriguez-Gil:
  Algorithm 189: smoothing 2. 387
  
• A. P. Relph:
  Algorithm 192: confluent hypergeometric. 388
  
• Henry E. Fettis:
  Algorithm 193: reversion of series. 388
  
• A. P. Relph:
  Algorithm 190: complex power. 388
  
• A. P. Relph:
  Algorithm 191: hypergeometric. 388
  
• Cleve B. Moler:
  Remark on certification of matrix inversion procedures. 389
  
• Joanne Kondo:
  Certification of algorithm 105: Newton Maehly. 389
  
• Heinz Rutishauser:
  Remark on algorithm 150: Syminv2. 390
  
• Arthur Evans Jr.:
  Remark on algorithm 150: Syminv2. 390
  
• Henry C. Thacher Jr.:
  Certification of algorithms 134 and 158 exponentiation of series. 390
  
• Michael J. Synge:
  Remark on algorithm 177: least squares solution with constraints. 390
  
• Thomas E. Cheatham Jr.:
  Programming languages. 391-395
  
• John McCarthy, Fernando J. Corbató, Marjorie M. Daggett:
  The linking segment subprogram language and linking loader. 391
  
• Melvin E. Conway:
  Design of a separable transition-diagram compiler. 396-408
  
• Benson H. Scheff:
  A catalogue entry retrieval system. 409-412
  

Volume 6, Number 8, August 1963

• Harold Lorin:
  Letters to the editor: an omission in Mendoza. 421
  
• J. S. Folkers:
  Letters to the editor: construction of school time-tables by a computer. 421
  
• Mark B. Wells:
  Letters to the editor: on ALGOL 60 as a publication language. 421
  
• Saul Gorn, Robert W. Bemer, Julien Green:
  American standard code for information interchange. 422-426
  
• M. M. Lehman, Z. Netter, R. Eshed:
  SABRAC, a time-sharing low-cost computer. 427-429
  
• H. Earl Ferguson:
  Debugging systems at the source language level. 430-432
  
• Henry J. Bowlden:
  A list-type storage technique for alphanumeric information. 433-434
  
• H. D. Baecker:
  Mapped list structure. 435-438
  
• V. J. Ford:
  Letters to the editor: B5000 COBOL-61 compiler equipment configurations. 438
  
• David F. Keyes:
  Multiple-precision binary-to-decimal integer conversion using only addition and subtraction. 439
  
• D. D. Smith:
  Character manipulation in 7090 FORTRAN. 440
  
• Carlos Domingo:
  Algorithm 194: ZERSOL. 441
  
• Donald H. Thurnau:
  Algorithm 195: BANDSOLVE. 441
  
• Robert D. Rodman:
  Algorithm 196: Muller's method for finding roots of an abitrary function. 442-443
  
• Mark B. Wells:
  Algorithm 197: matrix division. 443
  
• William M. McKeeman:
  Algorithm 198: adaptive integration and multiple integration. 443-444
  
• Robert G. Tantzen:
  Algorithm 199: conversions between calendar date and Julian day number. 444
  
• Carlos Domingo, F. Rodriquez-Gil:
  Certification of algorithm 43: crout II. 445-446
  
• Peter Naur:
  Correction to earlier remarks on algorithm 42 invert, alg. 107 Gauss's method, alg 120 inversion II, and gjr. 445
  
• James F. Bridges:
  Certification of algorithm 38: telescope 2. 445
  
• Richard George:
  Certification of algorithm 47: associated Legendre functions of the first kind for real or imaginary arguments. 446
  
• Brian Randell, L. J. Russell:
  Certification of algorithms 63, 64 and 65, partition, quicksort, and find. 446
  
• Paul E. Hennion:
  Remark on algorithm 77: interpolation, differentiation, and integration. 446-447
  
• Peter Naur:
  Additional remarks on algorithm 52: a set of test matrices. 446
  
• Peter Naur:
  Certification of algorithm 85: Jacobi. 447-448
  
• Richard George:
  Certification of algorithm 140: matrix inversion. 448
  
• K. M. Bosworth:
  Certification of algorithm 155: combination in any order. 449
  
• K. M. Bosworth:
  Certification of algorithm 154: combination in lexicographical order. 449
  
• B. Lefkowitz:
  Certification of algorithm 153: GOMORY. 449
  
• C. V. Bitterli:
  Certification of algorithm 164: orthogonal polynomial least squares surface fit. 450
  
• Paul E. Hennion:
  Remark on algorithm 170: reduction of a matrix containing polynomial elements. 450
  
• William E. Fletcher:
  Certification of algorithm 162: xymove plotting. 450
  
• K. M. Bosworth:
  Certification of algorithm 156: algebra of sets. 450
  
• Jürgen Eickel, Manfred Paul, Friedrich L. Bauer, Klaus Samelson:
  A syntax controlled generator of formal language processors. 451-455
  
• Alfonso Caracciolo Di Forino:
  Some remarks on the syntax of symbolic programming languages. 456-460
  
• Arthur F. Kaupe Jr.:
  A note on the dangling else ALGOL 60. 460
  
• I. C. Pyle:
  Dialects of FORTRAN. 462-467
  
• Michael P. Barnett:
  Continued operation notation for symbol manipulation and array processing. 467-472
  
• Arthur B. Kahn:
  Skeletal structure of PERT and CPA computer programs. 473-479
  
• Jesse H. Katz:
  Simulation of a traffic network. 480-486
  
• Wayne A. Danielson, Bruce Briggs:
  A computer program for editing the news. 487-490
  
• David A. Pope:
  An exponential method of numerical integration of ordinary differential equations. 491-493
  

Volume 6, Number 9, September 1963

• John M. Blatt:
  Ye indiscreet monitor. 506-510
  
• J. F. Egler:
  A procedure for converting logic table conditions into an efficient sequence of test instructions. 510-514
  
• Robert D. Rodman:
  A note on a set of test matrices for inversion. 515
  
• A. C. R. Newbery:
  Pei matrix eigenvectors. 515
  
• Arnold I. Dumey:
  Note on stochastic matrices. 515
  
• Donald P. Moore:
  Closing out a print tape. 515
  
• Wen-Hwa Chu, Donald R. Saathoff:
  A semi-iterative process for evaluating arctangents. 516-517
  
• E. J. Wasscher:
  Algorithm 203: STEEP1. 517-519
  
• Mok-Kong Shen:
  Algorithm 202: generation of permutations in lexicographical order. 517
  
• J. G. A. Haubrich:
  Algorithm 205: ATIVE. 519
  
• Misako Konda:
  Algorithm 206: ARCCOSIN. 519
  
• E. J. Wasscher:
  Algorithm 204: STEEP2. 519
  
• Carl B. Wright:
  Certification of algorithm 45: interest. 520-521
  
• Bruce H. Freed:
  Algorithm 41, revision evaluation of determinant. 520
  
• Bruce H. Freed:
  Certification of algorithm 41: evaluation of determinant. 520
  
• E. J. Wasscher:
  Remark on algorithm 129 minifun : minifun. 521
  
• Richard George:
  Remark on algorithm 157: Fourier series approximation. 521-522
  
• Henry C. Thacher Jr.:
  Certification of algorithm 163: modified Hankel function. 522
  
• J. Dennis Lawrence:
  Certification of algorithm 158: exponentiation of series. 522
  
• Henry C. Thacher Jr.:
  Certification of algorithm 167: calculation of confluent divided differences. 523
  
• Robert D. Rodman:
  Remark on algorithm 166: MonteCarlo inverse. 523
  
• Henry C. Thacher Jr.:
  Certification of algorithm 168: Newton interpolation with backward divided differences. 523
  
• Henry C. Thacher Jr.:
  Certification of algorithm 169: Newton interpolation with forward divided differences. 523
  
• Joseph Weizenbaum:
  Symmetric list processor. 524-536
  
• H. J. Gawlik:
  MIRFAC: a compiler based on standard mathematical notation and plain English. 545-547
  
• Niklaus Wirth:
  A generalization of ALGOL. 547-554
  
• Donald E. Knuth:
  Computer-drawn flowcharts. 555-563
  
• Donald Greenspan, M. Yohe:
  On the approximate solution of Delta u=F(u). 564
  
• K. W. Smillie:
  A general program for the analysis of square and rectanglar lattice designs. 568-572
  
• E. M. McCormick:
  Group participation computer demonstration. 573-574
  
• Arthur S. Radford:
  Letters to the editor: on word combinations. 575
  
• J. Harold McBeth:
  Letters to the editor: on the reference counter method. 575
  

Volume 6, Number 10, October 1963

• Donald E. Knuth, Martin A. Goetz:
  Letters to the editor: three letters on merging. 585
  
• Misako Konda:
  Letters to the editor: correction to FUSBUDET. 587
  
• Robert J. Rossheim:
  Report on proposed American standard flowchart symbols for information processing. 599-604
  
• M. J. Bailey, Michael P. Barnett, Robert P. Futrelle:
  Format-free input in FORTRAN. 605-608
  
• Naomi Rotenberg, Ascher Opler:
  Variable width stacks. 608-611
  
• Gerald M. Weinberg, G. L. Gressett:
  An experiment in automatic verification of programs. 610-613
  
• George Hutchinson:
  Partioning algorithms for finite sets. 613-614
  
• J. Boothroyd:
  Algorithm 207: stringsort. 615
  
• William T. Foreman Jr.:
  Algorithm 208: discrete convolution. 615-616
  
• D. Ibbetson:
  Algorithm 209: Gauss. 616
  
• George R. Schubert:
  Algorithm 210: Lagrangian interpolation. 616
  
• George R. Schubert:
  Algorithm 211: Hermite interpolation. 617
  
• Malcolm D. Gray:
  Algorithm 212: frequency distribution. 617
  
• Malcolm D. Gray:
  Algorithm 213: Fresnel integrals. 617
  
• George R. Schubert:
  Remark on algorithm 157: Fourier series approximation. 618
  
• Albert Newhouse:
  Certification of algorithm 27: assignment. 618
  
• Malcolm D. Gray:
  Remark on algorithms 88, 89, and 90 evaluation of the Fresnel integrals. 618
  
• D. Ibbetson:
  Remark on algorithm 123: ERF. 618
  
• Robert F. Blakely:
  Certification of algorithm 160 combinatorial of M things taken N at a time. 618
  
• Z. Filsak, L. Vrchoveká:
  Certification of algorithm 173: assign. 619
  
• George R. Schubert:
  Certification of algorithm 175: shuttlesort. 619
  
• David H. Collins:
  Certification of algorithm 161: combinatorial of M things taken one at a time, two at a time, up to N at time. 619
  
• Thomas A. Dwyer:
  Certification of algorithm 210: Hermite interpolation. 619
  
• R. S. Scowen:
  Certification of algorithm 173: assign. 619
  
• M. O. Dayhoff:
  A contour-map program for x-ray crystallography. 620-622
  
• Thomas Marill, Daniel Edwards, Wallace Feurzeig:
  DATA-DIAL: two-way communication with computers from ordinary dial telphones. 622-624
  
• Glenn V. Dalrymple, Ruheri Perez-Tamayo:
  A numerical method for the determination of moving field isodose curves for treatment plannning in radiotherapy. 625-626
  
• James D. Edwards:
  An automatic data acquisition and inquiry system using disk files. 626-630
  
• B. G. Carlson, Edward A. Voorhees:
  Use of the disk file on stretch. 631-634
  
• Herman Hess:
  A comparison of disks and tapes. 634-638
  
• Patrick D. Krolak, Leon Cooper:
  An extension of Fibonaccian search to several variables. 639-641
  
• Alan J. Perlis:
  Computation's development critical to our society. 642
  

Volume 6, Number 11, November 1963

• S. A. Brown, C. E. Drayton, B. Mittman:
  A description of the APT language. 649-658
  
• J. F. Traub:
  USA participation in an international standard glossary on information processing. 658-659
  
• John A. Gosden, Roger E. Gay, John L. Jones, Jack N. Merner, Christopher J. Shaw:
  Report of a visit to discuss common programming languages in Czechoslavakia and Poland, 1963. 660-661
  
• Henry C. Thacher Jr.:
  Algorith 215: Shanks. 662
  
• Richard George:
  Algorithm 216: SMOOTH. 663
  
• Henry C. Thacher Jr.:
  Certification of algorithm 8: Euler summation. 663
  
• Paul E. Hennion:
  Remark on algorithm 77: interpolation, differentiation, and integration. 663
  
• Don L. Weimer:
  A serial technique to determine minimum paths. 664-666
  
• James A. Ayers:
  Recursive programming in Fortran II. 667-668
  
• R. G. Loomis, J. Rubin:
  Flexible abbreviation of words in a computer language. 668
  
• Edgar T. Irons:
  An error-correcting parse algorithm. 669-673
  
• Mark B. Wells:
  Recent improvements in MADCAP. 674-678
  
• Jesse H. Katz:
  Optimizing bit-time computer simulation. 679-685
  
• Donald E. Knuth:
  Length of strings for a merge sort. 685-688
  
• I. C. Tang:
  On the computation of a certain type of incomplete Beta functions. 689
  
• Leonard D. Gross:
  Coding clinical laboratory data for automatic storage and retrieval. 690-694
  
• A. C. Andrews, John Hassler, Frank DeCou:
  Application of IBM 1620 EDP methods to the calculation of the formulation constants of complex ions. 694