%A R.W. Bemer
%T A machine method for square-root computation
%J Communications of the ACM
%K cacm
%V 1
%N 1
%D January 1958
%P 6-7

%A Herbert S. Wilf
%T Tables for automatic computation
%J Communications of the ACM
%K cacm
%V 1
%N 1
%D January 1958
%P 8-11

%A B.C. Kennedy
%A J.A. Hunter
%T A programmed binary counter for the IBM type 605 calculater
%J Communications of the ACM
%K cacm
%V 1
%N 1
%D January 1958
%P 11-12

%A Mark Halpern
%T Variable-width tables with binary-search facility
%J Communications of the ACM
%K cacm
%V 1
%N 2
%D February 1958
%P 1-4

%A Murray Grumette
%T IBM 704 code-nundrums
%J Communications of the ACM
%K cacm
%V 1
%N 3
%D March 1958
%P 3-4

%A Harold Wolpe
%T Algorithm for analyzing logical statements to produce a truth function table
%J Communications of the ACM
%K cacm
%V 1
%N 3
%D March 1958
%P 4-13

%A W. Selden
%T Need for an algorithm
%J Communications of the ACM
%K cacm
%V 1
%N 4
%D April 1958
%P 7-9

%A Henry P.T. Corley
%T Request for methods or programs
%J Communications of the ACM
%K cacm
%V 1
%N 4
%D April 1958
%P 9-11

%A James B. Randels
%A Roy F. Reeves
%T Note on empirical bounds for generating Bessel functions
%J Communications of the ACM
%K cacm
%V 1
%N 5
%D May 1958
%P 3-5

%A R.W. Bemer
%T A subroutine method for calculating logarithms
%J Communications of the ACM
%K cacm
%V 1
%N 5
%D May 1958
%P 5-7

%A Anatol W. Holt
%T General purpose programming systems
%J Communications of the ACM
%K cacm
%V 1
%N 5
%D May 1958
%P 7-13

%A E.F. Morris
%A T.E. Wohr
%T Automatic implementation of computer logic
%J Communications of the ACM
%K cacm
%V 1
%N 5
%D May 1958
%P 14-20

%A Edward A. Voorhees
%T Algebraic formulation of flow diagrams
%J Communications of the ACM
%K cacm
%V 1
%N 6
%D June 1958
%P 4-8

%A J.H. Wegstein
%T Accelerating convergence of iterative processes
%J Communications of the ACM
%K cacm
%V 1
%N 6
%D June 1958
%P 9-13

%A A. Vanderburgh
%T The Lincoln keyboard -
a typewriter keyboard designed for computers input flexibility
%J Communications of the ACM
%K cacm
%V 1
%N 7
%D July 1958
%P 4

%A Eldridge S. Adams,\ Jr.
%A Stewart I. Schlesinger
%T Simle automatic coding systems
%J Communications of the ACM
%K cacm
%V 1
%N 7
%D July 1958
%P 5-9

%A A.P. Ershov
%T On programming of arithmetic operations
%J Communications of the ACM
%K cacm
%V 1
%N 8
%D August 1958
%P 3-6

%A T.A. Jeeves
%T Secant modification of Newton's method
%J Communications of the ACM
%K cacm
%V 1
%N 8
%D August 1958
%P 9-10

%A John Giblin
%T Recursive curve fitting technique
%J Communications of the ACM
%K cacm
%V 1
%N 8
%D August 1958
%P 10-11

%A J. Strong
%A J. Wegstein
%A A. Tritter
%A J. Olsztyn
%A O. Mock
%A T. Steel
%T The problem of programming communication with changing machines:
a proposed solution, part 1
%J Communications of the ACM
%K cacm
%V 1
%N 8
%D August 1958
%P 12-18
%K portability, UNCOL

%A Dickson H. Call
%A Roy F. Reeves
%T Error estimation in Runge-Kutta procedures
%J Communications of the ACM
%K cacm
%V 1
%N 9
%D September 1958
%P 7-8

%A J. Strong
%A J. Wegstein
%A A. Tritter
%A J. Olsztyn
%A O. Mock
%A T. Steel
%T The problem of programming communication with changing machines:
a proposed solution, part 2
%J Communications of the ACM
%K cacm
%V 1
%N 9
%D September 1958
%P 9-16
%K portability, UNCOL

%A Melvin E. Conway
%T Proposal for an UNCOL
%J Communications of the ACM
%K cacm
%V 1
%N 10
%D October 1958
%P 5-8

%A Iu.I. Ianov
%T On the equivalence and transformation of program schemes
%J Communications of the ACM
%K cacm
%V 1
%N 10
%D October 1958
%P 8-12

%A Mervin E. Muller
%T The use of computers in inspection procedures
%J Communications of the ACM
%K cacm
%V 1
%N 11
%D November 1958
%P 7-13

%A W.G. Wadey
%T Two square-root approximations
%J Communications of the ACM
%K cacm
%V 1
%N 11
%D November 1958
%P 13-14

%A Iu.I. Ianov
%T On matrix program schemes
%J Communications of the ACM
%K cacm
%V 1
%N 12
%D December 1958
%P 3-6

%A Iwao Sugai
%T Extraction of roots by repeated subtractions for digital computers
%J Communications of the ACM
%K cacm
%V 1
%N 12
%D December 1958
%P 6-8

%A A.J. Perlis
%A K. Samelson
%T Preliminary report - international algebraic language
%J Communications of the ACM
%K cacm
%V 1
%N 12
%D December 1958
%P 8-22
%K IAL Algol

%Q Nuclear Codes Group
%A Virgina Nather
%A Ward Sangren
%T Abstracts - nuclear reactor codes
%J Communications of the ACM
%K cacm
%V 2
%N 1
%D January 1959
%P 6-32

%A John W. Carr,\ III
%T Recursive subscripting compilers and list-type memories
%J Communications of the ACM
%K cacm
%V 2
%N 2
%D February 1959
%P 4-6

%A Julien Green
%T Possible modifications to the international algebraic language
%J Communications of the ACM
%K cacm
%V 2
%N 2
%D February 1959
%P 6-8
%K IAL Algol

%A Peter B. Sheridan
%T The arithmetic translator-compiler of the IBM Fortran automatic coding system
%J Communications of the ACM
%K cacm
%V 2
%N 2
%D February 1959
%P 9-21

%A William F. Luebbert
%A Percy W. Collom,\ Jr.
%T Signal Corps research and development
on automatic programming of digital computers
%J Communications of the ACM
%K cacm
%V 2
%N 2
%D February 1959
%P 22-27

%A R.C. Hansen
%A L.L. Bailin
%A R.W. Rutishauser
%T On computing radiation integrals
%J Communications of the ACM
%K cacm
%V 2
%N 2
%D February 1959
%P 28-31

%A John E. Powers
%T Elimination of special functions from differential equations
%J Communications of the ACM
%K cacm
%V 2
%N 3
%D March 1959
%P 3-4

%A John R. Howell
%T An iterative method for fitting the logistic curve
%J Communications of the ACM
%K cacm
%V 2
%N 3
%D March 1959
%P 5-6

%A J.H. Wegstein
%T From formulas to computer oriented language
%J Communications of the ACM
%K cacm
%V 2
%N 3
%D March 1959
%P 6-8

%A R.W. Bemer
%T A checklist of intelligence for programming systems
%J Communications of the ACM
%K cacm
%V 2
%N 3
%D March 1959
%P 8-13

%A R.E. Gilman
%T A mathematical procedure for machine division
%J Communications of the ACM
%K cacm
%V 2
%N 4
%D April 1959
%P 10-12

%A Paolo Ercoli
%A Roberto Vacca
%T Binary arithmetic for discretely variable word length in a serial computer
%J Communications of the ACM
%K cacm
%V 2
%N 4
%D April 1959
%P 13-16

%A E.H. Larson
%A D.P. Marshall
%T A routine to find the solution of simultanous linear equations
with polynomial coefficients
%J Communications of the ACM
%K cacm
%V 2
%N 4
%D April 1959
%P 16-17

%A J.S. Hicks
%A R.F. Wheeling
%T An efficient method for generating uniformly distributed points
on the surface of an n-dimensional sphere
%J Communications of the ACM
%K cacm
%V 2
%N 4
%D April 1959
%P 17-19

%A Mervin E. Muller
%T A note on a method for generating points uniformly on N-dimensional spheres
%J Communications of the ACM
%K cacm
%V 2
%N 4
%D April 1959
%P 19-20

%A Anon
%T Survey of progress and trend of development and use
of automatic data processing in business and management control systems
of the Federal Government, as of December 1957 - I
%J Communications of the ACM
%K cacm
%V 2
%N 4
%D April 1959
%P 22-26

%A John W. Carr,\ III
%T Error analysis in floating point arithmetic
%J Communications of the ACM
%K cacm
%V 2
%N 5
%D May 1959
%P 10-16

%A Anon
%T Survey of progress and trend of development and use
of automatic data processing in business and management control systems
of the Federal Government, as of December 1957 - II
%J Communications of the ACM
%K cacm
%V 2
%N 5
%D May 1959
%P 17-20

%A John W. Carr,\ III
%A Alan J. Perlis
%A James E. Robertson
%A Norman R. Scott
%T A visit to computation centers in the Soviet Union
%J Communications of the ACM
%K cacm
%V 2
%N 6
%D June 1959
%P 8-20

%A Francis A. Williams
%T Handling identifiers as internal symbols in language processors
%J Communications of the ACM
%K cacm
%V 2
%N 6
%D June 1959
%P 21-24

%A R.L. Schwartz
%A H.A. Cress
%T A technique for computing critical rotational speeds of flexible shafts
on an automatic computer
%J Communications of the ACM
%K cacm
%V 2
%N 6
%D June 1959
%P 27-31

%A Heinz Schecher
%T Programming for a machine with an extended address calculational mechanism
%J Communications of the ACM
%K cacm
%V 2
%N 6
%D June 1959
%P 32-38

%A A. Wouk
%T Remarks on the practical solution of characteristic value problems
%J Communications of the ACM
%K cacm
%V 2
%N 6
%D June 1959
%P 38-39

%A B. Arden
%A R. Graham
%T On GAT and the construction of translators
%J Communications of the ACM
%K cacm
%V 2
%N 7
%D July 1959
%P 24-26

%A Donald Taranto
%T Binary conversion, with fixed decimal precision, of a decimal fraction
%J Communications of the ACM
%K cacm
%V 2
%N 7
%D July 1959
%P 27

%A Wen M. Chow
%T Parameter estimation for simple nonlinear models
%J Communications of the ACM
%K cacm
%V 2
%N 7
%D July 1959
%P 28-29

%A D.L. Shell
%T A high-speed srting procedure
%J Communications of the ACM
%K cacm
%V 2
%N 7
%D July 1959
%P 30-32
%K shell-sort

%A Hans W. Gschwind
%T A real time data assimilator
%J Communications of the ACM
%K cacm
%V 2
%N 7
%D July 1959
%P 33-36

%A Jack Hollingsworth
%T An educational program in computing
%J Communications of the ACM
%K cacm
%V 2
%N 8
%D August 1959
%P 6

%A Philip R. Bagley
%T Proposal for a feasible programming system
%J Communications of the ACM
%K cacm
%V 2
%N 8
%D August 1959
%P 7-10

%A M.J. Aegerter
%T Construction of a set of test matrices
%J Communications of the ACM
%K cacm
%V 2
%N 8
%D August 1959
%P 10-12

%A John W. Hamblen
%T Statistical programs for the IBM 650 - part I
%J Communications of the ACM
%K cacm
%V 2
%N 8
%D August 1959
%P 13-18

%A Louis Fein
%T The role of the university in computers, data processing, and related fields
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 7-14

%A Nelson M. Blachman
%T Central-European computers
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 14-18

%A R.W. Bemer
%T A proposal for a generalized card code for 256 characters
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 19-23

%Q Algol Subcommittee
%T Extensions
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 24

%A Julien Green
%Q et al
%T Remarks on Algol and symbol manipulation
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 25-27

%A Shu-T'ien Li
%T Octal diagrams of binary conception
and their applicability to computer design logic
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 28-29

%A Fred H. Lesh
%T Multi-dimensional least-squares polynomial curve fitting
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 29-30

%A S.D. Hornick
%T IBM 709 tape matrix compiler
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 31-32

%A Stephen J. Wersan
%T The alpha vector transformation of a system of linear constraints
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 33-34

%A Anon
%T Survey of progress and trend of development and use
of automatic data processing in business and management control systems
of the Federal Government, as of December 1957 - III
%J Communications of the ACM
%K cacm
%V 2
%N 9
%D September 1959
%P 35-43

%A U.A. Machmudov
%T LEM-1, small size general purpose digital computer
using magnetic (ferrite) elements
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 3-9

%A Anon
%T J.E.I.D.A. and its computer center
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 10-16

%A H. Kanner
%T An algebraic translator
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 19-22

%A W.R. Brittenham
%A K. Clark
%A G. Kuss
%A H. Thompson
%T SALE, a simple algebraic language for engineers
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 22-24

%Q SHARE Algol committee
%T Recommendations of the SHARE Algol committee
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 25-26

%A J.M. Cook
%T Remarks on a recent paper
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 26

%A S. Gorn
%A P.Z. Ingerman
%A J.B. Crozier
%T On the construction of micro-flowcharts
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 27-31

%A John W. Hamblen
%T Statistical programs for the IBM 650 - part II
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 32-37

%A C.T. Fike
%T Oracle curve plotter
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 38-39

%A M. Nadker
%A A. Sengupta
%T Shift-register code for indexing applications
%J Communications of the ACM
%K cacm
%V 2
%N 10
%D October 1959
%P 40-43

%A E.M. Zaitzeff
%A M.M. Astrahan
%T Russian visit to U.S. computers
%J Communications of the ACM
%K cacm
%V 2
%N 11
%D November 1959
%P 4-11

%A Simon M. Newman
%T COmments on a recent paper
%J Communications of the ACM
%K cacm
%V 2
%N 11
%D November 1959
%P 12

%A E.F. Codd
%A E.S. Lowry
%A E. McDonough
%A C.A. Aclazi
%T Multiprogramming STRETCH: feasibility considerations
%J Communications of the ACM
%K cacm
%V 2
%N 11
%D November 1959
%P 13-17

%A W.T. Gant
%T Flow outlining - a sibstitute for flow charting
%J Communications of the ACM
%K cacm
%V 2
%N 11
%D November 1959
%P 17

%A Donald E. Knuth
%T RUNCIBLE - algebraic translation on a limited computer
%J Communications of the ACM
%K cacm
%V 2
%N 11
%D November 1959
%P 18-21

%A Irwin D. Greenwald
%T A technique for handling macro instructions
%J Communications of the ACM
%K cacm
%V 2
%N 11
%D November 1959
%P 21-22

%A Diran Sarafyan
%T A new method of computation of square roots without using division
%J Communications of the ACM
%K cacm
%V 2
%N 11
%D November 1959
%P 23-24

%A Morton Nadler
%T Some notes on computer research in Eastern Europe
%J Communications of the ACM
%K cacm
%V 2
%N 12
%D December 1959
%P 1-2

%A W. Buchholz
%T Fingers or fists ?
(the choice of decimal or binary representation)
%J Communications of the ACM
%K cacm
%V 2
%N 12
%D December 1959
%P 3-11
%K STRETCH

%A Philip Wolfe
%T The secant method for simultaneous nonlinear equations
%J Communications of the ACM
%K cacm
%V 2
%N 12
%D December 1959
%P 12-13

%A E.T. Irons
%A F.S. Acton
%T A proposed interpretation in Algol
%J Communications of the ACM
%K cacm
%V 2
%N 12
%D December 1959
%P 14-15

%A Stanley M. Humphrey
%T Impact of computer developments
%J Communications of the ACM
%K cacm
%V 2
%N 12
%D December 1959
%P 16-19

%A R.W. Conway
%A B.M. Johnson
%A M.L. Maxwell
%T A queue network simulator for the IBM 650 and Burroughs 220
%J Communications of the ACM
%K cacm
%V 2
%N 12
%D December 1959
%P 20-23

%A Philip R. Bagley
%T Two think pieces
%J Communications of the ACM
%K cacm
%V 3
%N 1
%D January 1960
%P 1

%A A.E. Speckhard
%T A SAP-like assembly program for the IBM 650
%J Communications of the ACM
%K cacm
%V 3
%N 1
%D January 1960
%P 2-5

%Q Nuclear codes group
%A Virginia Nather
%A Ward Sangren
%T Abstracts - additional nuclear reactor codes
%J Communications of the ACM
%K cacm
%V 3
%N 1
%D January 1960
%P 6-19

%A R.M. Frank
%A R.B. Lazarus
%T A high-speed sorting procedure
%J Communications of the ACM
%K cacm
%V 3
%N 1
%D January 1960
%P 20-22

%A Frank M. Verzuh
%T Comments on the 14th ACM computer conference
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 67-69

%A Eric R. Kent
%T A proposal for a set of publication standards for use by the ACM
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 70-71

%A R.W. Bemer
%T A proposal for character code compatibility
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 71-72

%A Fred Gruenberger
%T A terminology proposal
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 72

%A K. Samuelson
%A F.L. Bauer
%T Sequential formula translation
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 76-83

%A Harold N. Pelta
%T Selfcipher: programming
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 83

%A William C. Lynch
%T Coding isomorphisms
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 84-85

%A William A. Logan
%T The basic side of tape labeling
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 85-86

%A J.F. Traub
%T Comments on a recent paper
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 86

%A Jerome P. Shuchter
%T Marriage - with problems
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 87-90

%A James A. Painter
%T Computer preparation of a poetry concordance
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 91-95

%A A.A. Liapunov
%T Mathematical investigations
related to the use of electronic computing machines
%J Communications of the ACM
%K cacm
%V 3
%N 2
%D February 1960
%P 107-118

%A Willis H. Ware
%T Soviet computer technology - 1959
%J Communications of the ACM
%K cacm
%V 3
%N 3
%D March 1960
%P 131-166

%A H. Kanner
%T A note on the use of the abacus in number conversion
%J Communications of the ACM
%K cacm
%V 3
%N 3
%D March 1960
%P 167

%A F.P. Brooks
%T The execute operations - a fourth mode of instruction sequencing
%J Communications of the ACM
%K cacm
%V 3
%N 3
%D March 1960
%P 168-170
%K procedure call

%A Robert W. Floyd
%T An algorithm defining Algol assignment structures
%J Communications of the ACM
%K cacm
%V 3
%N 3
%D March 1960
%P 170-171

%A Louis A. Schmittroth
%T Numerical inversion of Laplace transforms
%J Communications of the ACM
%K cacm
%V 3
%N 3
%D March 1960
%P 171-173

%A John McCarthy
%T Recursive functions of symbolic expressions and their computation by machine,
part I
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 184-195
%K Lisp

%A A.J. Perlis
%A Charles Thornton
%T Symbol manipulation by threaded lists
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 195-204

%A A. Newell
%A F.M. Tonge
%T An introduction to information processing language V
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 205-211
%K IPL-V

%A Joseph W. Smith
%T Syntactic and semantic augments to Algol
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 211-213

%A Julien Green
%T Symbol manipulation in XTRAN
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 213-214

%A M. Douglas McIlroy
%T Macro instruction extensions of compiler languages
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 214-220

%A Hao Wang
%T Proving theorems by pattern recognition I
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 220-234

%A Richard M. Brown
%T Decoding combinations of the first n integers taken k at a time
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 235-236

%A M.E. Senko
%T A control system for logical block diagnosis with data loading
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 236-240

%A Fred Gurzi
%T A high-speed multiplication process for digital computers
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 241-245

%A Donald E. Knuth
%T An imaginary number system
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 245-247
%K quater-imaginary

%A M.R. Shura-Bura
%T Programming
%J Communications of the ACM
%K cacm
%V 3
%N 4
%D April 1960
%P 277-281

%A Peter Naur
%T Report on the algorithmic language Algol 60
%J Communications of the ACM
%K cacm
%V 3
%N 5
%D May 1960
%P 299-314

%A G.W. Patterson
%T What is a code ?
%J Communications of the ACM
%K cacm
%V 3
%N 5
%D May 1960
%P 315-318

%A Diran Sarafyan
%T Divisionless computation of square roots through continued squaring
%J Communications of the ACM
%K cacm
%V 3
%N 5
%D May 1960
%P 319-321

%A Robert L. Patrick
%T A start at automatic storage assignment
%J Communications of the ACM
%K cacm
%V 3
%N 5
%D May 1960
%P 321-322

%A Peter Wegner
%T A technique for counting ones in a binary computer
%J Communications of the ACM
%K cacm
%V 3
%N 5
%D May 1960
%P 322

%A June A. Barrett
%A Mandalay Grems
%T Abbreviating words systematically
%J Communications of the ACM
%K cacm
%V 3
%N 5
%D May 1960
%P 323-324

%A Andrew D. Booth
%T The future of automatic digital computers
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 339-341

%A I.S. Berezin
%T The Depart of Computer Mathematics at Moscow State University
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 342-344

%A Charles J. Swift
%T Compiling connectives
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 345-346

%A E.F. Codd
%T Multiprogram scheduling, parts 1 and 2: introduction and theory
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 347-350

%A S.M. Robinson
%A G.W. Struble
%T A short method for measuring error in a least-squares power series
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 351

%A C. Perry
%T Conversion between floating point representations
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 352

%A J.F. Traub
%T Comment on a previous paper
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 352

%A W.H. Anderson
%T The solution of simultaneous ordinary differential equations
using a general purpose digital computer
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 355-360

%A W.R. Neal
%T Interval estimation of the time in one state to total time ratio
in a double exponential process
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 361-366

%A Anon
%T ATLAS: a new concept in large computer design
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 367-368
%K paging, extracode

%A Francis Wagner
%A Jeanette Orgill
%A Gred Gruenberger
%T A turning point in the computer industry ?
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 380-381

%A Anon
%T Frequency selection for air-lane "road markers"
%J Communications of the ACM
%K cacm
%V 3
%N 6
%D June 1960
%P 381-382

%A Edward A. Voorhees
%T Some thoughts on reconciling various character set proposals
%J Communications of the ACM
%K cacm
%V 3
%N 7
%D July 1960
%P 408-409

%A J.E. Holmstrom
%T The multilingual terminology project
%J Communications of the ACM
%K cacm
%V 3
%N 7
%D July 1960
%P 409-412

%A E.F. Codd
%T Multiprogram scheduling, parts 3 and 4:
scheduling algorithm and external constraints
%J Communications of the ACM
%K cacm
%V 3
%N 7
%D July 1960
%P 413-418

%A Paul McIsaac
%T Combining Algol statement analysis with validity checking
%J Communications of the ACM
%K cacm
%V 3
%N 7
%D July 1960
%P 418-419

%A William F. Luebbert
%T Programming compatibility in a family of closely related digital computers
%J Communications of the ACM
%K cacm
%V 3
%N 7
%D July 1960
%P 420-429

%A Harry D. Huskey
%A M.H. Halstead
%A R. McArthur
%T NELIAC - a dialect of Algol
%J Communications of the ACM
%K cacm
%V 3
%N 8
%D August 1960
%P 463-468

%A Howard J. Smith,\ Jr.
%T A short study of notation efficiency
%J Communications of the ACM
%K cacm
%V 3
%N 8
%D August 1960
%P 468-473

%A S.S. Kutler
%T Counting ones on the IBM 7090
%J Communications of the ACM
%K cacm
%V 3
%N 8
%D August 1960
%P 474

%A Howard Frieden
%T A variant technique for counting ones
%J Communications of the ACM
%K cacm
%V 3
%N 8
%D August 1960
%P 474

%A Bruce Arden
%T Conference reflections
%J Communications of the ACM
%K cacm
%V 3
%N 9
%D September 1960
%P 483-484

%A Robert F. Rosin
%T An introductory problem in symbol manipulation for the student
%J Communications of the ACM
%K cacm
%V 3
%N 9
%D September 1960
%P 488-489

%A Edward Fredkin
%T Trie memory
%J Communications of the ACM
%K cacm
%V 3
%N 9
%D September 1960
%P 490-499

%A A. Berin
%T Rapidly convergent expressions for evaluating e^x
%J Communications of the ACM
%K cacm
%V 3
%N 9
%D September 1960
%P 500

%A John M. Blatt
%T Comments from a Fortran user
%J Communications of the ACM
%K cacm
%V 3
%N 9
%D September 1960
%P 501-505

%A J.C. Dickson
%A F.P. Frederick
%T A decision rule for improved efficiency
in solving linear programming problems with the simplex algorithm
%J Communications of the ACM
%K cacm
%V 3
%N 9
%D September 1960
%P 509-512

%A Anon
%T Report on a conference of university computing center directors
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 519-521

%A Donald L. Katz
%T Conference report on
The Use of Computers in Engineering Classroom Instruction
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 522-527

%A Jack Hollingsworth
%T Automatic graders for programming classes
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 528-529

%A R.W. Bemer
%T Do it by the numbers - digital shorthand
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 530-536

%A Julius Lieblein
%T Comment on a previous paper
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 536

%A P.M. Sherman
%T Comments on a technique for counting ones
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 538

%A Lynn D. Yarbrough
%T Some thoughts on parallel processing
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 539

%A Charles J. Swift
%T Evaluating numbers expressed as strings of English words
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 541

%A Peter Z. Ingerman
%T A note on the calculation of interest
%J Communications of the ACM
%K cacm
%V 3
%N 10
%D October 1960
%P 542-543

%A Roland Silver
%T An algorithm for the assignment problem
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 605-606

%A Kleber S. Masterson,\ Jr.
%T Compilation for two computers with NELIAC
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 607-611

%A Leendert de\ Witte
%T Least squares fitting of a great circle through points on a sphere
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 611-613

%A Anatol Holt
%T Over-all computation control and labelling
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 614-615

%A P. Sefton
%A R. Vaillancourt
%T A simple technique for coding differential equations
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 616-617

%A Jan F. Andrus
%T Note on eigenvalue computation
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 617

%A H. Nagler
%T An estimation of the relative efficiency of two internal sorting methods
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 618-620

%A James L. Rogers
%T The sumador chino
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 621-622

%A A.E. Speckhard
%T Character scanning on the IBM 7070
%J Communications of the ACM
%K cacm
%V 3
%N 11
%D November 1960
%P 622

%A R.F. Wheeling
%T Optimizers: their structure
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 632-638

%A H.J. Smith
%A F.A. Williams
%T Survey of punched card codes
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 638

%A R.W. Bemer
%T Survey of coded character representation
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 639-642

%A Kenneth W. Ellenberger
%T On programming the numerical solution of polynomial equations
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 644-647

%A David E. Ferguson
%T Fibonaccian searching
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 648

%A S. Lubkin
%T A note on approximating e^x
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 649

%A B. Dimsdale
%A G.M. Weinberg
%T Programmed error correction in Project Mercury
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 649-652

%A David A. Pope
%A Marvin L. Stein
%T Multiple precision arithmetic
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 652-654

%A George E. Collins
%T A method for overlapping and erasure of lists
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 655-657

%A Robert A. Price
%T Two methods for word inversion on the IBM 709: method 1
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 658

%A Paul DesJardins
%T Two methods for word inversion on the IBM 709: method 2
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 658

%A C.J. Moore
%A T.S. Lewis
%T Digital simulation of discrete flow systems
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 659-660

%A David Farbman
%A Richard Ketover
%T COPE (Console Operator Proficiency Examination)
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 661-662

%A T.B. Curtz
%A J.F. Riordan
%A M. Spohn
%T A comparison of 650 programming methods
%J Communications of the ACM
%K cacm
%V 3
%N 12
%D December 1960
%P 663-664

%A H.D. Huskey
%A W.H. Wattenburg
%T A basic compiler for arithmetic expressions
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 3-9

%A A.A. Grau
%T Recursive processes and Algol translation
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 10-15

%A H. Bottenbruch
%T Use of magnetic tape for data storage in the Oracle-Algol translator
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 15-19

%A Donald Eglund
%A Ellen Clark
%T The CLIP translator
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 19-22

%A T.E. Cheatham,\ Jr.
%A G.O. Collins
%A G.F. Leonard
%T CL-I, an environment for a compiler
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 23-28

%A B.W. Arden
%A B.A. Galler
%A R.M. Graham
%T The internal organization of the MAD translator
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 28-31

%A Mark B. Wells
%T MADCAP: a scientific compiler for displayed formula textbook language
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 31-36

%A A. Evans,\ Jr.
%A A.J. Perlis
%A H. Van\ Zoeren
%T The use of threaded lists in constructing
a combined Algol and machine-like assembly processor
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 36-41

%A Robert W. Floyd
%T An algorithm for coding efficient arithmetic operations
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 42-50

%A Edgar T. Irons
%T A syntax directed compiler for Algol 60
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 51-55

%A P.Z. Ingerman
%T Thunks - a way of compiling procedure statements
with some comments on procedure declarations
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 55-58
%K Algol, call-by-name

%A P.Z. Ingerman
%T Dynamic declarations
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 59-60

%A Kirk Sattley
%T Allocation of storage for arrays in Algol 60
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 60-65

%A E.T. Irons
%A W. Feurzeig
%T Comments on the implementation of recursive procedures and blocks in Algol 60
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 65-69

%A H.D. Huskey
%A W.H. Wattenburg
%T Compiling techniques for boolean expressions and conditional statements
in Algol 60
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 70-75

%A R.A. Sibley
%T The SLANG system
%J Communications of the ACM
%K cacm
%V 4
%N 1
%D January 1961
%P 75-84

%A Mandalay Grems
%T A card format for reference files in information processing
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 90-98

%A Philip Rabinowitz
%T Multiple-precision division
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 98

%A R.L. Ryle
%T Multiple programming data processing
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 99-101
%K multiprogramming

%A J.W. Carr,\ III
%A J.W. Hanson
%T Two subroutines for symbol manipulation with an algebraic compiler
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 102-103

%A M.R. Nekora
%T Comment on a paper on parallel processing
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 103

%A Richard B. Smith
%T The BKS system for the Philco-2000
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 104

%A Tom Caldwell
%T On finding minimum routes in a network with turn penalties
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 107-108

%A Norman Bush
%T Statistical programs at the University of North Carolina
%J Communications of the ACM
%K cacm
%V 4
%N 2
%D February 1961
%P 108-109

%A Harvey Bratman
%T An alternate form for the "UNCOL diagram"
%J Communications of the ACM
%K cacm
%V 4
%N 3
%D March 1961
%P 142
%K T-diagram

%A J.F. Traub
%T Comparison of iterative methods for the calculation of nth roots
%J Communications of the ACM
%K cacm
%V 4
%N 3
%D March 1961
%P 143-145

%A C. Stratchey
%T Bitwise operations
%J Communications of the ACM
%K cacm
%V 4
%N 3
%D March 1961
%P 146

%A Douglas T. Ross
%T A generalized technique for symbol manipulation and numerical calculation
%J Communications of the ACM
%K cacm
%V 4
%N 3
%D March 1961
%P 147-150
%K plex

%A Daniel J. Lasser
%T Tpological ordering of a list of randomly-numbered elements of a network
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 167-168

%A Oliver K. Smith
%T Eigenvalues of a symmetric 3*3 matrix
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 168

%A Marion C. Gray
%T Bessel functions of integral order and complex argument
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 169

%A R.E. Nather
%T On the compilation of subscripted variables
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 169-171

%A E. Karst
%T On approximating transcendental numbers by continued fractions
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 171

%A P.M. Sherman
%T Table look-at techniques
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 172-173

%A G.M. Weinberg
%T Programmed error correction on a decimal computer
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 174-175

%A H.McG. Ross
%T Further survey of punched card codes
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 182-183

%A H.E. Kulsrud
%T A practical technique for the determination of the optimum relaxation factor
of the successive over-relaxation method
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 184-187

%A Richard Bellman
%A Mario L. Juncora
%A Robert Kalaba
%T Some numerical experiments using Newton's method
for nonlinear parabloic and elliptic boundary-value problems
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 187-191

%A Morton Nadler
%T Division and square root in the quater-imaginary number system
%J Communications of the ACM
%K cacm
%V 4
%N 4
%D April 1961
%P 192-193

%A R.W. Bemer
%A H.J. Smith,\ Jr.
%A F.A. Williams,\ Jr.
%T Design of an improved transmission/data processing code
%J Communications of the ACM
%K cacm
%V 4
%N 5
%D May 1961
%P 212-217

%A L.R. Johnson
%T An indirect chaining method for addressing on secondary keys
%J Communications of the ACM
%K cacm
%V 4
%N 5
%D May 1961
%P 218-222

%A Richard Bellman
%T Successive approximations and computer storage problems
in ordinary differential equations
%J Communications of the ACM
%K cacm
%V 4
%N 5
%D May 1961
%P 222-223

%A Frank B. Baker
%T A method for evaluating the area of the normal function
%J Communications of the ACM
%K cacm
%V 4
%N 5
%D May 1961
%P 224-225

%A H.P. Edmundson
%A R.E. Wyllys
%T Automatic abstracting and indexing - survey and recommendations
%J Communications of the ACM
%K cacm
%V 4
%N 5
%D May 1961
%P 226-234

%A Nelson M. Blachman
%T The state of digital computer technology in Eurupe
%J Communications of the ACM
%K cacm
%V 4
%N 6
%D June 1961
%P 256-265

%A Anon
%T Operational compatibility of systems - conventions
%J Communications of the ACM
%K cacm
%V 4
%N 6
%D June 1961
%P 266-267

%A Donald E. Knuth
%A Jack N. Merner
%T Algol 60 confidential
%J Communications of the ACM
%K cacm
%V 4
%N 6
%D June 1961
%P 268-272

%A H.N. Cantrell
%A J. King
%A F.E.H. King
%T Logic-structure tables
%J Communications of the ACM
%K cacm
%V 4
%N 6
%D June 1961
%P 272-275
%K decision tables

%A J.F. Traub
%T On a class of iteration formulas and some historical notes
%J Communications of the ACM
%K cacm
%V 4
%N 6
%D June 1961
%P 276-278

%A C.H. Fischer
%T Combat vehicle firing stability (active suspension)
%J Communications of the ACM
%K cacm
%V 4
%N 6
%D June 1961
%P 279-283

%A Richard Bellman
%T On the approximation of curves by line segments using dynamic programming
%J Communications of the ACM
%K cacm
%V 4
%N 6
%D June 1961
%P 284

%A Bruce W. Arden
%A Bernard A. Galler
%A Robert M. Graham
%T An algorithm for equivalence declarations
%J Communications of the ACM
%K cacm
%V 4
%N 7
%D July 1961
%P 310-314

%A William K. Clarkson
%A Benjamin M. Prince
%T A divisionless method of integer conversion
%J Communications of the ACM
%K cacm
%V 4
%N 7
%D July 1961
%P 315-316

%A J.N. Bramhall
%T An iterative method for inversion of power series
%J Communications of the ACM
%K cacm
%V 4
%N 7
%D July 1961
%P 317-318

%A Donald Olivier
%T A further note on approximating e^x
%J Communications of the ACM
%K cacm
%V 4
%N 7
%D July 1961
%P 318

%A Saul Gorn
%T Some basic terminology
connected with mechanical languages and their processors
%J Communications of the ACM
%K cacm
%V 4
%N 8
%D August 1961
%P 336-339

%A Thomas N. Mackinson
%T Cobol: a sample problem
%J Communications of the ACM
%K cacm
%V 4
%N 8
%D August 1961
%P 340-346

%A Samuel W. Reynolds
%T A generalized polyphase merge algorithm
%J Communications of the ACM
%K cacm
%V 4
%N 8
%D August 1961
%P 347-349

%A Heidi G. Kuern
%T A 48-bit pseudo-random number generator
%J Communications of the ACM
%K cacm
%V 4
%N 8
%D August 1961
%P 350-352

%A Curt F. Marcus
%T A note on fitting great circles by least squares
%J Communications of the ACM
%K cacm
%V 4
%N 8
%D August 1961
%P 353

%A Albert G. Cox
%A H.A. Luther
%T A note on multiple precision arithmetic
%J Communications of the ACM
%K cacm
%V 4
%N 8
%D August 1961
%P 353

%A W.W. Clendenin
%T Rational approximations for the error function and for similar functions
%J Communications of the ACM
%K cacm
%V 4
%N 8
%D August 1961
%P 354-355

%A Morris Richstone
%T The Applied Mathematics Laboratory of the David W. Taylor Model Basin
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 372-374

%A William B. Kehl
%A John F. Horty
%A R.T. Bacon
%A David S. Mitchell
%T An information retrieval language for legal studies
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 380-389

%A Joyce Hoffman
%A Ascher Opler
%T Use of MOBL in preparing retrieval programs
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 389-391

%A Warren Taylor
%A Lloyd Turner
%A Rochard Waychoff
%T A syntactical chart of Algol 60
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 393

%A Norman Shapiro
%A Herman Vreenegoor
%T The generalized important event technique
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 394-395

%A Arnold R.M. Rom
%T Manipulation of algebraic expressions
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 396-398

%A Leonard Tornheim
%T Inversion of a complex matrix
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 398

%A G.K. Hutchinson
%T Optimum tape-writing procedures
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 399-401

%A Wallace Feurzeig
%T Putting a Hex on e^x
%J Communications of the ACM
%K cacm
%V 4
%N 9
%D September 1961
%P 402-404

%A A.E. Roberts,\ Jr.
%T A general formulation of storage allocation
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 419-420

%A R.J. Maher
%T Problems of storage allocation in multiprocessor multiprogrammed system
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 421-422

%A Anatol W. Holt
%T Program organization and record keeping for dynamic storage allocation
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 422-431

%A Burnett H. Sams
%T Dynamic storage allocation for an information retrieval system
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 431-435

%A John Fotheringham
%T Dynamic storage allocation in the Atlas computer,
including an automatic use of a backing store
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 435-436
%K paging

%A George O. Collins,\ Jr.
%T Experience in automatic storage allocation
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 436-440

%A J. Jensen
%A P. Mondrup
%A P. Naur
%T A storage allocation scheme for Algol 60
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 441-445

%A William P. Heising
%A Ray A. Larner
%T A semi-automatic storage allocation system at loading time
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 446-449

%A J.E. Kelley,\ Jr.
%T Techniques for storage allocation algorithms
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 449-454

%A Bernard N. Riskin
%T Core allocation based on probability
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 454-459

%A Leo J. Cohen
%T Stochastic evaluation of a static storage allocation
%J Communications of the ACM
%K cacm
%V 4
%N 10
%D October 1961
%P 460-464

%A C. Stratchey
%A M.V. Wilkes
%T Some proposals for improving the efficiency of Algol 60
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 488-491

%A Stephen M. Robinson
%T Fitting spheres by the method of least squares
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 491

%A M.P. Barnett
%T Low level language subroutines for use within Fortran
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 492-495

%E G.A. Bachelor
%E J.R.H. Dempster
%E D.E. Knuth
%E J. Speroni
%T SMALGOL-61
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 499-502

%A Dominique C. Foata
%T On a program for Ray-Chaudri's algorithm
for a minimum cover of an abstract complex
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 504-506

%A James Dow
%T Programming a duplex computer system
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 507-513

%A Mary Archambault
%T Ballistic cam design
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 513-515

%A R.C. Nickerson
%T An engineering application of logic-structure tables
%J Communications of the ACM
%K cacm
%V 4
%N 11
%D November 1961
%P 516-520

%A Saul Gorn
%T Specification languages for mechanical languages and their processors
- a baker's dozen
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 532-542

%A L. Wheaton Smith
%T What is proprietary in mathematical programming ?
- impressions of a panel discussion
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 542

%A Morris Rubinoff
%T N-dimensional codes for detecting and correcting multiple errors
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 545-551

%A J.A. Lechner
%T Machine calculation of moments of a probability distribution
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 553-554

%A J.W. Graham
%A D.A. Sprott
%T Processing magnetic tape files with variable blocks
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 555-557

%A J. Verhoeff
%A W. Goffman
%A Jack Belzer
%T Inefficiency of the use of boolean functions
for information retrieval systems
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 557-558

%A David Garfinkel
%A Joseph D. Rutledge
%A Joseph J. Higgins
%T Simulation and analysis of biochemical systems, I:
representation of chemical kinetics
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 559-562

%A Donald Robbins
%T Computer prediction of peck-a-boo sheets
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 562-565

%A Edward A. Feigenbaum
%T Soviet cybernetics and computer sciences, 1960
%J Communications of the ACM
%K cacm
%V 4
%N 12
%D December 1961
%P 566-579

%A Jean E. Sammet
%A Herbert Ohlman
%A H.G. Bohnert
%T Discussion - the pros and cons of a special IR language
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 8-10
%K information retrieval

%A Robert A. Collins
%A Burnett H. Sams
%T Information structures for processing and retrieving
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 11-16

%A T.L. Wang
%T An information system with the ability to extract intelligence from data
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 16-18

%A Victor H. Yngve
%T COMIT as an IR language
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 19-28
%K information retrieval

%A Robert F. Barnes
%T Language problems posed by heavily structured data
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 28-34

%A T.E. Cheatham,\ Jr.
%A S. Warshall
%T Translation of retrieval requests
couched in a "semiformal" English-like language
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 34-39

%A J.D. Sable
%T Use of semantic structure in information systems
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 40-43

%A Mandalay Grems
%T A survey of languages and systems for information retrieval
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 43-46

%A J.H. Wegstein
%A W.W. Youden
%T A string language for symbol manipulation based on Algol 60
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 54-61

%A Richard Larson
%A Peter Sellers
%A Ruben Meyer
%T Simulation and analysis of biochemical systems, II:
solution of differential equations
%J Communications of the ACM
%K cacm
%V 5
%N 1
%D January 1962
%P 63-65

%A H.R. Schwartz
%T An introduction to Algol
%J Communications of the ACM
%K cacm
%V 5
%N 2
%D February 1962
%P 82-95

%A Leonard F. Longo
%T SURGE: a recoding of the Cobol merchandise control algorithm
%J Communications of the ACM
%K cacm
%V 5
%N 2
%D February 1962
%P 98-100

%A J.B. Watt
%A W.H. Wattenburg
%T A NELIAC-generated 7090-1401 compiler
%J Communications of the ACM
%K cacm
%V 5
%N 2
%D February 1962
%P 101-102

%A Gerard Salton
%T Manipulation of trees in information retrieval
%J Communications of the ACM
%K cacm
%V 5
%N 2
%D February 1962
%P 103-114

%A David Garfinkel
%A William Polk
%A Joseph J. Higgins
%A Robert T. Ochser
%T Simulation and analysis of biochemical systems, III:
analysis and pattern recognition
%J Communications of the ACM
%K cacm
%V 5
%N 2
%D February 1962
%P 115-118

%A G.E. Forsythe
%A J. von\ der\ Groeben
%A J.G. Toole
%T Vectorcardiographic diagnosis with the aid of Algol
%J Communications of the ACM
%K cacm
%V 5
%N 2
%D February 1962
%P 118-122

%A Robert S. Ledley
%A James B. Wilson
%T Automatic-programming-language translation through syntactical analysis
%J Communications of the ACM
%K cacm
%V 5
%N 3
%D March 1962
%P 145-155

%A P.V. Ellis
%T An evaluation of autocode readability
%J Communications of the ACM
%K cacm
%V 5
%N 3
%D March 1962
%P 156-159

%A W.C. Lynch
%T On a wired-in binary-to-decimal conversion scheme
%J Communications of the ACM
%K cacm
%V 5
%N 3
%D March 1962
%P 159

%A A.A. Grau
%T On a floating-point number representation for use with algorithmic languages
%J Communications of the ACM
%K cacm
%V 5
%N 3
%D March 1962
%P 160-161

%A J. Weizenbaum
%T Knotted list structures
%J Communications of the ACM
%K cacm
%V 5
%N 3
%D March 1962
%P 161-165

%A Leon Davidson
%T Retrieval of misspelled names in an airlines passenger record system
%J Communications of the ACM
%K cacm
%V 5
%N 3
%D March 1962
%P 169-171

%A Walter M. Carlson
%T Computers - the key to total systems control: an industrial viewpoint
%J Communications of the ACM
%K cacm
%V 5
%N 3
%D March 1962
%P 172-173

%Q Language Structure Group of the CODASYL Development Committee
%T An information algebra; phase 1 report
%J Communications of the ACM
%K cacm
%V 5
%N 4
%D April 1962
%P 190-204

%A H. Hellerman
%T Addressing multidimensional arrays
%J Communications of the ACM
%K cacm
%V 5
%N 4
%D April 1962
%P 205-207

%A C.J. Kaiser
%T A method for eliminating ambiguity due to signal coincidence
in digital design
%J Communications of the ACM
%K cacm
%V 5
%N 4
%D April 1962
%P 211-220

%A Anon
%T Computer simulation of city traffic
%J Communications of the ACM
%K cacm
%V 5
%N 4
%D April 1962
%P 224-226

%A Joseph F. Cunningham
%T Why Cobol ?
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 236

%A Jean E. Sammet
%T Basic elements of Cobol 61
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 237-253

%A A. Lippitt
%T Cobol and compatibility
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 254-255

%A Milton Siegel
%A Albert E. Smith
%T Interim report on Bureau of Ships Cobol evaluation program
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 256-259

%A Richard Berman
%A Joseph Sharp
%A Lawrence Shurges
%T Syntactical charts of Cobol 61
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 260

%A W.L. Donally
%T A report writer for Cobol
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 261

%A W. Hicks
%T The Cobol librarian: a key to object program efficiency
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 262

%A J.C. Emery
%T Modular data processing systems written in Cobol
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 263-268

%A O. Kesner
%T Floating-point arithmetic in Cobol
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 269-271

%A I. Greene
%T Guides to teaching Cobol
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 272-273

%A C.A. Bouman
%T An advanced input-output system for a Cobol compiler
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 273-277

%A J.P. Mullin
%T An introduction to a machine-independent data division
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 277-278

%A J.W. Mullen
%T Cobol batching problems
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 278-279

%A Norman Landis
%A Andrew Manos
%A L. Richard Turner
%T Initial experience with an operating multiprogramming system
%J Communications of the ACM
%K cacm
%V 5
%N 5
%D May 1962
%P 282-286

%A Franz L. Alt
%T Fifteen years ACM
%J Communications of the ACM
%K cacm
%V 5
%N 6
%D June 1962
%P 300-307

%A Irving N. Rabinowitz
%T Report on the algorithmic language Fortran II
%J Communications of the ACM
%K cacm
%V 5
%N 6
%D June 1962
%P 327-337

%A Henry C. Thatcher,\ Jr.
%T A redundancy check for Algol programs
%J Communications of the ACM
%K cacm
%V 5
%N 6
%D June 1962
%P 337-342

%A James W. Hanson
%A Jane Shearin Caviness
%A Camilla Joseph
%T Analytic differentiation by computer
%J Communications of the ACM
%K cacm
%V 5
%N 6
%D June 1962
%P 349-355

%A Peter Wegner
%T Communication between independenty translated blocks
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 376-381

%A Klaus Appel
%T Solution of eigenvalue problems with approximately known eigenvectros
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 381

%A L.J. Larsen
%T A modified inversion procedure
for product form of the inverse linear programming codes
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 382-383

%A Roger H. Simonsen
%T Simulation of a computer timing device
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 383-384

%A H.H. Bottenbruch
%A A.A. Grau
%T On translation of boolean expressions
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 384-387

%A Martin Davis
%A George Logemann
%A Donald Loveland
%T A machine program for theorem-proving
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 394-397

%A Robert M. Baer
%T Nonlinear regression and the solution of simultanous equations
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 397-398

%A Morio Onoe
%T Triangular walk pattern
for the down-hill method of solving a transcendental equation
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 399

%A Herbert E. Salzer
%T Quick calculation of Jacobian elliptic functions
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 399

%A P.R. Peabody
%A D.S. Adorno
%T Digital synthesis of correlated stationary noise
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 400-401

%A W. Fraser
%A J.F. Hart
%T On the computation of rational approximations to continuous functions
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 401-403

%A William Phillips,\ Jr.
%A Anita K. Bahn
%A Mabel Miyasaki
%T Person-matching by electronic methods
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 404-407

%A William Siler
%A John S. Laughlin
%T A computer method for radiation treatment planning
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 407-408

%A D.E. Robinson
%A L.A. Aroian
%T Regression and coded patterns in data editing
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 409-412

%A D.K. Robbins
%T Fortran for business data processing
%J Communications of the ACM
%K cacm
%V 5
%N 7
%D July 1962
%P 412-414

%A R.B. Banerji
%T The description list of concepts
%J Communications of the ACM
%K cacm
%V 5
%N 8
%D August 1962
%P 426-432

%A Brian Gluss
%T Further remarks on line segment curve-fitting using dynamic programming
%J Communications of the ACM
%K cacm
%V 5
%N 8
%D August 1962
%P 441-443

%A J.L. Brenner
%T A set of matrices for testing computer programs
%J Communications of the ACM
%K cacm
%V 5
%N 8
%D August 1962
%P 443-444

%A William R. Busing
%A Henri A. Levy
%T A procedure for inverting large symmetric matrices
%J Communications of the ACM
%K cacm
%V 5
%N 8
%D August 1962
%P 445-446

%A H.A. Luther
%A L.F. Guseman,\ Jr.
%T A finite sequentially compact process
for the adjoints of matrices over arbitrary integral domains
%J Communications of the ACM
%K cacm
%V 5
%N 8
%D August 1962
%P 447-448

%A William C. McGee
%T The property classification method of file design and processing
%J Communications of the ACM
%K cacm
%V 5
%N 8
%D August 1962
%P 450-458

%A G. Schay,\ Jr.
%A W.G. Spruth
%T Analysis of a file addressing method
%J Communications of the ACM
%K cacm
%V 5
%N 8
%D August 1962
%P 459-462

%A J.P. Penny
%A T. Pearcey
%T Use of multiprogramming in the design of a low cost digital computer
%J Communications of the ACM
%K cacm
%V 5
%N 9
%D September 1962
%P 473-476

%A David Garfinkel
%T Programmed methods for printer graphical output
%J Communications of the ACM
%K cacm
%V 5
%N 9
%D September 1962
%P 477-479

%A Stuart S. Shaffer
%T Current status of IPL-V for the Philco 2000 computer (June 1962)
%J Communications of the ACM
%K cacm
%V 5
%N 9
%D September 1962
%P 479

%A John W. Weil
%T A heuristic for page turninig in a multiprogrammed computer
%J Communications of the ACM
%K cacm
%V 5
%N 9
%D September 1962
%P 480-481

%A Robert W. Floyd
%T On the nonexistence of a phrase structure grammar for Algol 60
%J Communications of the ACM
%K cacm
%V 5
%N 9
%D September 1962
%P 483-484

%A Julian Feldman
%T TALL - a last processor for the Philco 2000 computer
%J Communications of the ACM
%K cacm
%V 5
%N 9
%D September 1962
%P 484-485

%A G.W. Armerding
%A F.J. Gruenberger
%A S.L. Marks
%A T.R. Parkin
%T A one-day look at computing
%J Communications of the ACM
%K cacm
%V 5
%N 9
%D September 1962
%P 486-487

%A Armando G. Mendoza
%T A dispersion pass algorithm for the polyphase merge
%J Communications of the ACM
%K cacm
%V 5
%N 10
%D October 1962
%P 502-504

%A H.D. Baecker
%T Implementing a stack
%J Communications of the ACM
%K cacm
%V 5
%N 10
%D October 1962
%P 505-507

%A M.P. Barnett
%A R.P. Futrelle
%T Syntactic analysis by digital computer
%J Communications of the ACM
%K cacm
%V 5
%N 10
%D October 1962
%P 515-526
%K Shadow

%A Robert W. Floyd
%T On ambiguity in phrase structure languages
%J Communications of the ACM
%K cacm
%V 5
%N 10
%D October 1962
%P 526
%K dangling else

%A Lawrence Stack
%A Mitsuharu Okajima
%A Gerald H. Whipple
%T Computer pattern recognition techniques: electrocardiograph diagnosis
%J Communications of the ACM
%K cacm
%V 5
%N 10
%D October 1962
%P 527-532

%A Martin Lipkin
%A Max A. Woodbury
%T Coding of medical case history data for computer analysis
%J Communications of the ACM
%K cacm
%V 5
%N 10
%D October 1962
%P 532-534

%A A.B. Kahn
%T Topological sorting of large networks
%J Communications of the ACM
%K cacm
%V 5
%N 11
%D November 1962
%P 558-562

%A Howard B. Newcombe
%A James M. Kennedy
%T Record linkage
%J Communications of the ACM
%K cacm
%V 5
%N 11
%D November 1962
%P 563-566

%A L. Stark
%A R. Payne
%A Y. Okabe
%T Online digital computer for measurement of a neurological control system
%J Communications of the ACM
%K cacm
%V 5
%N 11
%D November 1962
%P 567-568

%A Saul Gorn
%T Mechanical pragmatics:
a time-motion study of a miniature mechanical linguistic system
%J Communications of the ACM
%K cacm
%V 5
%N 12
%D December 1962
%P 576-589

%A Bernard A. Galler
%A Alan J. Perlis
%T Compiling matrix operations
%J Communications of the ACM
%K cacm
%V 5
%N 12
%D December 1962
%P 590-594

%A Donald E. Knuth
%T Evaluation of polynomials by computer
%J Communications of the ACM
%K cacm
%V 5
%N 12
%D December 1962
%P 595-599

%A G.J. Vasilakos
%T A decision matrix as the basis for a simple data input routine
%J Communications of the ACM
%K cacm
%V 5
%N 12
%D December 1962
%P 599-601

%A Roy N. Freed
%T Legal implications of computer use
%J Communications of the ACM
%K cacm
%V 5
%N 12
%D December 1962
%P 607-612

%A David D. Morrison
%A James D. Riley
%A John F. Zancanaro
%T Multiple shooting method for two-point boundary value problems
%J Communications of the ACM
%K cacm
%V 5
%N 12
%D December 1962
%P 613-614

%A H.K. Schuff
%T The use of digital computers in Western Germany
%J Communications of the ACM
%K cacm
%V 5
%N 12
%D December 1962
%P 615-617

%E Peter Naur
%T Revised report on the algorithmic language Algol 60
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 1-17

%E M. Woodger
%T Supplement to the Algol 60 report
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 18-20

%Q American Standards Association Subcommittee X3.4.2
%T Suggestions on Algol 60 (ROME) issues
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 20-23

%A Melvin E. Conway
%T Arithmetizing declarations: an application to Cobol
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 24-27

%A A.K. Scidmore
%A B.L. Weinberg
%T Storage and search properties of a tree-organized memory system
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 28-31

%A M.J.R. Healy
%A B.P. Bogert
%T Fortran subroutines for time series analysis
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 32-34

%A J.H. Cadwell
%T A recursive program for the general n-dimensional integral
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 35-36

%A G. Marsaglia
%T Generating discrete random variables in a computer
%J Communications of the ACM
%K cacm
%V 6
%N 1
%D January 1963
%P 37-38

%A Joan C. Miller
%A Clifford J. Maloney
%T Systematic mistake analysis of digital computer programs
%J Communications of the ACM
%K cacm
%V 6
%N 2
%D February 1963
%P 58-63

%A L.D. Yarbrough
%T Decimal-to-binary conversion of short fields
%J Communications of the ACM
%K cacm
%V 6
%N 2
%D February 1963
%P 63-64

%A Mandalay Grems
%T Glossary construction
%J Communications of the ACM
%K cacm
%V 6
%N 2
%D February 1963
%P 64-65

%A William C. White
%A Marviun B. Shapiro
%A Arnold W. Pratt
%T Linear programming applied to ultraviolet absorption spectroscopy
%J Communications of the ACM
%K cacm
%V 6
%N 2
%D February 1963
%P 66-67

%A Victor H. Yngve
%A Jean E. Sammet
%T Toward better documentation of programming languages
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 76

%A Peter Naur
%T Documentation problems: Algol 60
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 77-79

%A Joseph F. Cunningham
%T Cobol
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 79-82

%A Victor H. Yngve
%T Comit
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 83-84

%A W.P. Heising
%T Fortran
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 85-86

%A Allen Newell
%T Documentation of IPL-V
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 86-89

%A Christopher J. Shaw
%T Jovial and its documentation
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 89-91

%A M.H. Halstead
%T Neliac
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 91-92

%A M.J. Garber
%T Addressing an array Y in k-dimensions by Fortran for analysis of variance
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 100-101

%A Gene T. Thompson
%T Characteristic values and vectors of defective matrices
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 106-107

%A Perry A. Scheinok
%T A computational extension of the variate difference method
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 107-108

%A H.A. Luther
%T An iterative factorization technique for polynomials
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 108-110

%A Max Goldstein
%T Significance arithmetic on a digital computer
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 111-117

%A W.D. Climensson
%T RECOL - a retrieval command language
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 117-122

%A V.<W. Whitley
%T Everyman's information retrieval system
%J Communications of the ACM
%K cacm
%V 6
%N 3
%D March 1963
%P 123-126

%A W. Barkley Fritz
%T Selected definitions
%J Communications of the ACM
%K cacm
%V 6
%N 4
%D April 1963
%P 152-158

%Q ACM
%T Official actions and responses to Algol as a programming language
%J Communications of the ACM
%K cacm
%V 6
%N 4
%D April 1963
%P 159-160

%A Miriam G. Shoffner
%A Peter J. Brown
%T A suggested method of making fuller use of strings in Algol 60
%J Communications of the ACM
%K cacm
%V 6
%N 4
%D April 1963
%P 169-171

%A Brian Gluss
%T Least squares fitting of planes to surfaces using dynamic programming
%J Communications of the ACM
%K cacm
%V 6
%N 4
%D April 1963
%P 172-175

%A C.C. Gotlieb
%T Sorting on computers
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 194-201

%A Martin A. Goetz
%T Internal and tape sorting using the replacement-selection technique
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 201-206

%A Thomas N. Hibbard
%T An empirical study of minimal storage sorting
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 206-213

%A Harold H. Manker
%T Multiphase sorting
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 214-217

%A W. David Malcolm,\ Jr.
%T String distribution for the polyphase sort
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 217-220

%A R.L. Gilstad
%T Read-backward polyphase sorting
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 220-223

%A Martin A. Goetz
%A Gloria S. Toth
%T A comparison between the polyphase and oscillating sort techniques
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 223-225

%A Norman C. French
%T Computer planned collates
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 225-227

%A William S. Cooke
%T A tape file merge pattern generator
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 227-230

%A John B. Glore
%T Sorting nonredundant files - techniques used in the FACT compiler
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 231-240

%A Joel Falkin
%A Sal Savastano,\ Jr.
%T Sorting with large volume, random access, drum storage
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 240-244

%A Martin A. Goetz
%T Organization and structure of data on disk file memory systems
for efficient sorting and other data processing programs
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 245-248

%A George U. Hubbard
%T Some characteristics of sorting in computing systems
using random access storage devices
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 248-255

%A J.B. Paterson
%T The Cobol sort verb
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 255-258

%A Michael H. Hall
%T A method of comparing the time requirements of sorting methods
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 259-263

%A Martin A. Goetz
%T Design and characteristics of a variable-length record sort
using new fixed-length record sorting techniques
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 264-267

%A David J. Waks
%T Conversion, reconversion and comparison techniques in variable-length sorting
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 267-272

%A Edward H. Sussenguth,\ Jr.
%T Use of tree structures for processing files
%J Communications of the ACM
%K cacm
%V 6
%N 5
%D May 1963
%P 272-279

%A R.W. Bemer
%T A note on range transformations for square root and logarithm
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 306-307

%A Elizabeth Wall
%A Richard M. Brown
%T A penny-matching program
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 307-308

%A Catherine Britton
%A I.F. Wagner
%T A computer program for analysis of variance for a 2-level factorial design
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 308-309

%A R.W. Conway
%A W.L. Maxwell
%T CORC - the Cornell computing language
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 317-321

%A Marek Greniewski
%A Wladislaw Turski
%T The external language KLIPA for the URAL-2 digital computer
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 321-324

%A H.N. Cantrell
%T Incompressible flow network calculations
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 325-329

%A Thomas Schick
%T Disk file sorting
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 330-331

%A Harry Rudloe
%A Martin Deutsch
%A Thomas Marill
%T PIP: a photo-interpretive program for the analysis of spark-chamber data
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 332-335

%A Raymond A. Kliphardt
%T DESCRIPTRAN - automated descriptive geometry
%J Communications of the ACM
%K cacm
%V 6
%N 6
%D June 1963
%P 336-339

%A H.D. Huskey
%A Ralph Love
%A Niklaus Wirth
%T A syntactic description of BC NELIAC
%J Communications of the ACM
%K cacm
%V 6
%N 7
%D July 1963
%P 367-375

%A R.V. Head
%T Real-time programming specifications
%J Communications of the ACM
%K cacm
%V 6
%N 7
%D July 1963
%P 376-383

%A John McCarthy
%A Fernando J. Corbato
%A Marjorie M. Daggett
%T The linking segment subprogram language and linking loader
%J Communications of the ACM
%K cacm
%V 6
%N 7
%D July 1963
%P 391-395

%A Melvin E. Conway
%T Design of a separable transition-diagram compiler
%J Communications of the ACM
%K cacm
%V 6
%N 7
%D July 1963
%P 396-408

%A Benson H. Scheff
%T A catalogue entry retrieval system
%J Communications of the ACM
%K cacm
%V 6
%N 7
%D July 1963
%P 409-412

%Q ASA
%T American standard code for information interchange
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 422-426
%K ascii

%A M. Lehman
%A Z. Netter
%A R. Eshed
%T SABRAC, a time-sharing low-cost computer
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 427-429

%A H. Earl Ferguson
%A Elizabeth Berner
%T Debugging systems at the source language level
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 430-432

%A Henry J. Bowlden
%T A list-type storage technique for alphameric information
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 433-434

%A H.D. Baecker
%T Mapped list structures
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 435-438

%A J. Eickel
%A M. Paul
%A F.L. Bauer
%A K. Samelson
%T A syntax controlled generator of formal language processors
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 451-455

%A Alfonso Caracciolo di\ Forino
%T Some remarks on the syntax of symbolic programming languages
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 456-460

%A Arthur F. Kaupe,\ Jr.
%T A note on the dangling else in Algol 60
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 460-462

%A I.C. Pyle
%T Dialects of Fortran
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 462-467

%A M.P. Barnett
%T Continued operation notation for symbol manipulation and array processing
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 467-472

%A Arthur B. Kahn
%T Skeletal structure of PERT and CPA computer programs
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 473-479

%A Jesse H. Katz
%T Simulation of a traffic network
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 480-486

%A Wayne A. Danielson
%A Bruce Briggs
%T A computer program for editing the news
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 487-490

%A David A. Pope
%T An exponential method of numerical integration
of ordinary differential equations
%J Communications of the ACM
%K cacm
%V 6
%N 8
%D August 1963
%P 491-493

%A John M. Blatt
%T Ye indiscreet monitor
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 506-510

%A J.F. Egler
%T A procedure for converting logic table conditions
into an efficient sequence of test instructions
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 510-514

%A J. Weizenbaum
%T Symmetric list processor
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 524-543
%K SLIP

%A H.J. Gawlik
%T MIFRAC: a compiler based on standard mathematical notation and plain English
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 545-547

%A Niklaus Wirth
%T A generalization of Algol
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 547-554

%A Donald E. Knuth
%T Computer-drawn flowcharts
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 555-563

%A D. Greenspan
%A M. Yohe
%T On the approximate solution of delta u = F(u)
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 564-568

%A K.W. Smillie
%T A general program for the analysis of square and rectangular lattice designs
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 568-572

%A E.M. McCormick
%T Group participation computer demonstration
%J Communications of the ACM
%K cacm
%V 6
%N 9
%D September 1963
%P 573-574

%A Frank Coss
%T A profile of the programmer
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 592-594

%Q ECMA
%T ECMA subset of Algol 60
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 595-597

%A Robert J. Rossheim
%T Report on proposed American Standard
flowchart symbols for information processing
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 599-604

%A M.J. Bailey
%A M.P. Barnett
%A R.P. Futrelle
%T Format-free input in Fortran
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 605-608

%A Naomi Rotenberg
%A Ascher Opler
%T Variable width stacks
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 608-610

%A G.M. Weinberg
%A G.L. Gressett
%T An experiment in automatic verification of programs
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 610-613

%A George Hutchinson
%T Partitioning algorithms for finite sets
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 613-614

%A M.O. Dayhoff
%T A contour-map program for X-ray crystallography
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 620-622

%A Thomas Marill
%A Daniel Edwards
%A Wallace Feurzeig
%T DATA-DIAL: two-way communication with computers from ordinary dial telephones
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 622-624

%A Glenn V. Dalrymple
%A Ruheri Perez-Tamayo
%T A numerical method for the determination of moving field isodose curves
for treatment planning in radiotherapy
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 625-626

%A James D. Edwards
%T An automatic data acquisition and inquiry system using disk files
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 626-630

%A R.G. Carlson
%A E.A. Voorhees
%T Use of the disk file on Stretch
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 631-634

%A Herman Hess
%T A comparison of disks and tapes
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 635-638

%A P. Krolak
%A L. Cooper
%T An extension of Fibonaccian search to several variables
%J Communications of the ACM
%K cacm
%V 6
%N 10
%D October 1963
%P 639-641

%A S.A. Brown
%A C.E. Drayton
%A B. Mittman
%T A description of the APT language
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 649-658

%A J.F. Traub
%T USA participation in an international standard glossary
on information processing
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 658-659

%A John A. Gosden
%A Roger E. Gay
%A John L. Jones
%A Jack N. Merner
%A Christopher J. Shaw
%T Report of a visit to discuss common programming languages
in Czechoslovakia and Poland, 1963
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 660-661

%A Don L. Weimer
%T A serial technique to determine minimum paths
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 664-666

%A E.T. Irons
%T An error-correcting parse algorithm
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 669-673

%A Mark B. Wells
%T Recent improvements in MADCAP
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 674-678

%A Jesse H. Katz
%T Optimizing bit-time computer simulation
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 679-685

%A Donald E. Knuth
%T Length of strings for a merge sort
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 685-688

%A I.C. Tang
%T On the computation of a certain type of incomplete Beta functions
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 689

%A Leonard D. Gross
%T Coding clinical laboratory data for automatic storage and retrieval
%J Communications of the ACM
%K cacm
%V 6
%N 11
%D November 1963
%P 690-694

%A James B. Eckert
%T Account classification at automating banks
%J Communications of the ACM
%K cacm
%V 6
%N 12
%D December 1963
%P 701-704

%A George J. Leibowitz
%T Recent developments affecting ADP in tax administration
%J Communications of the ACM
%K cacm
%V 6
%N 12
%D December 1963
%P 704-708

%A M. Sanders
%T TELEFILE - a case study of an online savings bank application
%J Communications of the ACM
%K cacm
%V 6
%N 12
%D December 1963
%P 708-712

%A Roy N. Freed
%T Some legal implications of the use of computers in the banking business
%J Communications of the ACM
%K cacm
%V 6
%N 12
%D December 1963
%P 713-720

%A Christopher J. Shaw
%T A specification of Jovial
%J Communications of the ACM
%K cacm
%V 6
%N 12
%D December 1963
%P 721-736

%A M.P. Barnett
%T Indexing and the A notation
%J Communications of the ACM
%K cacm
%V 6
%N 12
%D December 1963
%P 740-745

%A G. Marsaglia
%A M.D. McLaren
%A T.A. Bray
%T A fast procedure for generating normal random variables
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 4-10

%A Robert T. Gregory
%A James L. Raney
%T Floating-point arithmetic with 84-bit numbers
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 10-13

%A Jan V. Garwick
%T GARGOYLE, a language for compiler writing
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 16-20

%A R.H. Miller
%T An example in "significant-digit" arithmetic
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 21

%A James T. Day
%A George W. Collins,\ II
%T On the numerical solution of boundary value problems
for linear ordinary differential equations
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 22-23

%A Henry C. Thacher,\ Jr.
%T An efficient composite formula for multidimensional quadrature
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 23-25

%A Stephen H. Unger
%T GIT - a heuristic program
for testing pairs of directed line graphs for isomorphism
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 26-34

%A Donald Robbins
%A W.E. Taylor
%T Digital computer determination of alpha source activity
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 34-38

%A Beatrice H. Worsley
%T Analysis of decay-type data
%J Communications of the ACM
%K cacm
%V 7
%N 1
%D January 1964
%P 39-44

%A Gene F. Rose
%T An extension of Algol-like languages
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 52-61

%A Robert W. Floyd
%T Bounded context syntactic analysis
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 62-67

%A E.T. Irons
%T "Structural connections" in formal languages
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 67-72

%A B.M. Leavenworth
%T Fortran IV as a syntax language
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 72-80

%A Kenneth E. Iverson
%T Formalism in programming languages
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 80-88

%A A.J. Perlis
%T A format language
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 89-97

%A T.B. Steel,\ Jr.
%T Beginnings of a theory of information handling
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 97-103

%A Lionello A. Lombardi
%T A general business-oriented language based on decision expressions
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 104-111

%A R.W. Allard
%A K.A. Wolf
%A R.A. Zemlin
%T Some effects of the 6600 computer on language structures
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 112-119

%A R.A. Brooker
%T A programming package for some general modes of arithmetic
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 119-127

%A A.J. Perlis
%A Renato Iturriaga
%T An extension to Algol for manipulating formulae
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 127-130

%A Douglas T. Ross
%T On context and ambiguity in parsing
%J Communications of the ACM
%K cacm
%V 7
%N 2
%D February 1964
%P 131-133

%A James P. Anderson
%T A note on some compiling algorithms
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 149-150

%A M.P. Barnett
%A J.M. Gerard
%A A.W. Sambles
%T Comments on "A continued operation notation"
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 150-152

%A Roger A. MacGowan
%T Fortran subroutines for time series data reduction
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 153-157

%A R.L. McAllester
%T Polyphase sorting with overlapped rewind
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 158-159

%A J. Csima
%A C.C. Gotlieb
%T Tests on a computer method for constructing school timetables
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 160-163

%A Harry A. Clampett,\ Jr.
%T Randomized binary searching with tree structures
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 164-165

%A Eugene S. Schwartz
%A Bruce Kallick
%T Generating a canonical prefix encoding
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 166-169

%A E.E. Zajac
%T Computer-made perspective movies as a scientific and communication tool
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 169-170

%A Fred J. Damerau
%T A technique for computer detection and correction of spelling errors
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 171-176

%A H.A. Luther
%T A class of iterative techniques for the factorization of polynomials
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 177-179

%A C.V.D. Forrington
%T A Fourier series method for the numerical solution
of a class of parabolic partial differential equations
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 179-181

%A Henry C. Thacher,\ Jr.
%T Conversion of a power to a series of Chebyshev polynomials
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 181-182

%A H. James Wilcox
%T Digital data processor for tracking the partially illuminated moon
%J Communications of the ACM
%K cacm
%V 7
%N 3
%D March 1964
%P 183-188

%A Thomas A. Keenan
%T Computers and education
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 205-209

%A A.J. Perlis
%T Programming of digital computers
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 210-211

%A Bruce W. Arden
%T On introducing digital computing
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 212-214

%A George E. Forsythe
%T An undergraduate curriculum in numerical analysis
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 214-215

%A Robert R. Korfhage
%T Logic for the computer sciences
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 216-218

%A Saul Gorn
%T Mechanical languages: a course specification
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 219-222

%A David E. Muller
%T The place of logical design and switching theory in the computer curriculum
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 222-225

%A William F. Atchison
%A John W. Hamblen
%T Status of computer science curricula in colleges and universities
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 225-227

%A Theodor D. Sterling
%A M. Lichstein
%A F. Scarpino
%A D. Stuebing
%A William Stuebing
%T Professional computer work for the blind
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 228-230

%A Daniel Bobrow
%A Bertram Raphael
%T A comparison of list-processing computer languages
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 231-240

%A Sally L. Empey
%T Computer applications in medicine and the biological sciences;
bibliography II
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 245-251

%A A. Denisov
%A G. Popov
%A Richard W. Judy (translator)
%T Designing a computer center
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 252-255

%A Joseph L. Balintfy
%T Menu planning by computer
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 255-259

%A H.P. Edmundson
%T Problems in automatic abstracting
%J Communications of the ACM
%K cacm
%V 7
%N 4
%D April 1964
%P 259-263

%A D.E. Knuth
%A L.L. Bumgarner
%A P.Z. Ingerman
%A J.N. Merner
%A D.E. Hamilton
%A M.P. Lietzke
%A D.T. Ross
%T A proposal for input-output conventions in Algol 60
%J Communications of the ACM
%K cacm
%V 7
%N 5
%D May 1964
%P 273-283

%A Christopher J. Shaw
%T On declaring arbitrarily coded alphabets
%J Communications of the ACM
%K cacm
%V 7
%N 5
%D May 1964
%P 288-290

%A Melvin Klerer
%A Jack May
%T An experiment in a user-oriented computer system
%J Communications of the ACM
%K cacm
%V 7
%N 5
%D May 1964
%P 290-294

%A M.D. MacLaren
%A G. Marsaglia
%A T.A. Bray
%T A fast procedure for generating exponential random variables
%J Communications of the ACM
%K cacm
%V 7
%N 5
%D May 1964
%P 298-300

%A Bernard A. Galler
%A Michael J. Fisher
%T An improved equivalence algorithm
%J Communications of the ACM
%K cacm
%V 7
%N 5
%D May 1964
%P 301-303

%A Arthur M. Rosenberg
%T Computer-usage accounting for generalized time-sharing systems
%J Communications of the ACM
%K cacm
%V 7
%N 5
%D May 1964
%P 304-308

%A Benson Perry
%A Mortimer L. Mendelsohn
%T Picture generation with a standard line printer
%J Communications of the ACM
%K cacm
%V 7
%N 5
%D May 1964
%P 311-313

%A J.S. Aronofsky
%T Growing applications of linear programming
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 325-332

%A M.J. Bailey
%A M.P. Barnett
%A P.B. Burleson
%T Symbol manipulation in Fortran - SASP I subroutines
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 339-346

%A A. Hassitt
%T Design and implementation of a general-purpose input routine
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 350-355

%A Jack M. Wolfe
%T Reducing truncating errors by programming
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 355-356

%A W.T. Comfort
%T Multiword list items
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 357-362

%A W.J. Brian
%T A parts breakdown technique using list structures
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 362-365

%A James F. Holt
%T Numerical solution of nonlinear two-point boundary problems
by finite difference methods
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 366-373

%A Donald Greenspan
%T Approximate solution of axially symmetric problems
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 373-377

%A James M. Ortega
%T Generation of test matrices by similarity transformations
%J Communications of the ACM
%K cacm
%V 7
%N 6
%D June 1964
%P 377-378

%A Saul Rosen
%T A compiler-building system developed by Brooker and Morris
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 403-414

%A K.C. Peng
%T Programming analysis of variance
by sequences of operators and isomorphic mappings
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 415-416

%A Herbert Kanner
%T An automatic loader for subroutine nests
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 417-417

%A R.L. ver\ Steeg
%T Talk - a high level source language debugging technique
with real-time data extraction
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 418-419

%A O.G. Mancino
%T Characteristics of the Fortran CEP language
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 423-424

%A O.T. Gatto
%T Autosate
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 425-432

%A H. Hellerman
%T Experimental personalized array translator system
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 433-438

%A Jack Belzer
%A W. Goffman
%T Theoretical considerations in information retrieval systems
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 439-441

%A Melvin A. Breuer
%T Techniques for the simulation of computer logic
%J Communications of the ACM
%K cacm
%V 7
%N 7
%D July 1964
%P 443-446

%A R.E. Wengert
%T A simple automatic derivative evaluation program
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 463-464

%A R.D. Wilkins
%T Investigation of a new analytical method for numerical derivative evaluation
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 465-471

%A Marvin L. Stein
%T Divide-and-correct methods for multiple precision division
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 472-474

%A Marjorie P. Lietzke
%T A method of syntax-checking Algol 60
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 475-478

%A W. Fraser
%A J.F. Hart
%T Near-minimax polynomial approximations and partitioning of intervals
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 486-489

%A Roger J. Weldon
%T Machine controls for analysis of variance
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 490-494

%A Sol Broder
%T Final examination scheduling
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 494-498

%A Sheila A. Greibach
%T Formal parsing systems
%J Communications of the ACM
%K cacm
%V 7
%N 8
%D August 1964
%P 499-504

%A Jack B. Dennis
%T A multiuser computation facility for education and research
%J Communications of the ACM
%K cacm
%V 7
%N 9
%D September 1964
%P 521-529

%A G.M. Weinberg
%T Solution of combinatorial problems
using generating functions on a variable-field computer
%J Communications of the ACM
%K cacm
%V 7
%N 9
%D September 1964
%P 530-534

%A Claire K. Schultz
%A Alan Brooks
%A Phyllis Schwartz
%T Scheduling meetings with a computer
%J Communications of the ACM
%K cacm
%V 7
%N 9
%D September 1964
%P 534-541

%A Richard K. Bennett
%A H. David Neumann
%T Extension of existing compilers by sophisticated use of macros
%J Communications of the ACM
%K cacm
%V 7
%N 9
%D September 1964
%P 541-542

%A D.R. Fitzwater
%T A storage allocation and reference structure
%J Communications of the ACM
%K cacm
%V 7
%N 9
%D September 1964
%P 542-545

%A Norman Davis
%A Robert L. Berger
%T A computer analysis method for thermal diffusion in biochemical systems
%J Communications of the ACM
%K cacm
%V 7
%N 9
%D September 1964
%P 547-551

%A John R.B. Whittlesey
%T A rapid method for digital filtering
%J Communications of the ACM
%K cacm
%V 7
%N 9
%D September 1964
%P 552-556

%A Reed C. Lawlor
%T Copyright aspects of computer usage
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 572-577

%A Joseph P. Kates
%T Computer patent disclosures
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 578-579

%A Gunter A. Hauptman
%T Joint inventorship of computers
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 579-580

%A Kenneth B. Hamlin
%T Computer programs are patentable
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 581-582

%A Morton C. Jacobs
%T Patent protection of computer programs
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 583-584

%A M.V. Wilkes
%T Constraint-type statements in programming languages
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 587-588

%A Kenneth E. Iverson
%T A method of syntax specification
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 588-589

%A W.P. Heising
%T History and summary of Fortran standardization development for the ASA
%J Communications of the ACM
%K cacm
%V 7
%N 10
%D October 1964
%P 590-625

%A Ramon D. Faulk
%T An inductive approach to language translation
%J Communications of the ACM
%K cacm
%V 7
%N 11
%D November 1964
%P 647-653

%A Thomas B. Kelley
%T Rounding problems in commercial data processing
%J Communications of the ACM
%K cacm
%V 7
%N 11
%D November 1964
%P 654-656

%A Robert M. Baer
%A Martin G. Redlich
%T Multiple-precision arithmetic and the exact calculation
of the 3-j, 6-j, and 9-j symbols
%J Communications of the ACM
%K cacm
%V 7
%N 11
%D November 1964
%P 657-659

%A Alice S. Maher
%T A technique for reading gapless tapes
makes electrocardiograph analysis feasible on the IBM 7090
%J Communications of the ACM
%K cacm
%V 7
%N 11
%D November 1964
%P 663-665

%A R. Bellman
%A C. Collier
%A H. Kagiwada
%A R. Kalaba
%A R. Selvester
%T Estimation of heart parameters using skin potential measurements
%J Communications of the ACM
%K cacm
%V 7
%N 11
%D November 1964
%P 666-668

%A Roy E. Heistand
%T An executive system implemented as a finite-state automaton
%J Communications of the ACM
%K cacm
%V 7
%N 11
%D November 1964
%P 669-677

%A L.E.S. Green
%T Time sharing in a traffic control program
%J Communications of the ACM
%K cacm
%V 7
%N 11
%D November 1964
%P 678-682

%A H.D. Wactlar
%A M.P. Barnett
%T Mechanization of tedious algebra
- the e coefficients of theoretical chemistry
%J Communications of the ACM
%K cacm
%V 7
%N 12
%D December 1964
%P 704-710

%A Peter White
%T Relative effects of central processor and input-output speeds
on throughput on the large computer
%J Communications of the ACM
%K cacm
%V 7
%N 12
%D December 1964
%P 711-714

%A W.J. Cody
%T Double-precision square root for the CDC-3600
%J Communications of the ACM
%K cacm
%V 7
%N 12
%D December 1964
%P 715-718

%A C.A. Oster
%T Limited bit manipulation using Fortran II
%J Communications of the ACM
%K cacm
%V 7
%N 12
%D December 1964
%P 719-721

%A I. Gargantini
%A T. Pomentale
%T Rational Chebyshev approximations to the Bessel function integrals Kis(x)
%J Communications of the ACM
%K cacm
%V 7
%N 12
%D December 1964
%P 727-730

%A J. Nievergelt
%T Parallel methods for integrating ordinary differential equations
%J Communications of the ACM
%K cacm
%V 7
%N 12
%D December 1964
%P 731-733

%A L. Petrone
%A C.E. Vandoni
%T Integer and signed constants in Algol
%J Communications of the ACM
%K cacm
%V 7
%N 12
%D December 1964
%P 734-735

%A George Radin
%A H. Paul Rogoway
%T NPL: highlights of a new programming language
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 8-17

%A J.M. Gerard
%A I.G. Izsak
%A M.P. Barnett
%T Mechanization of tedious algebra: the Newcomb operators of planetary theory
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 27-32

%A D.R. Ross
%T Reducing truncation errors using cascading accumulators
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 32-33

%A P.A. Samet
%T Subroutine assembly
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 34

%A C.V. Ramamoorthy
%T Code structures for protection and manipulation of variable-length items
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 35-37

%A H.W. Kirk
%T Use of decision tables in computer programming
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 41-43

%A R.G. Loomis
%T Boundary networks
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 44-48

%A Gerald H. Whipple
%A James F. Dickson
%A Hiroshi Horibe
%A Lawrence Stark
%T Remote, online, real-time computer diagnosis
of the clinical electrocardiogram
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 49-52

%A R.F. Simmons
%T Answering English questions by computer: a survey
%J Communications of the ACM
%K cacm
%V 8
%N 1
%D January 1965
%P 53-70

%A P.J. Landin
%T A correspondence between Algol 60 and Church's lambda notation: part I
%J Communications of the ACM
%K cacm
%V 8
%N 2
%D February 1965
%P 89-101

%A Elaine L. Lahners
%T Automation of the radioisotope accountability system
%J Communications of the ACM
%K cacm
%V 8
%N 2
%D February 1965
%P 107-110

%A Alan Batson
%T The organization of symbol tables
%J Communications of the ACM
%K cacm
%V 8
%N 2
%D February 1965
%P 111-112

%A George D. Montillon
%T A computer user-oriented system
%J Communications of the ACM
%K cacm
%V 8
%N 2
%D February 1965
%P 117-124

%A J.Y.S. Luh
%A R.J. Krolak
%T A mathematical model for mechanical part description
%J Communications of the ACM
%K cacm
%V 8
%N 2
%D February 1965
%P 125-129

%A John B. Goodenough
%T A lightpen-controlled program for online data analysis
%J Communications of the ACM
%K cacm
%V 8
%N 2
%D February 1965
%P 130-134

%A John B. Johnson
%T A class of unambiguous computer languages
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 147-149

%A O.G. Mancino
%A M.M Morandi Cecchi
%T The internal structure of the Fortran CEP translator
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 149-151

%A E.T. Irons
%T A rapid turnaround multiprogramming system
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 152-157

%A P.J. Landin
%T A correspondence between Algol 60 and Church's lambda notation: part II
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 158-165

%A S.E. Lass
%T PERT time calculations without topological ordering
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 172-174

%A Yasuhiko Ikebe
%T Note on triple-precision floating-point arithmetic with 132-bit numbers
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 175-177

%A Martin Greenberger
%T Method in randomness
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 177-179

%A E.V. Krishnamurthy
%T On a divide-and-correct method for variable precision division
%J Communications of the ACM
%K cacm
%V 8
%N 3
%D March 1965
%P 179-181

%A R.W. Conway
%A J.J. Delfausse
%A W.L. Maxwell
%A W.E. Walker
%T CLP - the Cornell list processor
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 215-216

%A Zalman A. Shavell
%T The use of FOrtran in subroutines with Cobol main programs
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 221-223

%A I.C. Pyle
%T Data input by question and answer
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 223-226

%A R.E. Bellman
%A J.D. Buell
%A R.E. Kalaba
%T Numerical integration of a differential-difference equation
with a decreasing time-lag
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 227-228

%A Richard M. Brown
%T Use of a conditional base number system
for encoding sequences of correlated characters
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 229-230

%A R.E. Bellman
%A H. Kagiwada
%A R.E. Kalaba
%T Wengert's numerical method for partial derivatives,
orbit determination and quasilinearization
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 231-232

%A James T. Day
%T On the numerical solution of an N-point boundary value problem
for linear ordinary differential equations
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 235-236

%A A.M. Krasun
%A W. Prager
%T Remark on Romberg quadrature
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 236-237

%A L.B. Doyle
%T Expanding the editing function in language data processing
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 238-243

%A D.R. Davis
%A A.D. Lin
%T Secondary key retrieval using an IBM 7090-1301 system
%J Communications of the ACM
%K cacm
%V 8
%N 4
%D April 1965
%P 243-246

%A George E. Forsythe
%A Niklaus Wirth
%T Automatic grading programs
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 275-278

%A T.V. Griffiths
%A S.R. Petrick
%T On the relative efficiencies of context-free grammar recognizers
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 289-300

%A J.B. Landwehr
%A C. McLaughlin
%A H. Mueller
%A M. Lichstein
%A S.V. Pollack
%T BLNSYS - a 1401 operating system with Braille capabilities
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 300-303

%A Walter H. Burkhardt
%T Metalanguage and syntax specification
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 304-305

%A Ascher Opler
%T Procedure-oriented language statements to facilitate parallel processing
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 306-307

%A Robert P. Larsen
%A M. Morris Mano
%T Modeling and simulation of digital networks
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 308-312

%A S.W. Marshall
%A J.A. Nelson
%A R.M. Wilenczick
%T Least-squares analysis of resonance spectra on small computers
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 313-314

%A Roger J. Weldon
%A Robert L. Baker
%T Applications of binary numbers in computer routines
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 315-318

%A B.I. Blum
%T An extended arithmetic package
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 318-320

%A Thomas G. Evans
%A D. Lucille Darley
%T DEBUG - an extension to current online debugging techniques
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 321-326

%A C.M. Philpott
%A G.V. Lago
%T A method of data list processing with application to EEG analysis
%J Communications of the ACM
%K cacm
%V 8
%N 5
%D May 1965
%P 327-330

%A Fred Gruenberger
%T The teaching of computing
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 348

%A Bernard A. Galler
%A Michael J. Fischer
%T The iteration element
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 349

%A Fred M. Tonge
%A Peter Keller
%A Allen Newell
%T QUIKSCRIPT - a SIMSCRIPT-like language for the G-20
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 350-354

%A Barry W. Smith
%T Symbolic notations for statistical tables
and an approach towards automatic system design
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 355-360

%A J.F. Traub
%T American standard and IFIP/ICC vocabularies compared
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 361-362

%A J. Nievergelt
%T On the automatic simplification of computer programs
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 366-370

%A W.S. Brown
%T An operating environment for dynamic-recursive computer programming systems
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 371-376

%A N. Budea
%A J.G. Kamena
%A R.M. Kamena
%T A technique for integrated reports from a multi-run system
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 383-384

%A Laurence I. Press
%T Conversion of decision tables to computer programs
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 385-390

%A G. Salton
%A M.E. Lesk
%T The SMART automatic document retrieval system - an illustration
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 391-398

%A Walter S. Stolz
%A Percy H. Tannenbaum
%A Frederick V. Carstein
%T A stochastic approach to the grammatical coding of English
%J Communications of the ACM
%K cacm
%V 8
%N 6
%D June 1965
%P 399-405

%A H. Kanner
%A P. Kosinski
%A C.L. Robinson
%T The structure of yet another Algol compiler
%J Communications of the ACM
%K cacm
%V 8
%N 7
%D July 1965
%P 427-438

%A W.M. McKeeman
%T Peephole optimization
%J Communications of the ACM
%K cacm
%V 8
%N 7
%D July 1965
%P 443-444

%A R.P. Rich
%A A.G. Stone
%T Method for hyphenating at the end of a printed line
%J Communications of the ACM
%K cacm
%V 8
%N 7
%D July 1965
%P 444

%A B.J. Dzurak
%A C.R. Warburton
%T The organization of structured files
%J Communications of the ACM
%K cacm
%V 8
%N 7
%D July 1965
%P 446-452

%A Susumu Kuno
%T The predictive analyzer and a path elimination technique
%J Communications of the ACM
%K cacm
%V 8
%N 7
%D July 1965
%P 453-462

%A Robert F. Rosin
%T Determining a computing center environment
%J Communications of the ACM
%K cacm
%V 8
%N 7
%D July 1965
%P 463-468

%A C.W. Gear
%T High speed compilation of efficient object code
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 483-488

%A Peter J. Smith
%T Symbolic derivatives without list processing, subroutines, or recursion
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 494-496

%A D. Gries
%A M. Paul
%A H.R. Wiehle
%T Some techniques used in the ALCOR Illinois 7090
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 496-500

%A Arnold Lapidus
%A Max Goldstein
%T Some experiments in algebraic manipulation by computer
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 501-508

%A John E. Ranelletti
%T Dynamic format specification
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 508-510

%A Richard Bellman
%A Harriet Kagiwada
%A Robert Kalaba
%T Nonlinear extrapolation and two-point boundary value problems
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 511-512

%A A.T. Berztiss
%T A note on storage of strings
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 512-513

%A Malcolm C. Harrison
%T File-handling within Fortran
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 514-515

%A P.A.D. de\ Maine
%T The self-judgement method of curve fitting
%J Communications of the ACM
%K cacm
%V 8
%N 8
%D August 1965
%P 518-526

%Q ACM Curriculum Committee on Computer Science
%T An undergraduate program in computer science - preliminary recommendations
%J Communications of the ACM
%K cacm
%V 8
%N 9
%D September 1965
%P 543-552

%A E.D. Reilly,\ Jr.
%A F.D. Federighi
%T On reversible subroutines and computers that run backwards
%J Communications of the ACM
%K cacm
%V 8
%N 9
%D September 1965
%P 557-558

%A George K. Hutchinson
%T A computer center simulation project
%J Communications of the ACM
%K cacm
%V 8
%N 9
%D September 1965
%P 559-568

%A E.W. Dijkstra
%T Solution of a problem in concurrent programming control
%J Communications of the ACM
%K cacm
%V 8
%N 9
%D September 1965
%P 569

%A P. Henrici
%A Bruce O. Watkins
%T Finding zeros of a polynomial by the Q-D algorithm
%J Communications of the ACM
%K cacm
%V 8
%N 9
%D September 1965
%P 570-574

%A R.W. Klopfenstein
%T Applications of differential equations in general problem solving
%J Communications of the ACM
%K cacm
%V 8
%N 9
%D September 1965
%P 575-578

%A J.D. Canter
%A C.E. Donaghey
%T UPLIFTS - University of Pittsburgh linear file tandem system
%J Communications of the ACM
%K cacm
%V 8
%N 9
%D September 1965
%P 579-582

%A Morris Rubinoff
%A John F. White,\ Jr.
%T Establishment of the ACM repository
and principles of the IR system applied to its operation
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 595-601

%A Yaohan Chu
%T An Algol-like computer design language
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 607-615

%A W.C. Lynch
%T Recursive solution of a class of combinatorial problems: an example
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 617-620

%A John G. Fletcher
%T A program to solve the pentomino problem by the recursive use of macros
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 621-623

%A Kenneth C. Knowlton
%T A fast storage allocator
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 623-625
%K buddy system

%A George Veronis
%T A note on the use of a digital computer
for doing tedious algebra and programming
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 625-626

%A Herbert Rubenstein
%A John B. Goodenough
%T Contextual correlates of synonymy
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 627-633

%A I.R. Neilsen
%T A simple data transmission system using the office telephone
%J Communications of the ACM
%K cacm
%V 8
%N 10
%D October 1965
%P 634-635

%A Kenneth Cohen
%A J.H. Wegstein
%T AXLE: an axiomatic language for string transformations
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 657-661

%A Saul Rosen
%A Robert A. Spurgeon
%A Joel K. Donnelly
%T PUFFT - the Purdue University fast Fortran translator
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 661-666

%A Peter Naur
%T The performance of a system for automatic segmentation of programs
within an Algol compiler (GIER Algol)
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 671-676

%A Solomon L. Pollack
%T Conversion of limited-entry decision tables to computer programs
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 677-682

%A R.K. Mueller
%A L. Cooper
%T A comparison of the primal-simplex and primal-dual algorithms
for linear programming
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 682-686

%A Keren McConlogue
%A Robert F. Simmons
%T Analyzing english syntax with a pattern-learning parser
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 687-698

%A Tomaso Pomentale
%T An algorithm for minimizing backboard wiring functions
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 699-703

%E Anthony G. Oettinger
%T A forum on centralization and documentation
%J Communications of the ACM
%K cacm
%V 8
%N 11
%D November 1965
%P 704-710

%A D.S. Fredericks
%A C.R. Warburton
%T Across machine lines in Cobol
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 731-735

%A R. Stockton Gaines
%T On the translation of machine language programs
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 736-741

%A George T. Dellert,\ Jr.
%T A use of macros in translation of symbolic assembly language
of one computer to another
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 742-748

%A R.I. Benjamin
%T The Spectra 70/45 emulator for the RCA 301
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 748-752

%A S.G. Tucker
%T Emulation of large systems
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 753-761

%A Thomas M. Olsen
%T Philco/IBM translation at problem-oriented, symbolic and binary levels
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 762-768

%A Marvin Lowell Graham
%A Peter Zilahy Ingerman
%T An assembly language for reprogramming
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 769-773

%A M.A. McCormack
%A T.T. Schansman
%A K.K. Womack
%T 1401 compatibility feature on the IBM System/360 model 30
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 773-776

%A Donald M. Wilson
%A David J. Mass
%T CAT: a 7090-3600 computer-aided translation
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 777-781

%A Mark I. Halpern
%T Machine independence: its technology and economics
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 782-785

%A James P. Anderson
%T Program structures for parallel processing
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 786-788

%A James R. Slagle
%T Experiments with a deductive question-answering program
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 792-798

%A Patrick C. Fischer
%T Multi-tape and infinite-state automata - a survey
%J Communications of the ACM
%K cacm
%V 8
%N 12
%D December 1965
%P 799-805

%A Jerome A. Feldman
%T A formal semantics for computer languages
and its application in a compiler-compiler
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 3

%A Henry C. Thacher,\ Jr.
%T Solution of transcendental equations by series reversion
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 10

%A Niklaus Wirth
%A Helmut Weber
%T Euler, a generalization of Algol, and its formal definition, part I
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 13

%Q ASA X3.2
%T Proposed American standard - one inch perforated paper tape
for information interchange
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 24

%A D.L. Fisher
%T Data, documentation and decision tables
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 26

%A Cyril G. Veinott
%T Programming decision tables in Fortran Cobol or Algol
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 31

%A B.A. Griffith
%T Remarks on computer program for the construction of school timetables
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 35

%A L. Richard Turner
%T On the confusion between '0' and 'O'
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 35

%A Joseph Weizenbaum
%T ELIZA - a computer program
for the study of natural language communication between man and machine
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 36

%A Hyman Harris
%T Comments on a problem in concurrent programming control
%J Communications of the ACM
%K cacm
%V 9
%N 1
%D January 1966
%P 45

%A W. Handler
%T On displaying the topological properties of programs
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 59

%A Robert F. Rosin
%T On PUFFT
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 59

%A William H. Burge
%T A reprogramming machine
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 60

%A Bertram Raphael
%T The structure of programming languages
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 67

%A David L. Parnas
%T A language for describing the functions of synchronous systems
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 72

%A Donald L. Wright
%T A comparison of the Fortran language implementation
for several computers
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 77

%A R.S. Ledley
%A J. Jacobsen
%A M. Belson
%T BUGSYS, a programming language for picture processing
- not for debugging
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 79

%A Niklaus Wirth
%A Helmut Weber
%T Euler, a generalization of Algol, and its formal definition, part I
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 89

%Q ASA X3.3
%T Control procedures for data communication - an ASA progress report
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 100

%A Robert V. Head
%T Dribble posting a master file
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 106

%A T.E. Hull
%A J.R. Svenson
%T Tests of probabilistic models for propagation of roundoff errors
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 108

%A Abdel Karim I. Abbas
%T The stability of the fourth order Runge-Kutta method
for the solution of systems of differential equations
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 113

%A W.C. Lynch
%T Description of a capacity, fast turnaround
university computing center
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 117

%A Robert N. Kubik
%T On applications of differential equations in general problem solving
%J Communications of the ACM
%K cacm
%V 9
%N 2
%D February 1966
%P 123

%A Jack W. Carlson
%T On determining C.S. education programs
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 135

%A Shulom Kurtz
%T In defense of Algol
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 135

%A R.P. Tewarson
%T On comparison of the algorithms for linear programming
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 136

%A Charles R. Pearson
%T On JOE
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 136

%A H. Zemanek
%T Semiotics and programming languages
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 139

%A Jack B. Dennis
%A Earl C. van\ Horn
%T Programming semantics for multiprogramming computations
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 143

%A P.J. Landin
%T The next 700 programming languages
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 157

%A R. Narasimhan
%T Syntax-directed interpretation of classes of pictures
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 166

%A Lawrence G. Roberts
%T A graphical service system with graphical syntax
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 173

%A Peter Naur
%T Program translation viewed as a general data processing problem
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 176

%A J.C. Boussard
%T An Algol compiler, construction and use
in relation to an elaborate operating system
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 179

%A Gene F. Leonard
%A John R. Goodroe
%T More on extensible machines
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 183

%A William Orchard-Hays
%T Multilevel operating systems
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 189

%A David E. Ferguson
%T Evolution of the meta-assembly program
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 190

%A Ascher Opler
%T Requirements for real time languages
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 196

%A Jules I. Schwartz
%T Online programming
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 199

%A G. Salton
%T Data manipulation and programming problems
in automatic information retrieval
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 204

%A R.F. Simmons
%T Storage and retrieval of aspects of meaning
in directed graph structures
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 211

%A Charles N. Mooers
%T TRAC, a procedure describing language for the reactive typewriter
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 215

%A Charles W. Bachman
%T A generalized language for file organization and manipulation
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 225

%A A. Caracciolo
%T Some preliminary remarks on theoretical pragmatics
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 226

%A Jean E. Sammet
%T The use of English as a programming language
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 228

%A J. Green
%T Microprogramming, emulators, and programming languages
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 230

%A S. Gorn
%T Advanced programming and the aims of standardization
%J Communications of the ACM
%K cacm
%V 9
%N 3
%D March 1966
%P 232

%A Leon Cooper
%T Comments on Professor Tewarson's letter
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 241

%A Solomon W. Golomb
%T References to pentominoes
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 241

%A J.W. de\ Bakker
%T On axle
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 242

%A David L. Parnas
%T On facilitating parallel nd multiprocessing in Algol
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 257

%A Sol Broder
%T On the problem of time table construction
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 257

%A Benson H. Scheff
%T A simple user-oriented compiler source language
for programming automatic test equipment
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 258

%A John W. Carr,\ III
%A Jerome Weiland
%T A nonrecursive method of syntax specification
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 267

%A Theodor D. Sterling
%A Seymour V. Pollack
%T Use of the computer to teach introductory statistics
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 274

%A C.M. Reeves
%T An algorithm for generating projective reduction formulas
for matrix elements of many-electron wavefunctions
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 276

%A R.J. Roystron
%A J. Gregory
%T A method for finding the least squares estimate
of the intersection point of two helices in space
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 280

%Q ASA X3.2
%T Proposed American standard - recorded magnetic tape
for information interchange (800 cpi, NRZI)
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 285

%A John Waters
%T Methods of numerical integration
applied to a system having trivial function evaluations
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 293

%A C.T. Fike
%T Starting approximations for square root calculation
on IBM System 360
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 297

%A Roger H. Simonsen
%A D. Louise Anketell
%T Mechanization of the curve fitting process, DATAN
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 299

%A George L. Cain,\ Jr.
%T A method for locating zeros of complex functions
%J Communications of the ACM
%K cacm
%V 9
%N 4
%D April 1966
%P 305

%A V.G. Sprague
%A Solomon L. Pollack
%T On storage space of decision tables
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 319

%A Niklaus Wirth
%T A note on "Program structures for parallel processing"
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 320

%A Donald E. Knuth
%T Additional comments on a problem in concurrent programming control
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 321

%A Richard F. Thomas,\ Jr.
%T Corrections to numerical data on Q-D algorithm
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 322

%A Norman Davids
%T Direct methods of computer analysis
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 323

%A Donald S. Burdick
%A Thomas H. Naylor
%T Design of computer simulation experiments for industrial systems
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 329

%A N. Macon
%A E.E. Walker
%T A Monte Carlo algorithm for assigning students to classes
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 339

%A R.B.M. Roes
%T A note on linear programming algorithm design,
a combinatorial problem
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 340

%A Charles Erwin Cohn
%T Incorporation of nonstandard input output devices
into fortran systems
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 343

%A Philip Deuel
%T On a storage mapping function for data structures
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 344

%A D.B. Mancino
%T Multiple precision floating-point conversion
from decimal-to-binary and vice verse
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 347

%A John Lions
%T Matrix reduction using the Hungarian method
for the generation of school timetables
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 349

%A M.A. Rockwell,\ Jr.
%A H. Shubin
%A M.H. Weil
%A P.F. Meagher
%T SHOCK III, a computer system as an aid in the management
of critically ill patients
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 355

%A Stephen M. Pizer
%T Simulation of radioisotope scans by computer
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 358

%A William G. Smith
%A Martin S. Solomon,\ Jr.
%T A simulation of hospital admission policy
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 362

%A Corrado Bohm
%A Giuseppe Jacopini
%T Flow diagrams, Turing machines
and languages with only two formation rules
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 366

%A Michal L. Pershing
%T On '0' and 'O'
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 371

%A Leon Shalla
%T Automatic analysis of electronic digital circuits
using list processing
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 372

%A B. Rust
%A W.R. Burrus
%A C. Schneeberger
%T A simple algorithm for computing the generalized inverse of a matrix
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 381

%Q ASA X3.2
%T Proposed American standard - eleven-sixteenths inch
perforated paper tape
%J Communications of the ACM
%K cacm
%V 9
%N 5
%D May 1966
%P 386

%A Peter Henrici
%T Test of probabilistic models for the propagation of roundoff errors
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 409

%A Stephen Potter
%T Correction to a comparison of Fortran language implementation
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 412

%A Wirth Niklaus
%A C.A.R. Hoare
%T A contribution to the development of Algol
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 413

%A David W. Hutchinson
%T A new uniform pseudorandom number generator
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 432

%A Martin B. Solomon,\ Jr.
%T Economies of scale and the IBM System 360
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 435

%A J.G. Cleary
%T A fortran technique for simplifying input to report generators
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 441

%A Basil T. Carmody
%A Paul E. Jones,\ Jr.
%T Automatic derivation of microsentences
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 443

%Q ASA X3.2
%T Proposed American standard - twelve-row punched-card code
for information interchange
%J Communications of the ACM
%K cacm
%V 9
%N 6
%D June 1966
%P 450

%A C.G. Weinott
%T More on programming decision tables
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 485

%A Anthony G. Dettinger
%T A vision of technology and education
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 487

%A Robert V. Head
%T The banking information concept
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 491

%A Peter M. Neely
%T Comparison of several algorithms for computation
of means, deviations and correlation coefficient
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 497

%A E.G. Coffman,\ Jr.
%A R.C. Wood
%T Interarrival statistics for time-sharing systems
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 500

%A John A. Boles
%A Peter T. Rux
%A frederick W. Weingarten,\ Jr.
%T Nebula, a digital computer using a 20mc glass delay line memory
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 503

%A Allen Weingarten
%T The Eschenbach drum scheme
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 509

%A K.C. Peng
%T Computational aspects of multiple covariance analysis
on a multifactor structure
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 515

%A V.G. Sigillito
%T A method for finding the m smallest values of a monotonic function
defined on ordered sets of positive integers
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 519

%A R.D. Glauz
%T Partial step integration
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 521

%A Richard Bellman
%A Harriet Kagiwada
%A Robert Kalaba
%T Quasilinearization and the calculation of eigenvalues
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 522

%A B.I. Blum
%T Free-text inputs to utility routines
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 525

%A Reino Kurki-Suonio
%T On top-to-bottom recognition and left recursion
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 527

%A T. Sterling
%A M. Gleser
%A S. Haberman
%A S. Pollack
%T Robot data screening, a solution to multivariate type problems
in the biological and social sciences
%J Communications of the ACM
%K cacm
%V 9
%N 7
%D July 1966
%P 529

%A Jeam E. Sammet
%T Survey of formula manipulation
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 555

%A Carlos Christensen
%T On the implementation of Ambit, a language for symbol manipulation
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 570

%A A. Hearn
%T Computation of algebraic properties of elementary particle reactions
using a digital computer
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 573

%A G.E. Collins
%T PM, a system for polynomial manipulation
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 578

%A R.G. Tobey
%T Experience with FORMAC algorithm design
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 589

%A Ward Douglas Maurer
%T Computer experiments in finite algebra
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 598

%A Adolfo Guzman
%A Harold V. McIntosh
%T CONVERT
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 604

%A Kenneth C. Knowlton
%T A programmer's description of L6
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 616

%A William E. Ball
%A Robert I. Berns
%T Automast, automatic mathematical analysis and symbolic translation
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 626

%A Joel Moses
%T Solution of systems of polynomial equations by elimination
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 634

%A Dale E. Jordan
%A Richard Y. Kain
%A Lewis C. Clapp
%T Symbolic factoring of polynomials in several variables
%J Communications of the ACM
%K cacm
%V 9
%N 8
%D August 1966
%P 638

%A E.J. Bell
%A C. Jennings
%T On primal-cut algorithms
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 653

%A Hartmut G.M. Huber
%T Algorithm and formula
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 653

%A Donald E. Knuth
%T Algorithm and program, information and data
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 654

%A Donald G. Audette
%T Computer technology in Communist China, 1956-1965
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 655

%A William F. Atchison
%T Mathematics for undergraduate computer scientists
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 662

%A Wallace Givens
%T Implications of the digital computer
for education in the mathematical sciences
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 664

%A N. Macon
%T Desired computer impact on undergraduate mathematics
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 666

%A F.J. Murray
%T Impact of computers on the undergraduate curriculum
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 668

%A E.P. Miles,\ Jr.
%T Comments on the suggested changes in the mathematics curricula
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 670

%A Ole-Johan Dahl
%A Kristed Nygaard
%T SIMULA - an Algol-based simulation language
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 671

%A Paul W. Abrahams
%T A final solution to the dangling else
of Algol 60 and related languages
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 679

%A Richard B. McCammon
%T Half rotations in n-dimensional Euclidean space
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 688

%A S.M. Roberts
%A Benito Flores
%T Systematic generation of Hamiltonian circuits
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 690

%A Robert F. Rosin
%T Bridging the equipment gap for processing 64-character cards
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 694

%Q ASA X3.3
%T Proposed American standard - character structure and character
parity sense for parallel-by-bit data communication in the ASCII
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 695

%A John Lions
%T A counter-example for Gotlieb's method
for the construction of school timetables
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 697

%A W.A. Zaremba
%T Proposals for graphic symbols
%J Communications of the ACM
%K cacm
%V 9
%N 9
%D September 1966
%P 698

%A M.A. Holly
%T Announcing SLIP 360
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 711

%A Richard E. Jensen
%A Ben A. Paulson
%T Calculation of successive, overlapping ionization constants
of weak acids using the Noyes equations
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 711

%A S. Gorenstein
%T Another pseudorandom number generator
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 711

%A Daniel Teichdrew
%A John Francis Lubin
%T Computer simulation -
discussion of the technique and comparison of languages
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 723

%A Robert W. Tobey
%T Eliminating monotonous mathematics with FORMAC
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 742

%A Richard Bellman
%A Robert Kalaba
%T Mathematical experimentation in time-lag modulation
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 752

%A W.C. Martin
%A K.C. Paulson
%A L. Sashkin
%T A general method of systematic interval computation
for numerical integration of initial value problems
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 754

%Q ASA X3.2
%T Code extension is ASCII - an ASA tutorial
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 758

%Q ASA X3.2
%T Proposed American standard - rectangular holes
in twelve-row punched cards
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 763

%Q ASA X3.5
%T Description of systems used for data transmission - an ASA tutorial
%J Communications of the ACM
%K cacm
%V 9
%N 10
%D October 1966
%P 764

%A Robert P. Larsen
%T Data filtering applied
to information storage and retrieval applications
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 785

%A B.M. Leavenworth
%T Syntax macros and extended translation
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 790

%A P.J.H. King
%T Conversion of decision tables to computer programs
by rule mask techniques
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 793

%A R.J. Clasen
%T Techniques for automatic tolerance control in linear programming
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 796

%A E.A. Behrens
%T Why does Grosch's law continue to be true
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 803

%A Philip Rabinowitz
%T Automatic integration of a function with a parameter
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 804

%A Robert H. Dargel
%A Frank R. Loscalzo
%A Thomas H. Witt
%T Automatic error bounds on real zeros of rational functions
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 810

%A Susumu Kund
%T The augmented predictive analyzer for context-free languages
%J Communications of the ACM
%K cacm
%V 9
%N 11
%D November 1966
%P 824

%A Rene de\ Vogelaere
%T On the solution of eigenvalue problems
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 837

%A John H. Munson
%T Bit manipulation in higher level languages
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 837

%A Aaron Finerman
%T Computing capabilities at Universities in Western Europe
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 840

%A Philip M. Sherman
%T Flowtrace, a computer program for flowcharting programs
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 845

%A R.D. Wilkins
%T General time-varying systems error sensitivities program
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 855

%A Irene Gargantini
%T On the application of the process of equalization of maxima
to obtain rational approximation to certain modified Bessel functions
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 859

%A John L. Walton
%T Tensor calculations on the computer
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 864

%A J.E. Schlater
%A W.J. Hemmerle
%T Statistical computations based upon algebraically specified models
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 865

%A Peter Bryant
%T Levels of computer systems
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 873

%A C. Abraham
%A G.N. Lance
%A T. Pearcey
%T Multiplexing of slow peripherals
%J Communications of the ACM
%K cacm
%V 9
%N 12
%D December 1966
%P 877

%A G.E. Forsythe
%T A university's educational program in computer science
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 3

%A P. Calingaert
%T System performance evaluation, survey and appraisal
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 12

%A E. Morenoff
%A J.B. McLean
%T A code for non-numeric information processing applications
in online systems
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 19

%A D.J. Aigner
%T An interpretive input routine for linear programming
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 23

%A B.E. Cooper
%T A unifying computational method
for the analysis of complete factorial experiments
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 27

%A A. Hassitt
%T Data directed input-output in fortran
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 35

%A P.W. Shantz
%A R.A. German
%A J.G. Mitchell
%A R.S.K. Shirley
%A C.R. Zarnke
%T WATFOR - the University of Waterloo Fortran IV compiler
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 41

%A P.G. Moulton
%A M.E. Muller
%T DITRAN - a compiler emphasizing diagnostics
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 45

%A W.J. Cody
%A A. Ralston
%T On computing approximations to the exponential functions
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 53

%A M. Goldberg
%T A note on the computation of least square polynomials
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 56

%A J.A.C. Bingham
%T An improvement to iterative methods of polynomial factorization
%J Communications of the ACM
%K cacm
%V 10
%N 1
%D January 1967
%P 57

%A R.O. Fisher
%A C.D. Shepard
%T Time sharing on a computer with a small memory
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 77

%A J. Cohen
%T A use of fast and slow memories in lisp processing languages
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 82

%A J. Wing
%T Abacus computation in number systems of bases other than ten
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 86

%A B.J. Gassner
%T Sorting by replacement selecting
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 89

%A G.S. Fishman
%T Problems in the statistical analysis of simulation experiments,
the comparison of means and the length of sample records
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 94

%A R.E. Bellman
%A H.H. Kagiwada
%A R.E. Kalaba
%T Invariant embedding and the numerical integration of boundary-value
problems for unstable linear systems ordinary differential equations
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 100

%A G.D. Byrne
%T Parameters for pseudo Runge-Kutta methods
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 102

%A I.B. Goldberg
%T 27 bits are not enough for 8-digit accuracy
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 105

%A L.W. Ehrlich
%T A modified Newton method for polynomials
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 107

%A S.G. Carer
%T Programming the tabular method of analysis of variance
for factorial experiments
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 109

%A S. Gorenstein
%T Testing a random number generator
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 111

%A J.L Pfaltz
%A A. Rosenfeld
%T Computer representations of planar regions by their skeletons
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 119

%A S. Shannon
%A C. Henschke
%T Stat-pack, a biostatistical programming package
%J Communications of the ACM
%K cacm
%V 10
%N 2
%D February 1967
%P 123

%A I.C. Pyle
%T Format effectors in ISO7 and ASCII
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 137

%A P.Z. Ingerman
%T "Panini-Backus form" suggested
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 137

%A N.G. de\ Bruijn
%T Additional comments on a problem in concurrent programming control
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 137

%A T. Scharf
%T More on processing 65-character cards
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 138

%A A. Orden
%T The emergence of a profession
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 145

%A E. Morenoff
%A J.B. McLean
%T Application of level changing to multilevel storage organization
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 149

%A D.G. Bobrow
%A D.L. Murphy
%T Structure of a Lisp system using two-level storage
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 155

%A E.R. Clark
%T On the automatic simplification of source-level programs
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 160

%A M. Klerer
%A J. May
%T Automatic dimensioning
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 165

%A L.D. Neidleman
%T An application of FORMAC
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 167

%A W.M. Waite
%T An efficient procedure for the generation of closed subsets
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 169

%A L. von\ Sydow
%T Computer typesetting of Algol
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 172

%A C.T. Fike
%T Methods of evaluating polynomial approximations in function routines
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 175

%A B.E. Rodden
%T Error-free methods for statistical computations
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 179

%A J.J. Walton
%T Tensor calculations on computers
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 183

%A A.M. Krall
%A R. Fornard
%T An algorithm for generating root locus diagrams
%J Communications of the ACM
%K cacm
%V 10
%N 3
%D March 1967
%P 186

%A L.G. Tesler
%T On "Systematic generation of Hamiltonian circuits"
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 201

%A R.W. Bemer
%T ESC facility in USASCII
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 202

%A B.A. Galler
%A A.J. Perlis
%T A proposal for definitions in Algol
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 204

%A H.S. Stone
%T One-pass compilation of arithmetic expressions
for a parallel processor
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 220

%A R.A. Brooker
%T Top-to-bottom parsing rehabilitated
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 223

%A M.M. Klein
%T Scheduling project networks
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 225

%A P.S. Dwyer
%A B.A. Galler
%T A method for the solution of transportation problems
with tall matrices
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 231

%A A.D. Hall,\ Jr.
%A F.S. Acton
%T Scheduling university course examinations by computer
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 235

%A E. Eisner
%T Numerical integration of a function that has a pole
%J Communications of the ACM
%K cacm
%V 10
%N 4
%D April 1967
%P 239

%A D.A. Bridger
%T Comments on "Levels of computer systems"
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 260

%A P.A. Businger
%T Fortran subroutines for scalar products
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 266

%A G.,D. Hornbuckle
%T A multiprogramming monitor for small machines
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 273

%A S. Schlesinger
%A L. Sashkin
%T Pose, a language for posing problems to a computer
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 279

%A G.S. Shedler
%T Parallel numerical methods for the solution of equations
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 286

%A J.W. Evans
%A F. Harary
%A M.S. Lynn
%T On the computer enumeration of finite topologies
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 295

%A G.G. Langdon,\ Jr.
%T An algorithm for generating permutations
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 298

%A S.K. Nandi
%A E.V. Krishnamurthy
%T A simple technique for digital division
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 299

%A C.N. Alberga
%T Strings similarities and misspellings
%J Communications of the ACM
%K cacm
%V 10
%N 5
%D May 1967
%P 302

%A K.L. Engvold
%A J.L. Hughes
%T A model for a multifunctional teaching system
%J Communications of the ACM
%K cacm
%V 10
%N 6
%D June 1967
%P 339

%A D.R. Reddy
%T Pitch period determination of speech sounds
%J Communications of the ACM
%K cacm
%V 10
%N 6
%D June 1967
%P 343

%A S.H. Cameron
%A D. Ewing
%A M. Liveright
%T Dialog, a conversation programming system
with a graphical orientation
%J Communications of the ACM
%K cacm
%V 10
%N 6
%D June 1967
%P 349

%A H.W. Lawson,\ Jr.
%T PL/I list processing
%J Communications of the ACM
%K cacm
%V 10
%N 6
%D June 1967
%P 358

%A J. Abramowich
%T Storage allocation in a certain iterative process
%J Communications of the ACM
%K cacm
%V 10
%N 6
%D June 1967
%P 368

%A G.H. Golub
%A T.N. Robertson
%T A generalized Bairstow algorithm
%J Communications of the ACM
%K cacm
%V 10
%N 6
%D June 1967
%P 371

%A R.W. Bemer
%T On format effectors
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 396

%A K. Wright
%T On Bellman's method for unstable linear systems
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 396

%A N.R. Nielsen
%T The simulation of time sharing systems
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 397

%A L. Betyar
%T A user-oriented time-shared system
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 413

%A S.E. Madnick
%T String processing techniques
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 420

%A L. Irwin
%T Implementing phase-structure productions in PL/I
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 424

%A R.W. Stineman
%T Plotting a function of three independent variables
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 425

%A J.K.S. McKay
%T On the representation of symmetric polynomials
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 428

%A D.G. Moursund
%T Optimal starting values
for Newton-Rhapson calculation of (cited function)
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 430

%A W.M. Waite
%T A language-independent macro processor
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 433

%A M.D. Callahan
%A A.E. Chapman
%T Description of basic algorithm in DETAB 65 preprocessor
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 441

%A I. Pohl
%T A method for finding Hamilton paths and knight's tours
%J Communications of the ACM
%K cacm
%V 10
%N 7
%D July 1967
%P 446

%A T.D. Truitt
%T Thoughts on continuous change simulation languages
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 463

%A D.C. Cooper
%T Bohm and Jacopini's reduction of flow charts
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 463

%A A.M. Noll
%T A computer technique for displaying n-dimensional hyperobjects
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 469

%A J. Weizenbaum
%T Contextual understanding by computers
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 474

%A D.T. Ross
%T The AED free storage package
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 481

%A I. Nakata
%T A note on compiling algorithms for arithmetic expressions
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 492

%A L.B. Smith
%T A comparison of batch processing and instant turnaround
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 495

%A H. Schorr
%A W.M. Waite
%T An efficient machine-independent procedure for garbage collection
in various list structures
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 501

%A N. Chapin
%T Parsing of decision tables
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 507

%A R.W. Bemer
%T Toward standardization of handwritten zero and oh
%J Communications of the ACM
%K cacm
%V 10
%N 8
%D August 1967
%P 513

%A J. McCarthy
%T Comments on time sharing
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 531

%A W.J. Cody,\ Jr.
%T Another aspect of economical polynomials
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 531

%A L. Yarbrough
%T Precision calculations of e and (cited function) constants
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 537

%A R.W. Conway
%A H.L. Morgan
%T Tele-cupl, a telephone time sharing system
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 538

%A J.C. Howard
%T Computer formulation of the equations of motion using tensor notation
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 543

%A H. Weber
%T A microprogrammed implementation of Euler on IBM System 360 model 30
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 549

%A R.J. Parente
%A H.S. Krasnow
%T A language for modeling and simulating dynamic systems
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 559

%A V.A. Busam
%T An algorithm for class scheduling with section preference
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 567

%A A.M. Lesk
%T Dynamic computation of derivatives
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 571

%A F. Luccio
%T A comment on index register allocations
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 572

%A B.J. Austin
%A T.H. Holden
%A R.H. Hudson
%T DAD, the C.S.I.R.O. operating system
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 575

%A J.D. Foley
%T A Markovian model of the University of Michigan executive system
%J Communications of the ACM
%K cacm
%V 10
%N 9
%D September 1967
%P 584

%A W. Squire
%T On "Numerical integration of a function that has a pole"
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 610

%A D.E. Knuth
%T The remaining trouble spots in Algol 60
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 611

%A P.J. Brown
%T The ML I macro processor
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 618

%A E.J. Bell
%T Decomposition programming, and analysis of matrix substructure
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 624

%A M.V. Mathews
%A C. Lochbaum
%A J.A. Moss
%T Three fonts of computer drawn letters
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 627

%A P.S. Rosenbaum
%T A grammar base question-answering procedure
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 630

%A J.L. Smith
%T Multiprogramming under a page demand strategy
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 636

%A R.S. Singleton
%T On computing the fast Fourier transform
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 647

%A D.A. Adams
%T A stopping criterion for polynomial root finding
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 655

%A M.C. Harrison
%A J.T. Schwartz
%T Sharer, a time sharing system for the CDC 6600
%J Communications of the ACM
%K cacm
%V 10
%N 10
%D October 1967
%P 659

%A A. de\ Matteis
%T Improvements based on computed errors
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 683

%A C.T. Fike
%T A rational approximation optimal by Moursund's criterion
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 683

%A R.J. Ord-Smith
%T Remark on Langdon's algorithm
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 684

%A E. Naddor
%T M in Z, a game for man-machine studies
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 684

%A I.C. Pyle
%T Character coding for information processing interchange
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 684

%A M.D. Destreicher
%A M.J. Bailey
%A J.I. Strauss
%T George 3 - a general purpose time sharing and operating system
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 685

%A J.H. Katz
%T An experimental model of System 360
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 694

%A T.H. Naylor
%A K. Wertz
%A T.H. Wonnacott
%T Methods for analyzing data from computer simulation experiments
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 703

%A B.A. Marron
%A P.A.D. de\ Maine
%T Automatic data compression
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 711

%A R.E. Levien
%A M.E. Maron
%T A computer system for inference execution and data retrieval
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 715

%A R.H. Shumway
%T On the expected gain from adjusting matched term retrieval systems
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 722

%Q ASA X3
%T Proposed USA standard recorded magnetic tape
for information interchange (200 cpi, NZRI)
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 730

%Q ASA X3
%T Proposed USA standard magnetic tape labels
for information interchange
%J Communications of the ACM
%K cacm
%V 10
%N 11
%D November 1967
%P 737

%A I. Pohl
%T Implementing phase-structure productions in PL/I
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 757

%A P.C. Lockemann
%A W.D. Knutsen
%T A multiprogramming environment
for online data acquisition and analysis
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 758

%A D.L. Drew
%T A LACONIQ monitor, time sharing for online dialogues
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 765

%A D.M. Dahm
%A F.H. Gerbstadt
%A M.M. Pacelli
%T A system reorganization for resource allocation
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 772

%A C.C. Gotlieb
%A D.G. Corneil
%T Algorithms for finding a fundamental set of cycles
for an undirected linear graph
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 780

%A A.E. Weinert
%T A SIMSCRIPT Fortran case study
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 784

%A L.P. Deutsch
%A B.W. Lampson
%T An online editor
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 793

%A S. Charmonman
%T Eigenvectors of a 2n*2n matrix
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 800

%A R. Bayer
%A D. Gries
%A M. Paul
%A H.R. Wiehle
%T The ALCOR Illinois 7090 7094 post mortem dump
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 804

%A E.V. Krishnamurthy
%A S.K. Nandi
%T On the normalization requirement of divisor
in divide-and-correct methods
%J Communications of the ACM
%K cacm
%V 10
%N 12
%D December 1967
%P 809

%A J.J. Duby
%T Improved Hamiltonian paths
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 1

%A H. Sackman
%A W.J. Erikson
%A E.E. Grant
%T Exploratory experimental studies
comparing on-line and off-line programming performance
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 3

%A M.I. Halpern
%T Toward a general processor for programming languages
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 15

%A D. Gries
%T Use of transition matrices in compiling
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 26

%A W.D. Maurer
%T An improved hash code for scatter storage
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 35

%A R. Morris
%T Scatter storage techniques
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 38

%A P. Rabinowitz
%T Practical error coefficients
for estimating quadrature errors for analytic functions
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 45

%A D.W. Matula
%T In-and-out conversions
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 47

%A W.S. Meisel
%T A numerical integration formula useful in Fourier analysis
%J Communications of the ACM
%K cacm
%V 11
%N 1
%D January 1968
%P 51

%A W.M. Gentleman
%T Further comment on the computation of least squares polynomials
%J Communications of the ACM
%K cacm
%V 11
%N 2
%D February 1968
%P 73

%A J. Feldman
%A D. Gries
%T Translator writing systems
%J Communications of the ACM
%K cacm
%V 11
%N 2
%D February 1968
%P 77

%A R.J. Pankhurst
%T Program overlay techniques
%J Communications of the ACM
%K cacm
%V 11
%N 2
%D February 1968
%P 119

%Q ASA X3
%T Proposed USA standard - general purpose
alphanumeric keyboard arrangement for information interchange
%J Communications of the ACM
%K cacm
%V 11
%N 2
%D February 1968
%P 126

%Q ASA X3
%T Proposed USA standard - USASCSOCR dual case keyboard arrangement
%J Communications of the ACM
%K cacm
%V 11
%N 2
%D February 1968
%P 130

%A E.W. Dijkstra
%T Go to statement considered harmful
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 147

%A B.A. Galler
%T Language protection by trademark ill-advised
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 148

%A J. Howlett
%T No trouble with Atlas I page-turning mechanism
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 149

%A J.W. Howland
%T On practicality of sieving techniques vs. the sieving algorithm
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 149

%A A.J. Van\ Reekien
%T Dealing with Neely's algorithm
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 149

%A D.R. Morrison
%T Abbreviations for computer and memory sizes
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 150

%A B.E. Rodden
%T In defense of Langdon's algorithm
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 150

%A S.R. Clark
%T Endorsing the Illinois post mortem dump
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 150

%Q ACM curriculum committee on computer science
%T Curriculum 68
- recommendations for academic programs in computer science
- a report of the ACM curriculum committee on computer science
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 151

%A D.B. Parker
%T Rules of ethics in information processing
%J Communications of the ACM
%K cacm
%V 11
%N 3
%D March 1968
%P 198

%A E.L. Harder
%T The expanding world of computers
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 231

%A S.H. Unger
%T A global parser for context-free phrase structure grammars
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 240

%A H.E. Kulsrud
%T A general purpose graphic language
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 247

%A R.E. Bellman
%A H.H. Kagiwada
%A R.E. Kalaba
%A R. Vasudevan
%T Quasilinearization and the estimation
of differential operators from eigenvalues
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 255

%A J.W. Hamblen
%T Expenditures, sources of funds, and utilization of digital computers
for research and instruction in higher education:
1964-65 with projections for 1968-69
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 257

%A E.I. Organick
%T Panel discussion on computer appreciation
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 263

%Q ASA X3
%T Proposed USA standard - data code for calendar date
for machine-to-machine data interchange
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 273

%Q ASA X3
%T Proposed USA standard - Hollerith punched card code
%J Communications of the ACM
%K cacm
%V 11
%N 4
%D April 1968
%P 275

%A L.D. Yarbrough
%T On using a graphic input tablet
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 294

%A B. Randell
%A C.J. Kuehner
%T Dynamic storage allocation systems
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 297

%A R.C. Daley
%A J.B. Dennis
%T Virtual memory, processes, and sharing in Multics
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 306

%A G. Oppenheimer
%A N. Weizer
%T Resource management for a medium scale time-sharing operating system
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 313

%A P.J. Denning
%T The working set model for program behaviour
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 323

%A K. Fuchel
%A S. Heller
%T Considerations in the design of a multiple computer system
with extended core storage
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 334

%A E.W. Dijkstra
%T The structure of the "THE" multiprogramming system
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 341

%A B.W. Lampson
%T A scheduling philosophy for multiprocessing systems
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 347

%A E.C. Van\ Horn
%T Three criteria for designing computer systems to facilitate debugging
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 360

%A R.M. Graham
%T Protection in an information processing utility
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 365

%A J.B. Dennis
%T A position paper on computing and communications
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 370

%A R.J. Abbott
%T Gathering of misleading data with little regard for privacy
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 377

%A J.D. Beyer
%T Comments on "An improved hash code for scatter storage"
%J Communications of the ACM
%K cacm
%V 11
%N 5
%D May 1968
%P 378

%A C.J. Shaw
%T On the development of a new common computer language
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 391

%A W. Givens
%T Proposed abbreviation for 1024: bK
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 391

%A J.K.S. McKay
%T On the evaluation of multiplicative combinatorial expressions
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 392

%A K. Bahr
%T An auxiliary program to analyze Lisp 1.5 programs
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 392

%A G.G. Langdon,\ Jr.
%T Generating permutations by nested cycling
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 392

%A R.H. Bartels
%A G.H. Golub
%T Stable numerical methods for obtaining
the Chebyshev solution to an overdetermined system of equations
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 401

%A W.C. Lynch
%T Reliable full-duplex file transmission
over half-duplex telephone lines
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 407

%A T.H. Myer
%A I.E. Sutherland
%T On the design of display processors
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 410

%A D. Ophir
%A S. Rankowitz
%A B.J. Shepherd
%A R.J. Spinrad
%T BRAD: the Brookhaven raster display
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 415

%A G.B. Anderson
%A D.W. Rogers
%T An inexpensive Braille terminal device
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 417

%A K. Thompson
%T Regular expression search algorithm
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 419

%A P.T. Brady
%T Writing an online debugging program for the experienced user
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 423

%Q ASA X3
%T Heading format for data transmission - a USASI tutorial
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 441

%A I.E. Sutherland
%T A futures market in computer time
%J Communications of the ACM
%K cacm
%V 11
%N 6
%D June 1968
%P 449

%A E.G. Coffman
%A L.C. Varian
%T Further experimental data
on the behaviour of programs in a paging environment
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 471

%A I.J. Good
%T Number of possible strategies when writing compilers
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 474

%A J. Kral
%T One way of estimating frequencies of jumps in a program
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 475

%A G. Nagy
%T Preliminary investigation of techniques
for automated reading of unformatted text
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 480

%A A. Wolinsky
%T A simple proof of Lewin's ordered-retrieval theorem
for associative memories
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 488

%A A. Bayes
%T A generalized partial pass block sort
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 491

%A A.C. Fisher
%A J.S. Liebman
%A G.L. Nemhauser
%T Computer construction of project networks
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 493

%A G.V. McWilliams
%A R.W. Thompson
%T Methods of convergence improvement for some improper integrals
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 499

%A H.K. Kuiken
%T Determination of the intersection points of two plane curves
by means of differential equations
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 502

%A R.W. Elliott
%T Master's level computer science curricula
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 507

%A S. Stimler
%A K.A. Brons
%T A methodology for calculating and optimizing
real-time system performance
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 509

%A J.R. Ehrman
%T "Logical" arithmetic on computers
with two's complement binary arithmetic
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 517

%A D.L. Dietmeyer
%A J.R. Duley
%T Generating prime implicants
via ternary encoding an decimal arithmetic
%J Communications of the ACM
%K cacm
%V 11
%N 7
%D July 1968
%P 520

%A J.R. Rice
%T The go to statement reconsidered
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 538

%A J.L. Deveber
%T Corrections to Stone's compiler procedures
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 538

%A D.F. Stevens
%T On overcoming high-priority paralysis in multiprogramming systems
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 539

%A P.C. Lockemann
%A W.D. Knutsen
%T Recovery of disk contents after system failure
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 542

%A J.R. Banzhaf,\ III
%T When your computer needs a lawyer
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 543

%A C.A. Lang
%A J.C. Gray
%T ASP - a ring implemented associative structure package
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 550

%A H.J. Breaux
%T A modification of Efroymson's technique
for stepwise regression analysis
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 556

%A D.G. Bobrow
%A D.. Murphy
%T A note on the efficiency of a Lisp computation in a paged machine
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 558

%A C.A. Hall
%A T.A. Porsching
%T Generation of positive test matrices with known positive spectra
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 559

%A E.F. Storm
%T Champ - character manipulation procedures
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 561

%A C.N. Mooers
%T Accommodating standards and identification of programming languages
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 574

%A T.B. Steel,\ Jr.
%T Commentary on Mr. Mooer's paper
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 576

%Q ASA X3
%T Proposed USA standard -
synchronous signaling rates for data transmission
%J Communications of the ACM
%K cacm
%V 11
%N 8
%D August 1968
%P 577

%A A.K. Fitzgerald
%T On Congressman Brooks letter re: standardization
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 593

%A G.A. Mapp
%T Proposed library of programs for personnel and related work
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 593

%A R.K. Bennett
%T A base for language definition
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 594

%A J.P. Kirscher
%T On computer appreciation in the undergraduate curriculum
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 594

%A F.C. Hutton
%T Peekabit, computer offspring of punched card Peekaboo,
for natural language searching
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 595

%A M. Rubinoff
%A S. Bergman
%A W. Franks
%A E.R. Rubinoff
%T Experimental evaluation of information retrieval
through a teletypewriter
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 598

%A P.J. Denning
%T A statistical model for console behaviour in multiuser computers
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 605

%A H. Hayashi
%A S. Duncan
%A S. Kuno
%T Graphical input-output of nonstandard characters
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 613

%A B.L. Fox
%A D.M. Landi
%T An algorithm for identifying
the ergodic subchains and transient states of a stochastic matrix
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 619

%A J.C. Dill
%A D.L. Randall
%A I. Richer
%T Plexus - an on-line system for modeling neural networks
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 622

%A G.D. Miller
%T An algorithm for the probability
of the union of a large number of events
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 630

%A J.V. Garwick
%T GPL, a truly general purpose language
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 634

%A G.W. Stewart,\ III
%A D.W. Lick
%T Numerical solution of a thin plate heat transfer problem
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 639

%A J.R.B. Whittlesey
%T A comparison of the correlational behaviour
of random number generators for the IBM 360
%J Communications of the ACM
%K cacm
%V 11
%N 9
%D September 1968
%P 641

%A H.F. Fliegel
%A T.C. Van\ Flandern
%T A machine algorithm for processing calendar dates
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 657

%A P. Abrahams
%T On "prime phase" in Feldman and Gries paper
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 657

%A H. Wooster
%T Do you use microfiche
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 657

%A R.P. Wishner
%T Comment on curriculum 68
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 658

%A B.A. Martin
%T On binary notation
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 658

%A L.B. Lesem
%A P.M. Hirsch
%A L.A. Jordan,\ Jr.
%T Computer synthesis of holograms for 3-D display
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 661

%A A. Schurmann
%T GAN, a system for generating and analyzing activity networks
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 675

%A P.J.H. King
%T Ambiguity in limited entry decision tables
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 680

%A D.F. Martin
%T Boolean matrix methods
for the detection of simple precedence grammars
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 685

%A H.V. Braden
%A W.A. Wulf
%T The implementation of a basic system
in a multiprogramming environment
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 688

%A M. Rubinoff
%A S. Bergman
%A H. Cautin
%A F. Rapp
%T Easy English, a language for information retrieval
through a remote typewriter console
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 693

%A K.J. Engvold
%A J.L. Hughes
%T A general-purpose display processing and tutorial system
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 697

%A G.D. Bergland
%T A Fast Fourier transform algorithm for real-valued series
%J Communications of the ACM
%K cacm
%V 11
%N 10
%D October 1968
%P 703

%A R. McNaughton
%T Automata, formal languages, abstract switching, and computability
in a Ph.D. computer science program
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 736

%A J.G. Jodeit
%T Storage organization in programming systems
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 739

%A S.F. Mendicino
%A R.A. Hughes
%A J.T. Martin
%A F.H. McMahon
%A J.E. Ranelletti
%A R.G. Zwakenberg
%T The LRTRAN compiler
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 745

%A R.R. Korfhage
%T A note on relevance estimate and its improvement
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 754

%A G. Marsaglia
%A T.A. Bray
%T One-line random number generators and their use in combinations
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 755

%A D. Greenspan
%T Approximate solution of initial boundary wave equation problems
by boundary value techniques
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 758

%A P. Rabinowitz
%T Practical error coefficients in the integration
of periodic analytic functions by the trapezoidal rule
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 760

%A D.G. Bobrow
%A J.B. Fraser
%T A phonological rule tester
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 764

%Q ASA X3
%T Correspondences of 8-bit and Hollerith codes
for computer environments: a USASI tutorial
%J Communications of the ACM
%K cacm
%V 11
%N 11
%D November 1968
%P 781

%A G.T. Herman
%T Simulation of one abstract computing machine by another
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 801

%A B.A. Galler
%A T.B. Pinkerton
%A B.W. Arden
%T Proprietary packages: a point of view
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 802

%A J. Maniotes
%T On Master's level curricula survey
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 802

%A W.L. Johnson
%A J.H. Porter
%A S.I. Ackley
%A D.T. Ross
%T Automatic generation of efficient lexical processors
using finite-state techniques (a tutorial)
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 805

%A J.C. Howard
%A H. Tashjian
%T An algorithm for deriving the equations of mathematical physics
by symbolic manipulation
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 814

%A S. Kuno
%A A.G. Oettinger
%T Computational linguistics in a Ph.D. computer science program
(doctoral program series)
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 831

%A R.L. Gue
%A J.C. Liggett
%A K.C. Cain
%T Analysis of algorithms for the zero-one programming problem
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 837

%A M.C. Harrison
%T The implementation of the SHARER2 time-sharing system
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 845

%Q ASA X3
%T Proposed USA standard - procedures for the standardization process
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 846

%Q ASA X3
%T Proposed USA standard - code extension procedures
for information interchange
%J Communications of the ACM
%K cacm
%V 11
%N 12
%D December 1968
%P 849

%A J.J. Cannon
%T Computers in group theory: a survey
%J Communications of the ACM
%K cacm
%V 12
%N 1
%D January 1969
%P 3

%A E.S. Lowry
%A C.W. Medloc
%T Object code optimization
%J Communications of the ACM
%K cacm
%V 12
%N 1
%D January 1969
%P 13

%A S.Y. Ku
%A R.J. Adler
%T Computing polynomial resultants
- Bezout's determinant vs. Collins' reduced P.R.S. algorithm
%J Communications of the ACM
%K cacm
%V 12
%N 1
%D January 1969
%P 23

%A B.W. Arden
%T The role of programming in a Pd.D. computer science program
(doctoral program series)
%J Communications of the ACM
%K cacm
%V 12
%N 1
%D January 1969
%P 31

%A J. Friedman
%T Directed random generation of sentences
%J Communications of the ACM
%K cacm
%V 12
%N 1
%D January 1969
%P 40

%A S. Stimler
%T Some criteria for time-sharing system performance
%J Communications of the ACM
%K cacm
%V 12
%N 1
%D January 1969
%P 47

%A R.H. Day
%A M.K. Mansfield
%A M.E. Ellis
%T CODAS: a data display system
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 67

%A Y.N. Patt
%T Variable length tree structures having minimum average search time
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 72

%A S.R. Arora
%A W.T. Dent
%T Randomized binary search technique
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 77

%A R.R. Redziejowski
%T On arithmetic expressions and trees
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 81

%A R.M. McClure
%T Simple procedures that lose precision
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 84

%A F.C. Hutton
%T Shortening the mask querying routine in Peekabit
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 84

%A W.H. Payne
%A J.R. Rabung
%A T.P. Bogyo
%T Coding the Lehmer pseudo-random number generator
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 85

%A R.F. King
%A D.L. Phillips
%T The logarithmic error and Newton's method for the square root
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 87

%A L.B. Smith
%T Interval arithmetic determinant evaluation
and its use in testing for a Chebyshev system
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 89

%A J.B. Kruskal
%T Extremely portable random number generator
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 93

%A M.R. Schroeder
%T Images from computers and microfilm plotters
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 95

%A E.G. Ulrich
%T Exclusive simulation of activity in digital networks
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 102

%A G. Salton
%T Information science in a Ph.D. computer science program
(doctoral program series)
%J Communications of the ACM
%K cacm
%V 12
%N 2
%D February 1969
%P 111

%A G.M. Berns
%T Description of Format, a text-processing program
%J Communications of the ACM
%K cacm
%V 12
%N 3
%D March 1969
%P 141

%A S.P. Morse
%T Concepts of use in contour map processing
%J Communications of the ACM
%K cacm
%V 12
%N 3
%D March 1969
%P 147

%A A.C. McCellar
%A E.G. Coffman,\ Jr.
%T Organizing matrices and matrix operations for paged memory systems
%J Communications of the ACM
%K cacm
%V 12
%N 3
%D March 1969
%P 153

%A R.F. Rosin
%T Pseudofiles
%J Communications of the ACM
%K cacm
%V 12
%N 3
%D March 1969
%P 165

%Q ANSI X3
%T Proposed USA standard - data communications control procedures
for the USA standard code for information interchange
%J Communications of the ACM
%K cacm
%V 12
%N 3
%D March 1969
%P 166

%A A.F. Ackermann
%T Generating PL/I phrase-structure productions at compile-time
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 196

%A T.C. Lowe
%T Analysis of boolean program models
for time-shared, paged environments
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 199

%A R. Galimberti
%A U. Montanari
%T An algorithm for hidden line elimination
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 206

%A J.H. Katz
%T Simulation of outpatient appointment systems
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 215

%A S.R. Petrick
%A P.M. Postal
%A P.S. Rosenbaum
%T On coordination reduction and sentence analysis
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 223

%A D.J. Rose
%T An algorithm for solving a special class
of tridiagonal systems of linear equations
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 234

%A A.H. Stroud
%A J.P. Kohli
%T Computation of Jn(x) by numerical integration
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 236

%A V.D. West
%T On the compilation of arithmetic expressions
%J Communications of the ACM
%K cacm
%V 12
%N 4
%D April 1969
%P 238

%A J. Whittlesey
%T On the multidimensional uniformity of pseudorandom generators
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 247

%A D. Wood
%T A few more remaining trouble spots in Algol 60
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 247

%A M.M. Gold
%T Time-sharing and batch-processing: an experimental comparison
of their values in a problem-solving situation
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 249

%A K.A. Bartlett
%A R.A. Scantlebury
%A P.T. Wilkinson
%T A note on reliable full-duplex transmission over half-duplex links
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 260

%A W.C. Lynch
%T Commentary on the Bartlett et al paper
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 261

%A S.E. Lass
%T Automated printed circuit routing with a stepping aperture
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 262

%A R.H. Bartels
%A G.H. Golub
%T The simplex method of linear programming using LU decomposition
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 266

%A P. Rabinowitz
%T Rough and ready error estimates
in Gaussian integration of analytic functions
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 268

%A H.E. Salzer
%T Chebyshev interpolation and quadrature formulas of very high degree
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 271

%A J.B. Hext
%A J.W. Winings
%T An automatic grading scheme for simple programming exercises
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 272

%A L.A. Belady
%A C.J. Kuehner
%T Dynamic space-sharing in computer systems
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 282

%Q ANSI X3
%T Clarification of Fortran standards
%J Communications of the ACM
%K cacm
%V 12
%N 5
%D May 1969
%P 289

%A G.E. Collins
%T Comment on a paper by Ku and Adler
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 302

%A V.L. Wallace
%A D.L. Mason
%T Degree of multiprogramming in page-on-demand systems
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 305

%A D. Ophir
%A B.J. Shepherd
%A R.J. Spinrad
%T Three-dimensional computer display
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 309

%A T. Sakai
%A M. Nagao
%T Simulation of traffic flows in a network
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 311

%A L.T. Parker,\ Jr.
%A T.M. Gallie
%A F.P. Brooks,\ Jr.
%A J.K. Ferrell
%T Introducing computing to smaller colleges and universities
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 319

%A J.L. Blue
%T Spline function methods for nonlinear boundary-value problems
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 327

%A R.A. Sweet
%T A recursive relation for the determinant of a pentadiagonal matrix
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 330

%A M.A. Breuer
%T Generation of optimal code for expressions via factorization
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 333

%A J. Friedman
%T A computer system for transformational grammar
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 341

%A L.A. Belady
%A R.A. Nelson
%A G.S. Shedler
%T An anomaly in space-time characteristics of certain programs running
in a paging machine
%J Communications of the ACM
%K cacm
%V 12
%N 6
%D June 1969
%P 349

%A B. Randell
%T A note on storage fragmentation and program segmentation
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 365

%A J. Weizenbaum
%T Recovery of reentrant list structures in SLIP
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 370

%A A.N. Habermann
%T Prevention of system deadlocks
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 373

%A A.J. Schneider
%T Generation of test matrices
having certain sign patterns and prescribed positive spectra
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 378

%A D.E. Amos
%A M.L. Slater
%T Polynomial and spline approximation by quadratic programming
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 379

%A W.J. Hemmerle
%T Generating pseudorandom numbers
on a two's complement machine such as the IBM 360
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 382

%A B<L. Fox
%T Accelerating LP algorithms
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 384

%A G. Cottafava
%A G. Le\ Moli
%T Automatic contour map
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 386

%A T. Donnelly
%T Some techniques for using pseudorandom numbers in computer simulation
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 392

%A R.Y. Kain
%T Block structures, indirect addressing, and garbage collection
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 395

%A M. Kennedy
%T On obtaining correct input: a new approach
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 409

%A W.W. Hooker
%T On the expected lengths of sequences
generated in sorting by replacement selecting
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 411

%A M.D. McIlroy
%T A scheme for specifying running titles
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 413

%A B.M. Fellen
%T An implementation of the Tausworthe generator
%J Communications of the ACM
%K cacm
%V 12
%N 7
%D July 1969
%P 413

%A A. Finerman
%T Computing capabilities at Argentine and Chilean universities
%J Communications of the ACM
%K cacm
%V 12
%N 8
%D August 1969
%P 425

%A B.W. Arden
%A B.A. Galler
%A R.M. Graham
%T The MAD definition facility
%J Communications of the ACM
%K cacm
%V 12
%N 8
%D August 1969
%P 432

%A J.A. Feldman
%A P.D. Rovner
%T An Algol-based associative language
%J Communications of the ACM
%K cacm
%V 12
%N 8
%D August 1969
%P 439

%A C.A. Hall
%T Error bounds for periodic quintic splines
%J Communications of the ACM
%K cacm
%V 12
%N 8
%D August 1969
%P 450

%A S.M. Chase
%A L.D. Fosdick
%T An algorithm for Filon quadrature
%J Communications of the ACM
%K cacm
%V 12
%N 8
%D August 1969
%P 453

%A M.R. Quillian
%T The teachable language comprehender:
a simulation program and theory of language
%J Communications of the ACM
%K cacm
%V 12
%N 8
%D August 1969
%P 459

%A H. Dewar
%A P. Bratley
%A J.P. Thorne
%T A program for the syntactic analysis of English sentences
%J Communications of the ACM
%K cacm
%V 12
%N 8
%D August 1969
%P 476

%A N. Wirth
%T On multiprogramming, machine coding, and computer organization
%J Communications of the ACM
%K cacm
%V 12
%N 9
%D September 1969
%P 489

%A W.J. Hansen
%T Compact list representation:
definition, garbage collection, and system implementation
%J Communications of the ACM
%K cacm
%V 12
%N 9
%D September 1969
%P 499

%A R.J. Orgass
%A W.M. Waite
%T A base for a mobile programming system
%J Communications of the ACM
%K cacm
%V 12
%N 9
%D September 1969
%P 507

%A K. Paton
%T An algorithm for finding a fundamental set of cycles in a graph
%J Communications of the ACM
%K cacm
%V 12
%N 9
%D September 1969
%P 514

%A D.L. Parnas
%T On simulating networks of parallel processes
in which simultaneous events may occur
%J Communications of the ACM
%K cacm
%V 12
%N 9
%D September 1969
%P 519

%A B.C. Lanzano
%T Loader standardization for overlay programs
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 541

%A H.B. Baskin
%A E.B. Horowitz
%A R.D. Tennison
%A L.E. Rittenhouse
%T A modular computer sharing system
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 551

%A W.S. Brown
%A P.L. Richman
%T The choice of base
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 560

%A J.R. Bell
%T A new method for determining
linear precedence functions for precedence grammars
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 567

%A R.B.K. Dewar
%A R.R. Hochsprung
%A W.S. Worley
%T The IITRAN programming language
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 569

%A C.A.R. Hoare
%T An axiomatic basis for computer programming
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 576

%A J.G. Herriot
%T An ambiguity in the description of Algol 60
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 581

%A C.B. Dunham
%T Minimax logarithmic error
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 581

%A L.E. Stanfel
%T A comment on optimal tree structures
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 582

%A A.J. Bayes
%T Retrieval times for a packed direct access inverted file
%J Communications of the ACM
%K cacm
%V 12
%N 10
%D October 1969
%P 582

%A A.H. Bond
%A J. Rightnour
%A L.S. Coles
%T An interactive graphical display monitor
in a batch-processing environment with remote entry
%J Communications of the ACM
%K cacm
%V 12
%N 11
%D November 1969
%P 595

%A A. Shoshani
%A A.J. Bernstein
%T Synchronization in a parallel-accessed data base
%J Communications of the ACM
%K cacm
%V 12
%N 11
%D November 1969
%P 604

%A T.B. Pinkerton
%T Performance monitoring in a time-sharing system
%J Communications of the ACM
%K cacm
%V 12
%N 11
%D November 1969
%P 608

%A R.R. Fenichel
%A J.C. Yochelson
%T A Lisp garbage-collector for virtual-memory computer systems
%J Communications of the ACM
%K cacm
%V 12
%N 11
%D November 1969
%P 611

%A A.J. Korenjak
%T A practical method for constructing LR(k) processors
%J Communications of the ACM
%K cacm
%V 12
%N 11
%D November 1969
%P 613

%A R.M. Balzer
%A D.J. Farber
%T APAREL - a parse-request language
%J Communications of the ACM
%K cacm
%V 12
%N 11
%D November 1969
%P 624

%A L.R. Grosenbeugh
%T More on fortran random number generators
%J Communications of the ACM
%K cacm
%V 12
%N 11
%D November 1969
%P 639

%A J.L. Rosenfeld
%T A case study of in programming for parallel-processors
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 645

%A D. Sayre
%T Is automatic "folding" of programs
efficient enough to displace manual ?
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 656

%A S.V. Parter
%T Numerical analysis in a Ph.D. computer science program
(doctoral program series)
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 661

%A D. Van\ Tassel
%T Advanced cryptographic techniques for computers
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 664

%A V.A. Busam
%A D.E. Englund
%T Optimization of expressions in Fortran
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 666

%A H. Bach
%T On the downhill method
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 675

%A D.J. Lasser
%T Productivity of multiprogrammed computers
- progress in developing an analytic prediction method
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 678

%A R.J. Fateman
%T Optimal code for serial and parallel computation
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 694

%A D.S. Seraphin
%T A fast random number generator for IBM 360
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 695

%Q ANSI X3
%T Representation of alphameric characters for information processing
%J Communications of the ACM
%K cacm
%V 12
%N 12
%D December 1969
%P 696