Communications of the ACM (CACM), Volume 9, 1966
Volume 9, Number 1, January 1966
Jerome A. Feldman:
A formal semantics for computer languages and its application in a compiler-compiler. 3-9 J. Boothroyd:
Algorithm 274: Generation of Hilbert derived test matrix. 11-12 D. L. Fisher:
Data, documentation, and decision tables. 26-31 B. A. Griffith:
Remarks on computer program for the construction of school timetables. 35 Joseph Weizenbaum:
ELIZA - a computer program for the study of natural language communication between man and machine. 36-45 Harris Hyman:
Comments on a problem in concurrent programming control. 45
Volume 9, Number 2, February 1966
Donald L. Wright:
A comparison of the FORTRAN language implementation for several computers. 77-79 Lyle B. Smith:
Algorithm 277: Computation of Chebyshev series coefficients. 86-87 P. Lloyd:
Algorithm 278: Graph plotter. 88 Gerard Salton:
Control procedures for data communication - an ASA progress report. 100-105 Abbas I. Abdel Karim:
The stability of the fourth order Runge-Kutta method for the solution of systems of differential equations. 113-116 William C. Lynch:
Description of a high capacity, fast turnaround university computing center. 117-123 Robert N. Kubik:
On applications of differential equations in general problem solving. 123
Volume 9, Number 3, March 1966
R. Narasimhan:
Syntax-directed interpretation of classes of pictures. 166-173 Peter Naur:
Program translation viewed as a general data processing problem. 176-179 Jean-Claude Boussard:
An ALGOL compiler: construction and use in relation to an elaborate operating system. 179-182 Gerard Salton:
Data manipulation and programming problems in automatic information retrieval. 204-210 Robert F. Simmons:
Storage and retrieval of aspects of meaning in directed graph structures. 211-215 Calvin N. Mooers:
TRAC, a procedure-describing language for the reactive typewriter. 215-219 Charles W. Bachman:
On a generalized language for file organization and manipulation. 225-226 A. Caracciolo:
Some preliminary remarks on theoretical pragmatics. 226-227 Julien Green:
Microprogramming, emulators and programming languages. 230-232 Saul Gorn:
Advanced programming and the aims of standardization. 232
Volume 9, Number 4, April 1966
Leon Cooper:
Comments on professor Tewarson's letter. 241 Leonard Uhr:
Is the groping IR field ready for a costly crash program? 241-242 Gerard Salton:
Information dissemination and publication control. 254 Sol Broder:
On the problem of time table construction. 257 Benson H. Scheff:
A simple user-oriented compiler source language for programming automatic test equipment. 258-266 John H. Welsch:
Algorithm 280: Abscissas and weights for Gregory quadrature. 271 John H. Welsch:
Algorithm 281: Abscissas and weights for Romberg quadrature. 271-272 Walter Gautschi:
Algorithm 282: Derivatives of ex/x, cos (x)/x, AND sin (x)/x. 272 Immo O. Kerner:
Algorithm 283: Simultaneous displacement of polynomial roots if real and simple. 273 G. Bayer:
Remark on Algorithm 218: Kutta-Merson. 273 C. M. Reeves:
An algorithm for generating projective reduction formulas for matrix elements of many-electron wavefunctions. 276-279 R. J. Royston,
J. Gregory:
A method for finding the least squares estimate of the intersection point of two Helices in space. 280-284 Saul Gorn:
Recorded magnetic tape for information interchange (800 CPI, NRZI). 285-292 John Waters:
Methods of numerical integration applied to a system having trivial function evaluations. 293-296 C. T. Fike:
Starting approximations for square root calculation on IBM system /360. 297-299 George L. Cain:
A method for locating zeros of complex functions. 305-306
Volume 9, Number 5, May 1966
Niklaus Wirth:
A note on "Program structures for parallel processing". 320-321 Donald E. Knuth:
Additional comments on a problem in concurrent programming control. 321-322 P. B. M. Roes:
A note on linear programming algorithm design: a combinatorial problem. 340-342 Charles Erwin Cohn:
Incorporation of nonstandard input/output devices into FORTRAN systems. 343-344 Phillip Deuel:
On a storage mapping function for data structures. 344-347 O. G. Mancino:
Multiple precision floating-point conversion from decimal-to-binary and vice versa. 347-348 John Lions:
Matrix reduction using the Hungarian method for the generation of school timetables. 349-354 Leon Shalla:
Automatic analysis of electronic digital circuits using list processing. 372-380 Saul Gorn:
Eleven-sixteenths inch perforated paper tape. 386-387 Courtesy E. P. Miles:
"Impact of computer applications on undergraduate mathematics instruction" explored at Florida State-ACM-SIAM symposium. 388-389 Chris Shaw:
ACM Southern California's symposium poses adventureland, frontierland, fantasyland.... 390-391 Noel Zakin:
New York City's top officials envision information system for total organization at ACM symposium. 392 Melvin Klerer:
Basic problems in nonnumerical mathematics not yet well understood, SICSAM symposium reveals. 393
Volume 9, Number 6, June 1966
R. P. Boas:
Capitalizaton of language references. 409 Peter Henrici:
Test of probabilistic models for the propagation of roundoff errors. 409-410 Rowena Swanson:
Is the programming language designer losing sight of the user? 412 Stephen Potter:
Correction to a comparison of Fortran language implementation. 412 J. G. Cleary:
A Fortran technique for simplifying input to report generators. 441-442 Saul Gorn:
Twelve-row punched-card code for information interchange. 450-459
Volume 9, Number 7, July 1966
Volume 9, Number 8, August 1966
Carlos Christensen:
On the implementation of AMBIT, a language for symbol manipulation. 570-573 Anthony C. Hearn:
Computation of algebraic properties of elementary particle reactions using a digital computer. 573-577 Joel Moses:
Solutions of systems of polynomial equations by elimination. 634-637
Volume 9, Number 9, September 1966
Paul W. Abrahams:
A final solution to the Dangling else of ALGOL 60 and related languages. 679-682 J. Boothroyd:
Algorithm 290: linear equations, exact solutions. 683-684 A. Bergson:
Certification of algorithm 41: evaluation of determinant and algorithm 269: determinant evaluation. 686 R. Fletcher:
Certification of algorithm 251: function minimisation. 686-687
Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar