Journal of the ACM, Volume 17, 1970

Volume 17, Number 1, January 1970

• Gerard Salton:
  On the Role of the ACM Journal. 1-2
  
• Seymour Ginsburg, John E. Hopcroft:
  Two-way balloon automata and AFL. 3-13
  
• Alain Colmerauer:
  Total Precedence Relations. 14-30
  
• Dennis F. Cudia:
  General Problems of Formal Grammars. 31-43
  
• Arnold L. Rosenberg:
  A Note on Ambiguity of Context-Free Languages and Presentations of Semilinear Sets. 44-50
  
• Derek G. Corneil, C. C. Gotlieb:
  An Efficient Algorithm for Graph Isomorphism. 51-64
  
• Herbert M. Gurk, Jack Minker:
  Storage Requirements for Information Handling Centers. 65-77
  
• Donald R. Chand, Sham S. Kapur:
  An Algorithm for Convex Polytopes. 78-86
  
• Fred G. Gustavson, Werner Liniger, R. Willoughby:
  Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations. 87-109
  
• C. D. Meyer, R. J. Painter:
  Note on a Least Squares Inverse for a Matrix. 110-112
  
• S. K. Chang, A. Gill:
  Algorithmic Solution of the Change-Making Problem. 113-122
  
• Edward G. Coffman Jr., Richard R. Muntz, H. Trotter:
  Waiting Time Distributions for Processor-Sharing Systems. 123-130
  
• Philip J. Rasch:
  A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems. 131-145
  
• Azriel Rosenfeld:
  Connectivity in Digital Pictures. 146-160
  
• Jack Sklansky:
  Thresholded Convolutions Operations. 161-165
  
• Melvin A. Breuer:
  Simplification of the Covering Problem with Application to Boolean Expressions. 166-181
  
• Harold S. Stone:
  An Algorithm for Modular Partitioning. 182-195
  

Volume 17, Number 2, April 1970

• Marvin Minsky:
  Form and Content in Computer Science (1970 ACM turing lecture). 197-215
  
• Arthur J. Nevins:
  A Programming Language With Automatic Goal Generation and Selection. 216-230
  
• Zamir Bavel, David E. Muller:
  Connectivity and Reversibility in Automata. 231-240
  
• David G. Willis:
  Computational Complexity and Probability Constructions. 241-259
  
• H. C. Andrews, J. Kane:
  Kronecker Matrices, Computer Implementation, and Generalized Spectra. 260-268
  
• Seymour Haber:
  Sequences of Numbers That Are Approximately Completely Equidistributed. 269-272
  
• Peter Henrici:
  Methods of Search for Solving Polynomial Equations. 273-283
  
• H. S. Rahme:
  Stability Analysis of a New Algorithm Used for Integrating a System of Ordinary Differential Equations. 284-293
  
• A. Zafarullah:
  Application of the Method of Lines to Parabolic Partial Differential Equations With Error Estimates. 294-302
  
• Richard H. Roth:
  An Approach to Solving Linear Discrete Optimization Problems. 303-313
  
• L. E. N. Delbrouck:
  A Feedback Queueing System With Batch Arrivals, Bulk Service, and Queue-Dependent Service Time. 314-323
  
• Richard R. Muntz, Edward G. Coffman Jr.:
  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems. 324-338
  
• Louis Hodes:
  The Logical Complexity of Geometric Properties in the Plane. 339-347
  
• Ugo Montanari:
  On Limit Properties in Digitization Schemes. 348-360
  
• James M. Boyle, Albert A. Grau:
  An Algorithmic Semantics for ALGOL 60 Identifier Denotation. 361-382
  
• B. L. Fox:
  Accelerating List Processing in Discrete Programming. 383-384
  
• B. F. Caviness:
  On Canonical Forms and Simplification. 385-396
  

Volume 17, Number 3, July 1970

• Colin W. Cryer:
  On the Approximate Solution of Free Boundary Problems Using Finite Differences. 397-411
  
• Harriet H. Kagiwada, Robert Kalaba:
  An Initial-Value Theory for Fredholm Integral Equations With Semidegenerate Kernels. 412-419
  
• Takao Tsuda, Kozo Ichida:
  Nonlinear Interpolation of Multivariable Functions by the Monte Carlo Method. 420-425
  
• C. V. Ramamoorthy, K. Mani Chandy:
  Optimization of Memory Hierarchies in Multiprogrammed Systems. 426-445
  
• Richard I. Shrager:
  Nonlinear Regression With Linear Constraints: An Extension of the Magnified Diagonal Method. 446-452
  
• Alan C. Shaw:
  Parsing of Graph-Representable Pictures. 453-481
  
• H. Lynn Beus:
  The Use of Information in Sorting. 482-495
  
• W. Donald Frazer, A. C. McKellar:
  Samplesort: A Sampling Approach to Minimal Storage Tree Sorting. 496-507
  
• Larry E. Stanfel:
  Tree Structures for Optimal Searching. 508-517
  
• Frederic J. Mowle:
  Controllability of Nonlinear Sequential Networks. 518-524
  
• Robert Anderson, W. W. Bledsoe:
  A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness. 525-534
  
• James R. Slagle:
  Interpolation Theorems for Resolution in Lower Predicate Calculus. 535-542
  
• Jean-Loup Baer, Daniel P. Bovet, Gerald Estrin:
  Legality and Other Properties of Graph Models of Computations. 543-554
  
• Zohar Manna, Amir Pnueli:
  Formalization of Properties of Functional Programs. 555-569
  

Volume 17, Number 4, October 1970

• J. Gary Augustson, Jack Minker:
  An Analysis of Some Graph Theoretical Cluster Techniques. 571-588
  
• Hiroshi Akima:
  A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures. 589-602
  
• Donald I. Good, Ralph L. London:
  Computer Interval Arithmetic: Definition and Proof of Correct Implementation. 603-612
  
• William B. Gruttke:
  Pseudo-Runge-Kutta Methods of the Fifth Order. 613-628
  
• Masahiro Hashimoto:
  A Method for Solving Large Matrix Equations Reduced From Fredholm Integral Equations of the Second Kind. 629-636
  
• Toyohisa Kaneko, Bede Liu:
  Accumulation of Round-Off Error in Fast Fourier Transforms. 637-654
  
• Lawrence F. Shampine:
  Efficiency of a Procedure for Near-Minimax Approximation. 655-660
  
• Brian T. Smith:
  Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems. 661-674
  
• Pierre E. Bonzon:
  Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type. 675-682
  
• Paul Walton Purdom Jr., Stephen M. Stigler:
  Statistical Properties of the Buddy System. 683-697
  
• Chin-Liang Chang:
  The Unit Proof and the Input Proof in Theorem Proving. 698-707
  
• David Pager:
  On the Efficiency of Algorithms. 708-714
  
• Ravi Sethi, Jeffrey D. Ullman:
  The Generation of Optimal Code for Arithmetic Expressions. 715-728
  
• Dennis Tsichritzis:
  The Equivalence Problem of Simple Programs. 729-738
  
• Jerzy W. Grzymala-Busse:
  Errata: ``On the Periodic Representations and the Reducibility of Periodic Automata''. 739