Volume 10, Number 1, January 1967

• 
  Louis Fein, Anthony G. Oettinger: ACM has a crisis of identity? 1
• 
  Gerard Salton: Covering the computer field. 2
• 
  George E. Forsythe: A university's educational program in computer science. 3-11
• 
  Peter Calingaert: System performance evaluation: survey and appraisal. 12-18
• 
  Edward Morenoff, John B. McLean: A code for non-numeric information processing applications in online systems. 19-22
• 
  Dennis J. Aigner: Letters to the editor: An interpretive input routine for linear programming. 23-26
• 
  B. E. Cooper: A unifying computational method for the analysis of complete factorial experiments. 27-34
• 
  Anthony Hassitt: Data directed input-output in FORTRAN. 35-39
• 
  W. Murray Strome: Uniform random. 40
• 
  Peter W. Shantz, R. A. German, J. G. Mitchell, R. S. K. Shirley, C. Robert Zarnke: WATFOR - The University of Waterloo FORTRAN IV compiler. 41-44
• 
  P. G. Moulton, M. E. Muller: DITRAN - a compiler emphasizing diagnostics. 45-52
• 
  W. J. Cody, Anthony Ralston: A note on computing approximations to the exponential function. 53-55
• 
  Morton Goldberg: On the computation of least squares polynomials. 56-57
• 
  John A. C. Bingham: An improvement to iterative methods of polynomial factorization. 57-60
• 
  John Banzhaf: Computers and the copyright law: a commentary. 61
• 
  James P. Titus: Computers, communications, and the FCC. 62-67

Volume 10, Number 2, February 1967

• 
  R. O. Fisher, C. D. Shepard: Time sharing on a computer with a small memory. 77-81
• 
  Jacques Cohen: A use of fast and slow memories in list-processing languages. 82-86
• 
  James Wing: Abacus computation in number systems of bases other than ten. 86
• 
  H. Späth: Algorithm 295: Exponential curve fit. 87
• 
  G. J. Makinson: Algorithm 296: Generalized least squares fit by orthogonal polynomials. 87-88
• 
  Betty Jane Gassner: Sorting by replacement selecting. 89-93
• 
  George S. Fishman: Problems in the statistical analysis of simulation experiments: the comparision of means and the length of sample records. 94-99
• 
  Richard Bellman, Harriet H. Kagiwada, Robert Kalaba: Invariant imbedding and the numerical integration of boundary-value problems for unstable linear systems of ordinary differential equations. 100-102
• 
  George D. Byrne: Parameters for pseudo Runge-Kutta methods. 102-104
• 
  I. Bennett Goldberg: 27 bits are not enough for 8-digit accuracy. 105-106
• 
  Louis W. Ehrlich: A modified Newton method for polynomials. 107-108
• 
  S. G. Carmer: Programming the tabular method of analysis of variance for factorial experiments. 109-110
• 
  Samuel Gorenstein: Testing a random number generator. 111-118
• 
  John L. Pfaltz, Azriel Rosenfeld: Computer representation of planar regions by their skeletons. 119-122
• 
  Stan Shannon, Claudia I. Henschke: Stat-Pack: a biostatistical programming package. 123-125
• 
  James P. Titus: Pros and cons of patenting computer programs. 126-127

Volume 10, Number 3, March 1967

• 
  I. C. Pyle: Format effectors in ISO7 and ASCII. 137
• 
  Peter Zilahy Ingerman: "Panini-Backus Form" suggested. 137
• 
  N. G. de Bruijn: Additional comments on a problem in concurrent programming control. 137-138
• 
  John F. Banzhaf: Call for information: law and data processing. 138
• 
  Richard Y. Kain: Aesop and the referee: a fable. 138
• 
  Tom Scharf: More on processing 64-channel cards. 138
• 
  Anthony G. Oettinger: President's letter to the ACM membership. 139-140
• 
  Alex Orden: The emergence of a profession. 145-147
• 
  L. Fulkerson: Should there be a CS undergraduate program? 148
• 
  William F. Atchison: A reply to Fulkerson's comments. 148
• 
  Edward Morenoff, John B. McLean: Application of level changing to a multilevel storage organization. 149-154
• 
  Daniel G. Bobrow, Daniel L. Murphy: Structure of a LISP system using two-level storage. 155-159
• 
  Ellen R. Clark: On the automatic simplification of source-language programs. 160-165
• 
  Melvin Klerer, Jack May: Automatic dimensioning. 165-166
• 
  L. D. Neidleman: An application of FORMAC. 167-168
• 
  William M. Waite: An efficient procedure for the generation of closed subsets. 169-171
• 
  L. von Sydow: Computer typesetting of ALGOL. 172-174
• 
  C. T. Fike: Methods of evaluating polynomial approximations in function evaluation routines. 175-178
• 
  B. E. Rodden: Error-free methods for statistical computations. 179-180
• 
  J. Boothroyd: Algorithm 297: Eigenvalues and Eigenvectors of the symmetric system. 181-182
• 
  John J. Walton: Tensor calculations on computer: appendix. 183-186
• 
  Allan M. Krall, Robert Fornaro: An algorithm for generating root locus diagrams. 186-188
• 
  J. Boothroyd: Remark on Algorithm 281: Abscissas and weights for Romberg quadrature. 188
• 
  James P. Titus: The Nebulous future of machine translation. 189-191

Volume 10, Number 4, April 1967

• 
  Lawrence G. Tesler: On ``systematic generation of Hamiltonian circuits''. 201-202
• 
  S. M. Roberts, Benito Flores: Mr. Roberts and Mr. Flores reply. 202
• 
  Robert W. Bemer: ESC facility in USASCII. 202
• 
  Gerard Salton: The European computer gap. 203
• 
  Bernard A. Galler, Alan J. Perlis: A proposal for definitions in ALGOL. 204-219
• 
  Harold S. Stone: One-Pass compilation of arithmetic expressions for a parallel processor. 220-223
• 
  R. A. Brooker: A note: Top-to-bottom parsing rehabilitated?. 223-224
• 
  Louis W. Ehrlich: Corrigenda: numerical analysis. 224
• 
  Peter Calingaert: Corrigenda: computer systems. 224
• 
  Mark M. Klein: Scheduling project networks. 225-231
• 
  Paul S. Dwyer, Bernard A. Galler: A method for the solution of transportation problems with tall matrices. 231-234
• 
  Andrew D. Hall, Forman S. Action: Scheduling university course examinations by computer. 235-238
• 
  E. Eisner: Numerical integration of a function that has a pole. 239-243
• 
  I. D. Hill, Malcolm C. Pike: Algorithm 299: Chi-squared integral. 243-244
• 
  J. H. Gunn: Algorithm 300: Coulomb wave functions. 244-245
• 
  James P. Titus: Computer inquiries increase in Washington. 246

Volume 10, Number 5, May 1967

• 
  Lewis C. Corey: What level for ACM publications? 259
• 
  Letter to the Editor: The President's letter. 259
• 
  Louis Fein: What is the true value of conferences? 259-260
• 
  David A. Bridger: Comments on ``levels of computer systems''. 260
• 
  Peter A. Businger: FORTRAN subroutines for scalar products. 260
• 
  Martin Schatzoff, R. Tsao, R. Wing: An experimental comparison of time sharing and batch processing. 261-265
• 
  Edward S. Walter, Victor L. Wallace: Further analysis of a computing center environment. 266-272
• 
  Gary D. Hornbuckle: A multiprogramming monitor for small machines. 273-278
• 
  S. Schlesinger, L. Sashkin: POSE: a language for posing problems to a computer. 279-285
• 
  Gerald S. Shedler: Parallel numerical methods for the solution of equations. 286-291
• 
  Gillian Bond, Michael L. V. Pitteway: Algorithm 301: Airy function. 291-292
• 
  J. Boothroyd: Algorithm 302: Transpose vector stored array. 292-293
• 
  G. J. Makinson: Remark on Algorithm 28: Least squares fit by orthogonal polynomials. 293
• 
  John J. Kohfeld: Certification of Algorithm 30: Numerical solution of the polynomial equation. 293
• 
  Kenneth E. Hillstrom: Certification of Algorithm 279: Chebyshev quadrature. 294
• 
  J. W. Evans, Frank Harary, M. S. Lynn: On the computer enumeration of finite topologies. 295-297
• 
  Glen G. Langdon Jr.: An algorithm for generating permutations. 298-299
• 
  Salil K. Nandi, E. V. Krishnamurthy: A simple technique for digital division. 299-301
• 
  Cyril N. Alberga: String similarity and misspellings. 302-313
• 
  James P. Titus: Copyright revision legislation. 314-315
• 
  Anthony G. Oettinger: Oettinger exposes dangers to scientific endeavor inherent in copyright bill. 315-317

Volume 10, Number 6, June 1967

• 
  Anthony G. Oettinger: President's letter to the ACM membership. 335-337
• 
  K. J. Engvold, J. L. Hughes: A model for a multifunctional teaching system. 339-342
• 
  Robert F. Rosin: Relative to the President's December letter. 342
• 
  Vincent E. Giuliano: Additional references. 342
• 
  Raj Reddy: Pitch period determination of speech sounds. 343-348
• 
  Scott H. Cameron, Duncan Ewing, Michael Liveright: DIALOG: a conversational programming system with a graphical orientation. 349-357
• 
  Harold W. Lawson: PL/I list processing. 358-367
• 
  John Abramowich: Storage allocation in a certain iterative process. 368-370
• 
  David Ross: The checkless society: individual authorization of payment. 370
• 
  Gene H. Golub, T. N. Robertson: A generalized Bairstow algorithm. 371-373
• 
  L. J. Gallaher: Algorithm 303: An adaptive quadrature procedure with random panel sizes. 373-374
• 
  I. D. Hill, S. A. Joyce: Algorithm 304: Normal curve integral. 374-375
• 
  Malcolm C. Pike, I. D. Hill: Remark on Algorithm 179: Incomplete Beta ratio. 375-376
• 
  John H. Welsch: Certification of Algorithm 253: Eigenvalues of a real symmetric matrix by the QR method. 376
• 
  John H. Welsch: Certification of Algorithm 254: Eigenvalues and Eigenvectors of a real symmetric matrix by the QR method. 376-377
• 
  G. J. Makinson: Remarks on Algorithm 296: Generalized least squares fit by orthogonal polynomials. 377
• 
  M. Donald MacLaren: Algorithm 272: Procedure for the normal distribution function. 377
• 
  Sven J. Cyvin: Remarks on Algorithm 226: Normal distribution function. 377
• 
  D. Ibbetson: Remarks on Algorithm 209: Gauss. 377
• 
  Henry C. Thacher Jr.: Remarks on Algorithm 181: Complementary error function - large X. 377
• 
  Henry C. Thacher Jr.: Remarks on Algorithm 180: Error function - large X. 377
• 
  Martin Crawford, Robert Techo: Remarks on Algorithm 123: Real error function, ERF (x). 377
• 
  I. D. Hill, S. A. Joyce: Algorithm 304: Normal curve integral. 377
• 
  James P. Titus: Security and privacy. 379-381

Volume 10, Number 7, July 1967

• 
  Robert W. Bemer: Letter to the editor: on format effectors. 396
• 
  K. Wright: Letters to the editor: on Bellman's method for unstable linear systems. 396
• 
  W. I. Givens: Letter to the editor: a ``subprofessional'' comments. 396
• 
  Norman R. Nielsen: The simulation of time sharing systems. 397-412
• 
  Laszlo Betyar: A user-oriented time-shared online system. 413-419
• 
  Stuart E. Madnick: String processing techniques. 420-424
• 
  Larry Irwin: Implementing phrase-structure productions in PL/I. 424
• 
  Russell W. Stineman: Plotting a function of three independent variables. 425-428
• 
  J. K. S. McKay: On the representation of symmetric polynomials. 428-429
• 
  David G. Moursund: Optimal starting values for Newton-Raphson calculation of x^{1 2}. 430-432
• 
  William M. Waite: A language independent macro processor. 433-440
• 
  Michael D. Callahan, Anson E. Chapman: Description of basic algorithm DETAB/65 preprocessor. 441-446
• 
  Ira Pohl: A method for finding Hamilton paths and Knight's tours. 446-449
• 
  Paul Bratley, J. K. S. McKay: Algorithm 305: symmetric polynomial. 450
• 
  Paul Bratley: Algorithm 306: permutations with repetitions. 450-451
• 
  J. K. S. McKay: Algorithms 307: Symmetric group characters. 451-452
• 
  R. J. Ord-Smith: Algorithm 308 Generation of the permutations in psedo-lexicographic order. 452
• 
  R. J. Ord-Smith: Remarks on algorithm 87, 102, 130, 202: generation of permutations in lexicographical order. 452-453
• 
  Lee S. Sims: Certification of algorithm 258: transport and algorithm 293: transportation problem. 453
• 
  H. Späth: Certification of algorithm 285: the mutual primal-dual method. 453
• 
  Michael L. V. Pitteway: Remark on algorithm 301: Airy function. 453
• 
  James P. Titus: Changes in government procurement policies. 454-455

Volume 10, Number 8, August 1967

• 
  T. D. Truitt: Thoughts on continuous change simulation languages. 463
• 
  David C. Cooper: Böhm and Jacopini's reduction of flow charts. 463
• 
  Anthony G. Oettinger: President's letter to the ACM membership. 464-468
• 
  A. Michael Noll: A computer technique for displaying n-dimensional hyperobjects. 469-473
• 
  Jerry A. Ralya: A comment on Galler's letter. 473
• 
  Joseph Weizenbaum: Contextual understanding by computers. 474-480
• 
  Douglas T. Ross: The AED free storage package. 481-492
• 
  Ikuo Nakata: On compiling algorithms for arithmetic expressions. 492-494
• 
  Lyle B. Smith: A comparison of batch processing and instant turnaround. 495-500
• 
  Herbert Schorr, William M. Waite: An efficient machine-independent procedure for garbage collection in various list structures. 501-506
• 
  Ned Chapin: Parsing of decision tables. 507-511
• 
  Antonino Machado Souza Filho, Georges Schwachheim: Algorithm 309: Gamma function with arbitrary precision. 511-512
• 
  Robert W. Bemer: Towards standards for handwritten zero and oh: much ado about nothing (and a letter), or a partial dossier on distinguishing between handwritten zero and oh. 513-518
• 
  James P. Titus: ARPA: a visible means of support. 519-520

Volume 10, Number 9, September 1967

• 
  A. Gabay: Change CACM and journal format? 531
• 
  John McCarthy: Comments on time sharing. 531
• 
  William J. Cody: Another aspect of economical polynomials. 531
• 
  Alan F. Westin: Special report: legal safeguards to insure privacy in a computer society. 533-537
• 
  Lynn Yarbrough: Precision calculations of e and constants. 537
• 
  Richard W. Conway, Howard L. Morgan: Tele-CUPL: a telephone time sharing system. 538-542
• 
  James C. Howard: Computer formulation of the equations of motion using tensor notation. 543-548
• 
  Helmut Weber: A microprogrammed implementation of EULER on IBM system/360 model 30. 549-558
• 
  R. J. Parente, Howard S. Krasnow: A language for modeling and simulating dynamic systems. 559-567
• 
  Vincent A. Busam: An algorithm for class scheduling with section preference. 567-569
• 
  Bruce A. Chartres: Algorithm 310: Prime number generator 1. 569
• 
  Bruce A. Chartres: Algorithm 311: Prime number generator 2. 570
• 
  Arthur M. Lesk: Dynamic computation of derivatives. 571-572
• 
  Fabrizio Luccio: A comment on index register allocation. 572-574
• 
  B. J. Austin, T. S. Holden, R. H. Hudson: DAD, the C.S.I.R.O operating system. 575-583
• 
  James D. Foley: A Markovian model of the university of Michigan executive system. 584-588
• 
  James P. Titus: The patchwork nature of government computing support. 589-592

Volume 10, Number 10, October 1967

• 
  Anthony G. Oettinger: The hardware-software complementarity. 604-606
• 
  A. Hood Roberts: Pinpointing the dates of data examined by the ALPAC. 609
• 
  Z. L. Pankowicz: Further clarification of dates. 609
• 
  Eric P. Hamp: What are the most promising avenues of approach to attaining MT? 609-610
• 
  William Squire: On ``numerical integration of a function that has a pole''. 610
• 
  Donald E. Knuth: The remaining trouble spots in ALGOL 60. 611-618
• 
  Peter J. Brown: The ML/I macro processor. 618-623
• 
  Earl J. Bell: Decomposition programming: an analysis of matrix substructure. 624-626
• 
  M. V. Mathews, Carol Lochbaum, Judith A. Moss: Three fonts of computer drawn letters. 627-630
• 
  Peter S. Rosenbaum: A grammar base question-answering procedure. 630-635
• 
  John L. Smith: Microprogramming under a page on demand strategy. 636-646
• 
  Richard C. Singleton: On computing the fast Fourier transform. 647-654
• 
  Duane A. Adams: A stopping criterion for polynomial root finding. 655-658
• 
  Malcolm C. Harrison, J. T. Schwartz: SHARER, a time sharing system for the CDC 6600. 659-665
• 
  Paul Friedland: Algorithm 312: Absolute value and square root of a complex number. 665
• 
  Paul Bratley, J. K. S. McKay: Algorithm 313: Multi-dimensional partition generator. 666
• 
  Kenneth E. Hillstrom: Chebyshev quadrature. 666
• 
  James P. Titus: An interview with Dr. Herbert R. J. Grosch. 667

Volume 10, Number 11, November 1967

• 
  Artenio De Matteis: Improvements based on computed errors. 683
• 
  C. T. Fike: A rational approximation optimal by Moursund's criterion. 683-684
• 
  R. J. Ord-Smith: Remark on Langdon's algorithm. 684
• 
  Eliezer Naddor: M in Z: a game for man-machine studies. 684
• 
  I. C. Pyle: Character coding for information processing interchange. 684
• 
  M. D. Oestreicher, M. J. Bailey, J. I. Strauss: GEORGE 3 - A general purpose time sharing and operating system. 685-693
• 
  Jesse H. Katz: An experimental model of system/360. 694-702
• 
  Thomas H. Naylor, Kenneth Wertz, Thomas H. Wonnacott: Methods for analyzing data from computer simulation experiments. 703-710
• 
  B. A. Marron, Paul A. D. de Maine: Automatic data compression. 711-715
• 
  Roger E. Levien, M. E. Maron: A computer system for inference execution and data retrieval. 715-721
• 
  R. H. Shumway: On the expected gain from adjusting matched term retrieval systems. 722-725
• 
  D. B. Dulley, Michael L. V. Pitteway: Algorithm 314: Finding a solution of N functional equations in N unknowns. 726
• 
  H. Späth: Algorithm 315: The damped Taylor's series method for minimizing a sum of squares and for solving systems of nonlinear equations. 726-728
• 
  K. M. Brown: Algorithm 316: Solution of simultaneous non-linear equations. 728-729
• 
  Charles L. Robinson: Algorithm 317: Permutation. 729
• 
  James P. Titus: Service bureaus versus Banks. 744-745

Volume 10, Number 12, December 1967

• 
  Ira Pohl: Phas-structure productions in PL/I: Phas-structure productions in PL/I0. 757
• 
  G. E. Watts: In memory of Richard Goodman. 757
• 
  P. P. Lo: Use Chinese for zero and oh? 757
• 
  Lyle B. Smith: Re family membership in ACM. 757
• 
  Peter C. Lockemann, W. Dale Knutsen: A multiprogramming environment for online data acquisition and analysis. 758-764
• 
  Daniel L. Drew: The LACONIQ monitor: time sharing for online dialogues. 765-771
• 
  David M. Dahm, T. H. Gerbstadt, M. M. Pacelli: A system organization for resource allocation. 772-779
• 
  C. C. Gotlieb, Derek G. Corneil: Algorithms for finding a fundamental set of cycles for an undirected linear graph. 780-783
• 
  Arla E. Weinert: A SIMSCRIPT-FORTRAN case study. 784-792
• 
  L. Peter Deutsch, Butler W. Lampson: An online editor. 793-799
• 
  S. Charmonman: Eigenvectors of a 2n×2n matrix. 800-801
• 
  J. Boothroyd: Algorithm 318: Chebyschev curve-fit. 801-803
• 
  Rudolf Bayer, David Gries, Manfred Paul, Hans-Rüdiger Wiehle: The ALCOR Illinois 7090/7094 post mortem dump. 804-808
• 
  E. V. Krishnamurthy, Salil K. Nandi: On the normalization requirement of divisor in divide-and-correct methods. 809-813
• 
  James P. Titus: Taxes at all levels. 814-815

last updated on Sat May 18 05:50:44 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page