Communications of the ACM (CACM), Volume 3, 1960

Volume 3, Number 1, January 1960

• Philip R. Bagley:
  Two Think Pieces. 1
  
• A. E. Speckhard:
  A SAP-Like Assembly Program for the IBM 650. 2-5
  
• Virginia Nather, Ward C. Sangren:
  Abstracts - Additional Nuclear Reactor Codes. 6-19
  

• R. M. Frank, R. B. Lazarus:
  A High-Speed Sorting Procedure. 20-22
  

Volume 3, Number 2, February 1960

• Eric R. Kent:
  A Proposal for a Set of Publication Standards for Use by the ACM. 70-71
  
• Robert W. Bemer:
  A Proposal for Character Code Compatibility. 71-72
  
• Fred Gruenberger:
  A Terminology Proposal. 72
  

• R. J. Herbold:
  QuadI (Algorithm 1). 74
  
• Joseph Henry Wegstein:
  Rottfinder (Algorithm 2). 74
  
• A. A. Grau:
  Solution of Polynomial Equation by Bairstow-Hitchcock Method (Algorithm 3). 74-75
  

• Klaus Samelson, Friedrich L. Bauer:
  Sequential Formula Translation. 76-83
  
• Harold N. Pelta:
  Selfcipher: Programming. 83
  
• William C. Lynch:
  Coding Isomorphisms. 84-85
  
• William A. Logan:
  The Basic Side of Tape Labeling. 85-86
  
• J. F. Traub:
  Comments on "A New Method of Computation of Square Roots Without Using Division". 86
  , ->Commun. ACM 2(11): 23-24(1959)

• Jerome P. Shuchter:
  Marriage-with Problems. 87-90
  

• James A. Painter:
  Computer Preparation of a Poetry Concordance. 91-95
  

Volume 3, Number 3, March 1960

• Willis H. Ware:
  Soviet Computer Technology - 1959. 131-166

• Herbert Kanner:
  A Note on the Use of the Abacus in Number Conversion. 167
  
• Frederick P. Brooks Jr.:
  The Execute Operations-A Fourth Mode of Instruction Sequencing. 168-170
  
• Robert W. Floyd:
  An Algorithm Defining ALGOL Assignment Statements. 170-171
  
• Louis A. Schmittroth:
  Numerical Inversion of Laplace Transforms. 171-173
  

• Saul Gorn:
  Bisection Routine (Algorithm 4). 174
  

• Mandalay Grems:
  Share Standard Flow Chart Symbols. 174-175
  

Volume 3, Number 4, April 1960

• John McCarthy:
  Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. 184-195
  
• Alan J. Perlis, Charles Thornton:
  Symbol Manipulation by Threaded Lists. 195-204
  
• Allen Newell, Fred M. Tonge:
  An Introduction to Information Processing Language V. 205-211
  
• Joseph W. Smith:
  Syntactic and Semantic Augments to ALGOL. 211-212
  
• Julien Green:
  Symbol Manipulation in XTRAN. 213-214
• M. Douglas McIlroy:
  Macro Instruction Extensions of Compiler Languages. 214-220
  
• Hao Wang:
  Proving Theorems by Pattern Recognition I. 220-234
  

• Richard M. Brown:
  Decoding Combinations of the First n Integers Taken k at a Time. 235-236
  
• Michael E. Senko:
  A Control System For Logical Block Diagnosis With Data Loading. 236-240
  

• Dorothea S. Clarke:
  Bessel Funtion I, Series Expansion (Algorithm 5). 240
  
• Dorothea S. Clarke:
  Bessel Function I, Asymptotic Expansion (Algorithm 6). 240
  
• Robert Claussen:
  Euclidian Algorithm (Algorithm 7). 240
  

• Fred Gurzi:
  A High-Speed Multiplication Process for Digital Computers. 241-245
  
• Donald E. Knuth:
  An Imaginary Number System. 245-247
  

Volume 3, Number 5, May 1960

• 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:
  Report on the algorithmic language ALGOL 60. 299-314
  
• G. W. Patterson:
  What is a code? 315-318
  
• Diran Sarafyan:
  Divisionless computation of square roots through continued squaring. 319-321
  
• Robert L. Patrick:
  A start on automatic storage assignment. 321-322
  
• Peter Wegner:
  A technique for counting ones in a binary computer. 322
  
• June A. Barrett, Mandalay Grems:
  Abbreviating words systematically. 323-324
  

Volume 3, Number 6, June 1960

• Bruce W. Arden, Bernard A. Galler, Robert M. Graham:
  Letters. 13
  
• Andrew D. Booth:
  The future of automatic digital computers. 339-341
  
• I. S. Berezin:
  The department of computer mathematics at Moscow State University. 342-344
  
• Charles J. Swift:
  Compiling connectives. 345-346
  
• Robert W. Floyd:
  Note of amplification. 346
  
• E. F. Codd:
  Multiprogram Scheduling Parts 1 and 2: Introduction and Theory. 347-350
  
• S. M. Robinson, George W. Struble:
  A short method for measuring error in a least-squares power series. 351
  
• C. Perry:
  Conversion between floating point presentation. 352
  
• G. M. Galler:
  Algorithms: evaluation of the Chebyshev polynomial T_n(X) by recursion. 353
  
• G. M. Galler:
  Algorithms: evaluation of the Hermite polynomial H_n(X) by recursion. 353
  
• G. M. Galler:
  Algorithms: evaluation of the Laguerre polynomial L_n(X) by recursion. 353
  
• G. M. Galler:
  Algorithms: evaluation of the Legendre polynomial P_n(X) by recursion. 353
  
• Joseph Henry Wegstein, Henry C. Thacher Jr.:
  Certification: rootfinder. 354
  
• A. A. Grau, Henry C. Thacher Jr.:
  Certification: solution of polynomial equation by Bairstow-Hitchcock method. 354
  
• William H. Anderson:
  The solution of simultaneous ordinary differential equations using a general purpose digital computer. 355-360
  
• W. R. Neal:
  Interval estimation of the time in one state to total time ratio in a double exponential process. 361-366
  

Volume 3, Number 7, July 1960

• A. Beam:
  Algorithms 13: complex exponential integral. 406
  
• Edward A. Voorhees:
  Some thoughts on reconciling various character set proposals. 408-409
  
• J. E. Holmstrom:
  The multilingual terminology project. 409-412
  
• E. F. Codd:
  Multiprogram Scheduling Parts 3 and 4: Scheduling Algorithm and External Constraints. 413-418
  
• Paul McIsaac:
  Combining ALGOL statement analysis with validity checking. 418-419
  
• William F. Luebbert:
  Programming compatibility in a family of closely related digital computers. 420-429
  

Volume 3, Number 12, 1960

• Harry D. Huskey:
  From the president of ACM. 631
  
• R. F. Wheeling:
  Optimizers: their structure. 632-638
  
• H. J. Smith Jr., Francis A. Williams:
  Survey of punched card codes. 639
  
• Robert W. Bemer:
  Survey of coded character representation. 639-642
  
• Kenneth W. Ellenberger:
  Algorithm 30: numerical solution of the polynomial equation. 643
  
• Kenneth W. Ellenberger:
  On programming the numerical solution of polynomial equations. 644-647
  
• David E. Ferguson:
  Fibonaccian searching. 648
  
• S. Lubkin:
  A note on approximating e^x. 649-652
  
• David A. Pope, Marvin L. Stein:
  Multiple precision arithmetic. 652-654
  
• George E. Collins:
  A method for overlapping and erasure of lists. 655-657
  
• Robert A. Price:
  Two methods for word inversion on the IBM 709: method 1. 658
  
• Paul Des Jardins:
  Two methods for word conversion on the IBM 709: method 2. 658
  
• C. J. Moore, Theodore S. Lewis:
  Digital simulation of discrete flow systems. 659-660
  
• David Farbman, Richard Ketover:
  COPE (Console Operator Proficiency Examination). 661-662
  
• T. B. Curtz, J. F. Riordan, M. Spohn:
  A comparison of 650 programming methods. 663-664