Volume 12,
Number 1,
January 1969
Volume 12,
Number 2,
February 1969
Volume 12,
Number 3,
March 1969
- Gerald M. Berns:
Description of FORMAT, a text-processing program.
141-146
- Stephen P. Morse:
Concepts of use in contour map processing.
147-152
- A. C. McKellar, Edward G. Coffman Jr.:
Organizing Matrices and Matrix Operations for Paged Memory Systems.
153-165
- E. L. Lohse:
Data communications control procedures for the USA standard code for information interchange.
166-178
- Richard C. Singleton:
Algorithm 345: an algol convolution procedure based on the fast fourier transform [C6].
179-184
- John Morris:
ACM Algorithm 346: F-Test Probabilities.
184-185
- John Morris:
Algorithm 346: F-test probabilities [S14].
184-185
- Richard C. Singleton:
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1].
185-186
- M. Gray:
Remark on algorithm 329 [G6]: distribution of indistinguishable objects into distinguishable slots.
187
- Richard C. Singleton:
Remark on algorithm 339 [C6]: an algol procedure for the fast fourier transform with arbitrary factors.
187
- Bernard A. Galler:
President's letters to the ACM membership: the AFIPS constitution.
188
Volume 12,
Number 4,
April 1969
Volume 12,
Number 5,
May 1969
- John R. B. Whittlesey:
Letters to the editor: on the multidimensional uniformity of pseudorandom generators.
247
- Derick Wood:
A few more trouble spots in ALGOL 60.
247-248
- Michael M. Gold:
Time-sharing and batch-processing: an experimental comparison of their values in a problem-solving situation.
249-259
- Keith A. Bartlett, Roger A. Scantlebury, Peter T. Wilkinson:
A note on reliable full-duplex transmission over half-duplex links.
260-261
- Stanley Lass:
Automated printed circuit routing with a stepping aperture.
262-265
- Richard H. Bartels, Gene H. Golub:
The simplex method of linear programming using LU decomposition.
266-268
- Philip Rabinowitz:
Rough and ready error estimates in Gaussian integration of analytic functions.
268-270
- Herbert E. Salzer:
Chebyshev interpolation and quadrature formulas of very high degree.
271
- Jan B. Hext, J. W. Winings:
An automatic grading scheme for simple programming exercises.
272-275
- Richard H. Bartels, Gene H. Golub:
Algorithm 350: simplex method procedure employing Lu decomposition [H].
275-278
- K. S. Kölbig:
Certification of algorithm 292 [S22]: regular coulomb wave functions and of remark on algorithm 292 [S22]: regular coulomb wave functions.
278-279
- K. S. Kölbig:
Certification of algorithm 300 [S22]: coulomb wave functions.
279-280
- Walter Gautschi:
Remark on algorithm 292 [S22]: regular coulomb wave functions.
280
- I. D. Hill:
Remark on algorithm 331: Gaussian quadrature formulas [D1].
280-281
- Robert E. Knop:
Remark on algorithm 334 [G5]: normal random deviates.
281
- Albert Noltemeier:
Remark on algorithm 340 [C2]: roots of polynomials by a root-squaring and resultant routine.
281
- Laszlo A. Belady, C. J. Kuehner:
Dynamic space-sharing in computer systems.
282-288
Volume 12,
Number 6,
June 1969
- Bernard A. Galler:
ACM president's letter: NATO and software engineering?
301
- Eric A. Weiss:
Letters to the editor: response to Galler, Pinkerton, Arden letter.
302
- Jerrold M. Grochow:
Letters to the editor: ACM has a tremendous story to tell.
302
- George E. Collins:
Letters to the editor: comment on a paper by Ku and Adler.
302-303
- Roger M. Firestone:
Letters to the editor: move ACM 1971 conference from Chicago?
303
- Currie S. Downie:
Letters to the editor: on obtaining technical information from the federal government.
303
- Heinz Zemanek:
Letters to the editor: on selecting the sites for IFIP congresses.
303-304
- Katherine M. Jamerson, T. M. R. Ellis:
Letters to the editor: restore professional atmosphere at ACM meetings.
304
- Herbert Ohlman:
Letters to the editor: a graduated dues structure for ACM.
304
- V. L. Wallace, D. L. Mason:
Degree of multiprogramming in page-on-demand systems.
305-308
- D. Ophir, R. J. Spinrad:
Three-dimensional computer display.
309-310
- Toshiyuki Sakai, Makoto Nagao:
Simulation of traffic flows in a network.
311-318
- Louis T. Parker, Thomas M. Gallie, Frederick P. Brooks Jr., James K. Ferrell:
Introducing computing to smaller colleges and universities - a progress report.
319-323
- B. J. Duke:
Certification of algorithm 298 [F1]: determination of the square root of a positive definite matrix.
325-326
- I. D. G. MacLeod:
Certification of algorithm 302 [K2]: transpose vector stored array.
326
- Norman L. Schreyer:
Certification of algorithm 328 [F4]: Chebyshev solution to an overdetermined linear system.
326
- James L. Blue:
Spline function methods for nonlinear boundary-value problems.
327-330
- Roland A. Sweet:
A recursive relation for the determinant of a pentadiagonal matrix.
330-332
- Melvin A. Breuer:
Generation of optimal code for expressions via factorization.
333-340
- Joyce Friedman:
A computer system for transformational grammar.
341-348
- Laszlo A. Belady, Robert A. Nelson, Gerald S. Shedler:
An anomaly in space-time characteristics of certain programs running in a paging machine.
349-353
Volume 12,
Number 7,
July 1969
- Bernard A. Galler:
ACM president's letter: ``what's yours?''.
359
- Brian Randell:
A note on storage fragmentation and program segmentation.
365-369
- Joseph Weizenbaum:
Recovery of reentrant list structures in SLIP.
370-372
- A. Nico Habermann:
Prevention of system deadlocks.
373-377
- A. J. Schneider:
Generation of test matrices having certain sign patterns and prescribed positive spectra.
378-379
- W. J. Hemmerle:
Generating pseudorandom numbers on a two's complement machine such as the IBM 360.
382-383
- B. L. Fox:
Accelerating LP algorithms.
384-385
- G. Cottafava, Gesualdo Le Moli:
Automatic contour map.
386-391
- T. Donnelly:
Some techniques for using pseudorandom numbers in computer simulation.
392-394
- Richard Y. Kain:
Block structures, indirect addressing, and garbage collection.
395-398
- Donald S. Clemm:
Algorithm 352: characteristic values and associated solutions of Mathieu's differential equation [S22].
399-407
- G. Sauer:
Remark on algorithm 268 [R2]: ALGOL 60 reference language editor.
407
- J. Boothroyd:
Remark on algorithm 274 [F1]: generation of Hilbert derived test matrix.
407-408
- D. K. Messham:
Remark on algorithm 333 [H]: minit algorithm for linear programming.
408
- Michael Kennedy:
On obtaining correct input: a new approach.
409-411
- William W. Hooker:
On the expected lengths of sequences generated in sorting by replacement selecting.
411-413
- M. Douglas McIlroy:
Letters to the editor: a scheme for specifying running titles.
413
- Bryna M. Fellen:
Letters to the editor: an implementation of the Tausworthe generator.
413
Volume 12,
Number 8,
August 1969
Volume 12,
Number 9,
September 1969
- Bernard A. Galler:
ACM president's letter: ``tell it like it is''.
487
- Niklaus Wirth:
On multiprogramming, machine coding, and computer organization.
489-498
- Wilfred J. Hansen:
Compact list representation: definition, garbage collection, and system implementation.
499-507
- Richard J. Orgass, William M. Waite:
A base for a mobile programming system.
507-510
- M. Douglas McIlroy:
Algorithm 354: generator of spanning trees [H].
511
- I. M. Leitch:
Certification of algorithm 323 [G6]: generation of permutations in lexicographic order.
512
- P. A. Hamilton, J. Boothroyd:
Remark on algorithm 251 [E4]: function minimization.
512-513
- Keith Paton:
An algorithm for finding a fundamental set of cycles of a graph.
514-518
- David Lorge Parnas:
On simulating networks of parallel processes in which simultaneous events may occur.
519-531
Volume 12,
Number 10,
October 1969
Volume 12,
Number 11,
November 1969
Volume 12,
Number 12,
December 1969
- Bernard A. Galler:
ACM president's letter: and in the corner ....
643
- Jack L. Rosenfeld:
A case study in programming for parallel-processors.
645-655
- D. Sayre:
Is automatic ``folding'' of programs efficient enough to displace manual?
656-660
- Seymour V. Parter:
Numerical analysis in a Ph.D. computer science program.
661-663
- Dennie Van Tassel:
Advanced cryptographic techniques for computer.
664-665
- Vincent A. Busam, Donald E. Englund:
Optimization of expressions in Fortran.
666-674
- H. Bach:
On the downhill method.
675-677
- Daniel J. Lasser:
Productivity of multiprogrammed computers--progress in developing an analytic prediction method.
678-684
- Robert G. Herriot:
Algorithm 364: coloring polygonal regions [Z].
685-686
- H. Bach:
Algorithm 365: complex root finding [C5].
686-687
- P. J. Claringbold:
Algorithm 366: regression using certain direct product matrices [G2].
687-688
- P. J. Claringbold:
Algorithm 367: analysis of variance for balanced experiments [G2].
688-691
- Ronald G. Parson:
Certification of algorithm 147 [S14]: PSIF.
691-692
- T. A. Bray:
Certification of algorithm 229 [B1]: elementary functions by continued fractions.
692
- K. S. Kölbig:
Remark on algorithm 300 [S22]: Coulomb wave functions.
692
- Les G. Proll:
Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration.
692
- Richard J. Fateman:
Optimal code for serial and parallel computation.
694-695
- Dominic S. Seraphin:
A fast random number generator for IBM 360.
695
- C. Kerpelman:
Presentation of alphameric characters for information processing.
696-698
Copyright © Fri Mar 12 17:24:52 2010
by Michael Ley (ley@uni-trier.de)
