External Links

Journal: Communications of the ACM

Volume 12, Issue 9

487 -- 0Bernard A. Galler. ACM president s letter: tell it like it is
489 -- 498Niklaus Wirth. On multiprogramming, machine coding, and computer organization
499 -- 507Wilfred J. Hansen. Compact list representation: definition, garbage collection, and system implementation
507 -- 510Richard J. Orgass, William M. Waite. A base for a mobile programming system
511 -- 0M. Douglas McIlroy. Algorithm 354: generator of spanning trees [H]
512 -- 513P. A. Hamilton, J. Boothroyd. Remark on algorithm 251 [E4]: function minimization
512 -- 0I. M. Leitch. Certification of algorithm 323 [G6]: generation of permutations in lexicographic order
514 -- 518Keith Paton. An algorithm for finding a fundamental set of cycles of a graph
519 -- 531David Lorge Parnas. On simulating networks of parallel processes in which simultaneous events may occur

Volume 12, Issue 8

421 -- 0Bernard A. Galler. ACM president s letter: I protest
425 -- 431Aaron Finerman. Computing capabilities at Argentine and Chilean universities
432 -- 439Bruce W. Arden, Bernard A. Galler, Robert M. Graham. The MAD definition facility
439 -- 449Jerome A. Feldman, Paul Rovner. An ALGOL-based associative language
450 -- 452Charles Allan Hall. Error bounds for periodic quintic splines
453 -- 457Stephen M. Chase, Lloyd D. Fosdick. An algorithm for Filon quadrature
457 -- 458Stephen M. Chase, Lloyd D. Fosdick. Algorithm 353: Filon quadrature [D1]
459 -- 476M. Ross Quillian. The teachable language comprehender: a simulation program and theory of language
476 -- 479Hamish Dewar, Paul Bratley, James Peter Thorne. A program for the syntactic analysis of English sentences

Volume 12, Issue 7

359 -- 0Bernard A. Galler. ACM president s letter: what s yours?
365 -- 369Brian Randell. A note on storage fragmentation and program segmentation
370 -- 372Joseph Weizenbaum. Recovery of reentrant list structures in SLIP
373 -- 377A. Nico Habermann. Prevention of system deadlocks
378 -- 379A. J. Schneider. Generation of test matrices having certain sign patterns and prescribed positive spectra
382 -- 383W. J. Hemmerle. Generating pseudorandom numbers on a two s complement machine such as the IBM 360
384 -- 385B. L. Fox. Accelerating LP algorithms
386 -- 391G. Cottafava, Gesualdo Le Moli. Automatic contour map
392 -- 394T. Donnelly. Some techniques for using pseudorandom numbers in computer simulation
395 -- 398Richard Y. Kain. Block structures, indirect addressing, and garbage collection
399 -- 407Donald S. Clemm. Algorithm 352: characteristic values and associated solutions of Mathieu s differential equation [S22]
407 -- 408J. Boothroyd. Remark on algorithm 274 [F1]: generation of Hilbert derived test matrix
407 -- 0G. Sauer. Remark on algorithm 268 [R2]: ALGOL 60 reference language editor
409 -- 411Michael Kennedy. On obtaining correct input: a new approach
411 -- 413William W. Hooker. On the expected lengths of sequences generated in sorting by replacement selecting
413 -- 0M. Douglas McIlroy. Letters to the editor: a scheme for specifying running titles
413 -- 0Bryna M. Fellen. Letters to the editor: an implementation of the Tausworthe generator

Volume 12, Issue 6

301 -- 0Bernard A. Galler. ACM president s letter: NATO and software engineering?
302 -- 303George E. Collins. Letters to the editor: comment on a paper by Ku and Adler
302 -- 0Jerrold M. Grochow. Letters to the editor: ACM has a tremendous story to tell
302 -- 0Eric A. Weiss. Letters to the editor: response to Galler, Pinkerton, Arden letter
303 -- 304Heinz Zemanek. Letters to the editor: on selecting the sites for IFIP congresses
303 -- 0Roger M. Firestone. Letters to the editor: move ACM 1971 conference from Chicago?
304 -- 0Herbert Ohlman. Letters to the editor: a graduated dues structure for ACM
304 -- 0Katherine M. Jamerson, T. M. R. Ellis. Letters to the editor: restore professional atmosphere at ACM meetings
305 -- 308V. L. Wallace, D. L. Mason. Degree of multiprogramming in page-on-demand systems
309 -- 310D. Ophir, R. J. Spinrad. Three-dimensional computer display
311 -- 318Toshiyuki Sakai, Makoto Nagao. Simulation of traffic flows in a network
319 -- 323Louis T. Parker, Thomas M. Gallie, Frederick P. Brooks Jr., James K. Ferrell. Introducing computing to smaller colleges and universities - a progress report
325 -- 326B. J. Duke. Certification of algorithm 298 [F1]: determination of the square root of a positive definite matrix
326 -- 0I. D. G. Macleod. Certification of algorithm 302 [K2]: transpose vector stored array
327 -- 330James L. Blue. Spline function methods for nonlinear boundary-value problems
330 -- 332Roland A. Sweet. A recursive relation for the determinant of a pentadiagonal matrix
333 -- 340Melvin A. Breuer. Generation of optimal code for expressions via factorization
341 -- 348Joyce Friedman. A computer system for transformational grammar
349 -- 353Laszlo A. Belady, Robert A. Nelson, Gerald S. Shedler. An anomaly in space-time characteristics of certain programs running in a paging machine

Volume 12, Issue 5

247 -- 248Derick Wood. A few more trouble spots in ALGOL 60
247 -- 0John R. B. Whittlesey. Letters to the editor: on the multidimensional uniformity of pseudorandom generators
249 -- 259Michael M. Gold. Time-sharing and batch-processing: an experimental comparison of their values in a problem-solving situation
260 -- 261Keith A. Bartlett, Roger A. Scantlebury, Peter T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links
262 -- 265Stanley Lass. Automated printed circuit routing with a stepping aperture
266 -- 268Richard H. Bartels, Gene H. Golub. The simplex method of linear programming using LU decomposition
268 -- 270Philip Rabinowitz. Rough and ready error estimates in Gaussian integration of analytic functions
272 -- 275Jan B. Hext, J. W. Winings. An automatic grading scheme for simple programming exercises
275 -- 278Richard H. Bartels, Gene H. Golub. Algorithm 350: simplex method procedure employing Lu decomposition [H]
278 -- 279K. S. Kölbig. Certification of algorithm 292 [S22]: regular coulomb wave functions and of remark on algorithm 292 [S22]: regular coulomb wave functions
279 -- 280K. S. Kölbig. Certification of algorithm 300 [S22]: coulomb wave functions
280 -- 281I. D. Hill. Remark on algorithm 331: Gaussian quadrature formulas [D1]
280 -- 0Walter Gautschi. Remark on algorithm 292 [S22]: regular coulomb wave functions
281 -- 0Robert E. Knop. Remark on algorithm 334 [G5]: normal random deviates
281 -- 0Albert Noltemeier. Remark on algorithm 340 [C2]: roots of polynomials by a root-squaring and resultant routine
282 -- 288Laszlo A. Belady, C. J. Kuehner. Dynamic space-sharing in computer systems

Volume 12, Issue 4

193 -- 0Bernard A. Galler. President s letter to the ACM membership: let s face it
197 -- 198C. C. Gotlieb. Editorial: on the ACM publications
199 -- 205Thomas C. Lowe. Analysis of boolean program models for time-shared, paged environments
206 -- 211R. Galimberti. An algorithm for hidden line elimination
215 -- 222Jesse H. Katz. Simulation of outpatient appointment systems
223 -- 233Stanley R. Petrick, Paul M. Postal, Peter S. Rosenbaum. On coordination reduction and sentence analysis
234 -- 236Donald J. Rose. An algorithm for solving a special class of tridiagonal systems of linear equations
236 -- 238A. H. Stroud, J. P. Kohli. Computation of J::n::(x) by numerical integration

Volume 12, Issue 3

147 -- 152Stephen P. Morse. Concepts of use in contour map processing
153 -- 165A. C. McKellar, Edward G. Coffman Jr.. Organizing Matrices and Matrix Operations for Paged Memory Systems
166 -- 178E. L. Lohse. Data communications control procedures for the USA standard code for information interchange
179 -- 184Richard C. Singleton. Algorithm 345: an algol convolution procedure based on the fast fourier transform [C6]
184 -- 185John Morris. Algorithm 346: F-test probabilities [S14]
184 -- 185John Morris. ACM Algorithm 346: F-Test Probabilities
185 -- 186Richard C. Singleton. Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
187 -- 0M. Gray. Remark on algorithm 329 [G6]: distribution of indistinguishable objects into distinguishable slots
187 -- 0Richard C. Singleton. Remark on algorithm 339 [C6]: an algol procedure for the fast fourier transform with arbitrary factors
188 -- 0Bernard A. Galler. President s letters to the ACM membership: the AFIPS constitution

Volume 12, Issue 2

65 -- 66Bernard A. Galler. President s letter to the ACM membership: The journal
67 -- 72R. H. Day, M. K. Mansfield, M. E. Ellis. CODAS: a data display system
72 -- 76Yale N. Patt. Variable length tree structures having minimum average search time
77 -- 80S. R. Arora, W. T. Dent. Randomized binary search technique
81 -- 84Roman R. Redziejowski. On arithmetic expressions and trees
85 -- 86W. H. Payne, John R. Rabung, T. P. Bogyo. Coding the Lehmer pseudo-random number generator
87 -- 88Richard F. King, David L. Phillips. The logarithmic error and Newton s method for the square root
89 -- 93Lyle B. Smith. Interval arithmetic determinant evaluation and its use in testing for a Chebyshev system
93 -- 94J. B. Kruskal. Extremely portable random number generator
95 -- 101M. R. Schroeder. Images from computers and microfilm plotters
102 -- 110Ernst G. Ulrich. Exclusive simulation of activity in digital networks
111 -- 117Gerard Salton. Information science in a Ph.D. computer science program

Volume 12, Issue 12

643 -- 0Bernard A. Galler. ACM president s letter: and in the corner ...
645 -- 655Jack L. Rosenfeld. A case study in programming for parallel-processors
656 -- 660D. Sayre. Is automatic folding of programs efficient enough to displace manual?
661 -- 663Seymour V. Parter. Numerical analysis in a Ph.D. computer science program
664 -- 665Dennie Van Tassel. Advanced cryptographic techniques for computer
666 -- 674Vincent A. Busam, Donald E. Englund. Optimization of expressions in Fortran
675 -- 677H. Bach. On the downhill method
678 -- 684Daniel J. Lasser. Productivity of multiprogrammed computers--progress in developing an analytic prediction method
685 -- 686Robert G. Herriot. Algorithm 364: coloring polygonal regions [Z]
686 -- 687H. Bach. Algorithm 365: complex root finding [C5]
691 -- 692Ronald G. Parson. Certification of algorithm 147 [S14]: PSIF
692 -- 0K. S. Kölbig. Remark on algorithm 300 [S22]: Coulomb wave functions
692 -- 0Les G. Proll. Remark on algorithm 341 [H]: solution of linear programs in 0-1 variables by implicit enumeration
692 -- 0T. A. Bray. Certification of algorithm 229 [B1]: elementary functions by continued fractions
694 -- 695Richard J. Fateman. Optimal code for serial and parallel computation
695 -- 0Dominic S. Seraphin. A fast random number generator for IBM 360
696 -- 698C. Kerpelman. Presentation of alphameric characters for information processing

Volume 12, Issue 11

593 -- 0Bernard A. Galler. ACM president s letter: J accuse!
595 -- 603Alan H. Bond, Jerry Rightnour, L. Steven Coles. An interactive graphical display monitor in a batch-processing environment with remote entry
604 -- 607Arie Shoshani, Arthur J. Bernstein. Synchronization in a parallel-accessed data base
608 -- 610Tad B. Pinkerton. Performance monitoring in a time-sharing system
611 -- 612Robert Fenichel, Jerome C. Yochelson. A LISP garbage-collector for virtual-memory computer systems
613 -- 623A. J. Korenjak. A practical method for constructing LR(k) processors
624 -- 631Robert Balzer, David J. Farber. APAREL - A parse-request language
631 -- 632John R. Howell. Algorithm 359: factorial analysis of variance [G1]
632 -- 633Robert B. Dial. Algorithm 360: shortest-path forest with topological ordering [H]
634 -- 635John Michael Robson. Algorithm 362: generation of random permutations [G6]
634 -- 0Bruce Shriver, Patricia J. Eberlein, R. D. Dixon. Algorithm 361: permanent function of a square matrix I and II [G6]
635 -- 0Walter Gautschi. Algorithm 363: complex error function [S15]
635 -- 636S. M. Cobb. Certification of algorithm 47 [S16]: associated Legendre functions of the first kind for real or imaginary arguments
636 -- 0Gillian Hall, Valeria A. Ray. Certification of algorithm 255 [C6]: computation of Fourier coefficients
637 -- 638F. K. Tomlin, Lyle B. Smith. Remark on algorithm 178 [E4]: direct search
638 -- 0Lyle B. Smith. Remark on algorithm 178 [E4]: direct search
639 -- 0L. R. Grosenbaugh. More on Fortran random number generators

Volume 12, Issue 10

537 -- 0Walter M. Carlson. Letter from the ACM vice-president: there is a tide in the affairs of men...
541 -- 550Bernadine C. Lanzano. Loader standardization for overlay programs
551 -- 559Herbert Baskin, Elsa B. Horowitz, Robert D. Tennison, Larry E. Rittenhouse. A modular computer sharing systems
560 -- 561W. S. Brown, Paul L. Richman. The choice of base
562 -- 0J. M. S. Simoes Pereira. Algorithm 355: an algorithm for generating ising configurations [Z]
563 -- 564Richard C. Singleton. Algorithm 357: an efficient prime number generator [A1]
563 -- 0Richard C. Singleton. Algorithm 356: a prime number generator using the treesort principle [A1]
564 -- 565Peter A. Businger, Gene H. Golub. Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5]
565 -- 566Arthur G. Adams. Remark on algorithm 304 [S15]: normal curve integral
567 -- 569James R. Bell. A new method for determining linear precedence functions for precedence grammars
569 -- 575Robert B. K. Dewar, Ronald R. Hochsprung, William S. Worley Jr.. The IITRAN programming language
576 -- 580C. A. R. Hoare. An Axiomatic Basis for Computer Programming
581 -- 582Charles B. Dunham. Minimax logarithmic error
581 -- 0John G. Herriot. An ambiguity in the description of ALGOL 60
582 -- 583A. J. Bayes. Retrieval times for a packed direct access inverted file
582 -- 0Larry E. Stanfel. A comment on optimal tree structures

Volume 12, Issue 1

1 -- 0Bernard A. Galler. President s letter to the ACM membership: the graduate
3 -- 12John J. Cannon. Computers in group theory: a survey
13 -- 22Edward S. Lowry, C. W. Medlock. Object code optimization
31 -- 38Bruce W. Arden. The role of programming in a Ph.D. computer science program
37 -- 38David A. Levine. Algorithm 344: student s t-distribution [S14]
38 -- 0I. Farkas. Certification of algorithm 165 [S21]: complete elliptic integrals
38 -- 39James Vandergraft, Charles K. Mesztenyi. Remark on algorithm 314 [C5]: finding a solution of ::::N:::: functional equations in ::::N:::: unknowns
39 -- 0J. B. F. Field. Certification of algorithm 322 [S14]
39 -- 0Oliver K. Smith. Remark on algorithm 337 [C1]: calculation of a polynomial and its derivative values by Horner scheme
40 -- 46Joyce Friedman. Directed random generation of sentences
runs on