Journal of the ACM, Volume 19, 1972

Volume 19, Number 1, January 1972

• Gerard Salton:
  What Is Computer Science? 1-2
  
• Arthur C. Fleck, Stephen T. Hedetniemi, Robert H. Oehmke:
  S-Semigroups of Automata. 3-10
  
• Theodosios Pavlidis:
  Linear and Context-Free Graph Grammars. 11-22
  
• C. P. Earnest, K. G. Balke, J. Anderson:
  Analysis of Graphs by Ordering of Nodes. 23-42
  
• Herbert Weinblatt:
  A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph. 43-56
  
• Y. E. Chen, Donald L. Epley:
  Memory Requirements in a Multiprocessing Environment. 57-69
  
• Harry C. Heacox Jr., Paul Walton Purdom Jr.:
  Analysis of Two Time-Sharing Queueing Models. 70-91
  
• Alan G. Konheim, Bernd Meister:
  Service in a Loop System. 92-108
  
• Richard C. T. Lee:
  Fuzzy Logic and the Resolution Principle. 109-119
  
• James R. Slagle:
  Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets. 120-135
  
• Andrzej Blikle:
  Addressless Units for Carrying Out Loop-Free Computations. 136-157
  
• Allan Borodin:
  Computational Complexity and the Existence of Complexity Gaps. 158-174
  
• Robert L. Constable:
  The Operator Gap. 175-183
  
• Norman Zadeh:
  Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows. 184-192
  

Volume 19, Number 2, April 1972

• Seymour Ginsburg, Sheila A. Greibach:
  Multitape AFA. 193-221
  
• Eugene S. Santos:
  A Note on Bracketed Grammars. 222-224
  
• Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman:
  Weak and Mixed Strategy Precedence Parsing. 225-243
  
• Gordon D. Mulligan, Derek G. Corneil:
  Corrections to Bierstone's Algorithm for Generating Cliques. 244-247
  
• Jack Edmonds, Richard M. Karp:
  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. 248-264
  
• Peter L. Hammer, Uri N. Peled:
  On the Maximization of a Pseudo-Boolean Function. 265-282
  
• Stanley M. Selkow:
  One-Pass Complexity of Digital Picture Properties. 283-295
  
• Lawrence H. Landweber, Edward L. Robertson:
  Recursive Properties of Abstract Complexity Classes. 296-308
  
• Arnold L. Rosenberg:
  Addressable Data Graphs. 309-340
  
• Robert Endre Tarjan:
  Sorting Using Networks of Queues and Stacks. 341-346
  
• S. C. van Westrhenen:
  Statistical Studies of Theoremhood in Classical Propositional and First Order Predicate Calculus. 347-365
  
• Donald W. Loveland:
  A Unifying View of Some Linear Herbrand Procedures. 366-384
  

Volume 19, Number 3, July 1972

• J. McAfee, Leon Presser:
  An Algorithm for the Design of Simple Precedence Grammars. 385-395
  
• Clarence A. Ellis:
  The Halting Problem for Probabilistic Context-Free Generators. 396-399
  
• Shimon Even, Amir Pnueli, Abraham Lempel:
  Permutation Graphs and Transitive Graphs. 400-410
  
• John L. Pfaltz:
  Graph Structures. 411-422
  
• Jin Y. Yen:
  Finding the Lengths of All Shortest paths in N-Node Nonnegative-Distance Complete Networks Using ½N³ Additions and N³ Comparisons. 423-424
  
• Larry E. Stanfel:
  Practical Aspects of Doubly Chained Trees for Retrieval. 425-436
  
• Nancy M. Huang, Randall E. Cline:
  Inversion of Persymmetric Matrices Having Toeplitz Inverses. 437-444
  
• Isi Mitrani:
  Nonpriority Multiprogramming Systems Under Heavy Demand Conditions--Customers' Viewpoint. 445-452
  
• Richard E. Nance, U. Narayan Bhat, Billy G. Claybrook:
  Busy Period Analysis of a Time-Sharing System: transform inversion. 453-463
  
• Leonard Kleinrock, Richard R. Muntz:
  Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System. 464-482
  
• Gary D. Schultz:
  A Stochastic Model for Message Assembly Buffering with a Comparison of Block Assignment Strategies. 483-495
  
• James R. Slagle:
  An Approach for Finding C-Linear Complete Inference Systems. 496-516
  
• John L. Bruno, Kenneth Steiglitz:
  The Expression of Algorithms by Charts. 517-525
  
• Robert L. Constable, Allan Borodin:
  Subrecursive Programming Languages, Part I: efficiency and program structure. 526-568
  
• Jeffrey D. Ullman:
  A Note on the Efficiency of Hashing Functions. 569-575
  
• Allan Borodin:
  Corrigendum: ``Computational Complexity and the Existence of Complexity Gaps''. 576
  

Volume 19, Number 4, October 1972

• Bernard Kolman, Robert E. Beck:
  Computer Approaches to the Representations of Lie Algebras. 577-589
  
• Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg:
  Real-Time Simulation of Multihead Tape Units. 590-607
  
• Oscar H. Ibarra:
  A Note Concerning Nondeterministic Tape Complexities. 608-612
  
• James C. Beatty:
  An axiomatic approach to code optimization for expressions. 613-640
  
• W. Donald Frazer, B. T. Bennett:
  Bounds on Optimal Merge Performance, and a Strategy for Optimality. 641-648
  
• Edward M. Reingold:
  On the Optimality of Some Set Algorithms. 649-659
  
• John E. Savage:
  Computational Work and Time on Finite Machines. 660-674
  
• Jim Gray, Michael A. Harrison:
  On the Covering and Reduction Problems for Context-Free Grammars. 675-698
  
• Shi-Kuo Chang:
  The Generation of Minimal Trees with a Steiner Topology. 699-711
  
• V. Srinivasan, G. L. Thompson:
  Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems. 712-726
  
• Carl M. Harris, Paul G. Marlin:
  A Note on Feedback Queues with Bulk Service. 727-733
  
• A. J. Bayes:
  A Minimum Variance Sampling Technique for Simulation Models. 734-741
  
• Bernard P. Zeigler:
  Toward a Formal Theory of Modeling and Simulation: Structure Preserving Morphisms. 742-764