Journal of the ACM, Volume 20, 1973

Volume 20, Number 1, January 1973

• Jürg Nievergelt, C. K. Wong:
  Upper Bounds for the Total Path Length of Binary Trees. 1-6
  
• Harry M. Sloate, Theodore A. Bickart:
  A-Stable Composite Multistep Methods. 7-26
  
• Harold S. Stone:
  An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations. 27-38
  
• G. J. Burnett, Edward G. Coffman Jr.:
  A Combinatorial Problem Related to Interleaved Memory Systems. 39-45
  
• C. L. Liu, James W. Layland:
  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. 46-61
  
• Arnold K. Griffith:
  Mathematical Models for Automatic Line Detection. 62-80
  
• Azriel Rosenfeld:
  Arcs and Curves in Digital Pictures. 81-87
  
• Donald L. Richards:
  Efficient Exercising of Switching Elements in Nets of Identical Gates. 88-111
  
• Robert A. Di Paola:
  The Solvability of the Decision Problem for Classes of Proper Formulas and Related Results. 112-126
  
• John K. Dixon:
  Z-Resolution: Theorem-Proving with Compiled Axioms. 127-147
  
• Frank K. Hwang, David N. Deutsch:
  A Class of Merging Algorithms. 148-159
  
• Barry K. Rosen:
  Tree-Manipulating Systems and Church-Rosser Theorems. 160-187
  
• James C. Beatty:
  Errata: ``An axiomatic approach to code optimization for Expressions''. 188
  

Volume 20, Number 2, April 1973

• Harvey M. Salkin, Ronald D. Koncal:
  Set Covering by an All Integer Algorithm: Computational Experience. 189-193
  
• V. Srinivasan, G. L. Thompson:
  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm. 194-213
  
• Jim Gray, Michael A. Harrison:
  Canonical Precedence Schemes. 214-234
  
• David B. Lomet:
  A Formalization of Transition Diagram Systems. 235-257
  
• Gerard Salton:
  Recent Studies in Automatic Text Analysis and Document Retrieval. 258-278
  
• John F. Dalphin, Victor Lovass-Nagy:
  Best Least Squares Solutions to Finite Difference Equations Using the Generalized Inverse and Tensor Product Methods. 279-289
  
• Armin Friedli:
  Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations. 290-300
  
• A. J. Goldstein, Paul L. Richman:
  A Midpoint Phenomenon. 301-304
  
• Jacques Morgenstern:
  Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform. 305-306
  
• Sant R. Arora, A. Gallo:
  Optimization of Static Loading and Sizing of Multilevel Memory Systems. 307-319
  
• Donald L. Richards:
  Efficient Exercising of Switching Elements in Combinatorial Nets. 320-332
  
• Tomasz Pietrzykowski:
  A Complete Mechanization of Second-Order Type Theory. 333-364
  

Volume 20, Number 3, July 1973

• Alfs T. Berztiss:
  A Backtrack Procedure for Isomorphism of Directed Graphs. 365-377
  
• Christopher D. Green:
  A Path Entropy Function for Rooted Trees. 378-384
  
• Donald B. Johnson:
  A Note on Dijkstra's Shortest Path Algorithm. 385-388
  
• Thomas A. Williams, Gregory P. White:
  A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks. 389-390
  
• Jin Y. Yen:
  Reply to Williams and White's Note. 390
  
• Toyohisa Kaneko, Bede Liu:
  On Local Roundoff Errors in Floating-Point Arithmetic. 391-398
  
• Webb Miller:
  Toward Abstract Numerical Analysis. 399-408
  
• G. A. Watson:
  An Algorithm for the Inversion of Block Matrices of Toeplitz Form. 409-415
  
• Igal Adiri:
  Cyclic Queues with Bulk Arrivals. 416-428
  
• David D. Grossman, Harvey F. Silverman:
  Placement of Records on a Secondary Storage Device to Minimize Access Time. 429-438
  
• George Tourlakis, John Mylopoulos:
  Some Results in Computational Topology. 439-455
  
• T. G. Lewis, W. H. Payne:
  Generalized Feedback Shift Register Pseudorandom Number Algorithm. 456-468
  
• J. P. R. Tootill, W. D. Robinson, D. J. Eagle:
  An Asymptotically Random Tausworthe Sequence. 469-481
  
• Richard B. Worrell, Bernie L. Hulme:
  Efficient Ordering of Set Expressions for Symbolic Expansion. 482-488
  
• Edward A. Ashcroft, Zohar Manna, Amir Pnueli:
  Decidable Properties of Monadic Functional Schemas. 489-499
  
• Gideon Ehrlich:
  Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations. 500-513
  
• Robert M. Keller:
  Parallel Program Schemata and Maximal Parallelism I. Fundamental Results. 514-537
  
• James C. Beatty:
  Errata: ``An axiomatic approach to code optimization for Expressions''. 188
  

Volume 20, Number 4, October 1973

• Michael A. Jenkins:
  Bernoulli's Method with Implicit Shifting. 539-544
  
• Fred T. Krogh:
  On Testing a Subroutine for the Numerical Integration of Ordinary Differential Equations. 545-562
  
• Michael T. McClellan:
  The Exact Solution of Systems of Linear Equations with Polynomial Coefficients. 563-588
  
• Igal Adiri, Micha Hofri, Micha Yadin:
  A Multiprogramming Queue. 589-603
  
• C. C. Gotlieb, Glenn H. MacEwen:
  Performance of Movable-Head Disk Storage Devices. 604-623
  
• P. C. Yue, C. K. Wong:
  On the Optimality of the Probability Ranking Scheme in Storage Applications. 624-633
  
• Manfred H. Hueckel:
  A Local Visual Operator Which Recognizes Edges and Lines. 634-647
  
• Rona B. Stillman:
  The Concept of Weak Substitution in Theorem-Proving. 648-667
  
• Leonard J. Bass, Paul Young:
  Ordinal Hierarchies and Naming Complexity Classes. 668-686
  
• Robert P. Daley:
  An Example of Information and Computation Resource Trade-Off. 687-695
  
• Robert M. Keller:
  Parallel Program Schemata and Maximal Parallelism II: Construction of Closures. 696-710