Journal of the ACM -- 1972

Volume 19, Number 1, January 1972

• G. Salton. What is computer science? Journal of the ACM, 19(1):1-2, January 1972. [BibTeX entry]

• A. C. Fleck, S. T. Hedetniemi, and R. H. Oehmke. S-semigroups of automata. Journal of the ACM, 19(1):3-10, January 1972. References, etc. [BibTeX entry]

• T. Pavlidis. Linear and context-free graph grammars. Journal of the ACM, 19(1):11-22, January 1972. References, etc. [BibTeX entry]

• C. P. Earnest, K. G. Balke, and J. Anderson. Analysis of graphs by ordering of nodes. Journal of the ACM, 19(1):23-42, January 1972. References, Citations, etc. [BibTeX entry]

• Herbert Weinblatt. A new search algorithm for finding the simple cycles of a finite directed graph. Journal of the ACM, 19(1):43-56, January 1972. References, Citations, etc. [BibTeX entry]

• Y. E. Chen and D. L. Epley. Memory requirements in a multiprocessing environment. Journal of the ACM, 19(1):57-69, January 1972. References, etc. [BibTeX entry]

• Harry C. Heacox, Jr. and Paul W. Purdom, Jr.. Analysis of two time-sharing queueing models. Journal of the ACM, 19(1):70-91, January 1972. References, etc. [BibTeX entry]

• Alan G. Konheim and Bernd Meister. Service in a loop system. Journal of the ACM, 19(1):92-108, January 1972. Citations, etc. [BibTeX entry]

• Richard C. T. Lee. Fuzzy logic and the resolution principle. Journal of the ACM, 19(1):109-119, January 1972. References, etc. [BibTeX entry]

• James R. Slagle. Automatic theorem proving with built-in theories including equality, partial ordering, and sets. Journal of the ACM, 19(1):120-135, January 1972. References, Citations, etc. [BibTeX entry]

• Andrzej Blikle. Addressless units for carrying out loop-free computations. Journal of the ACM, 19(1):136-157, January 1972. Additional information. [BibTeX entry]

• A. Borodin. Computational complexity and the existence of complexity gaps. Journal of the ACM, 19(1):158-174, January 1972. References, Citations, etc. [BibTeX entry]

• Robert L. Constable. The operator gap. Journal of the ACM, 19(1):175-183, January 1972. References, Citations, etc. [BibTeX entry]

• Norman Zadeh. Theoretical efficiency of the Edmonds-Karp algorithm for computing maximal flows. Journal of the ACM, 19(1):184-192, January 1972. References, etc. [BibTeX entry]

Volume 19, Number 2, April 1972

• Sheila Greibach and Seymour Ginsburg. Multitape AFA. Journal of the ACM, 19(2):193-221, April 1972. References, Citations, etc. [BibTeX entry]

• Eugene S. Santos. A note on bracketed grammars. Journal of the ACM, 19(2):222-224, April 1972. References, Citations, etc. [BibTeX entry]

• A. V. Aho, P. J. Denning, and J. D. Ullman. Weak and mixed strategy precedence parsing. Journal of the ACM, 19(2):225-243, April 1972. References, Citations, etc. [BibTeX entry]

• Gordon D. Mulligan and D. G. Corneil. Corrections to Bierstone's algorithm for generating cliques. Journal of the ACM, 19(2):244-247, April 1972. References, Citations, etc. [BibTeX entry]

• Jack Edmonds and Richard M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, April 1972. Citations, etc. [BibTeX entry]

• Peter L. Hammer and Uri N. Peled. On the maximization of a pseudo-Boolean function. Journal of the ACM, 19(2):265-282, April 1972. Additional information. [BibTeX entry]

• Stanley M. Selkow. One-pass complexity of digital picture properties. Journal of the ACM, 19(2):283-295, April 1972. References, etc. [BibTeX entry]

• L. H. Landweber and E. L. Robertson. Recursive properties of abstract complexity classes. Journal of the ACM, 19(2):296-308, April 1972. References, Citations, etc. [BibTeX entry]

• Arnold L. Rosenberg. Addressable data graphs. Journal of the ACM, 19(2):309-340, April 1972. Additional information. [BibTeX entry]

• Robert Tarjan. Sorting using networks of queues and stacks. Journal of the ACM, 19(2):341-346, April 1972. Citations, etc. [BibTeX entry]

• S. C. van Westrehnen. Statistical studies of theoremhood in classical propositional and first order predicate calculus. Journal of the ACM, 19(2):347-365, April 1972. References, etc. [BibTeX entry]

• D. W. Loveland. A unifying view of some linear Herbrand procedures. Journal of the ACM, 19(2):366-384, April 1972. References, Citations, etc. [BibTeX entry]

Volume 19, Number 3, July 1972

• J. McAfee and L. Presser. An algorithm for the design of simple precedence grammars. Journal of the ACM, 19(3):385-395, July 1972. References, etc. [BibTeX entry]

• Clarence A. Ellis. The halting problem for probabilistic context-free generators. Journal of the ACM, 19(3):396-399, July 1972. References, etc. [BibTeX entry]

• S. Even, A. Pnueli, and A. Lempel. Permutation graphs and transitive graphs. Journal of the ACM, 19(3):400-410, July 1972. Citations, etc. [BibTeX entry]

• John L. Pfaltz. Graph structures. Journal of the ACM, 19(3):411-422, July 1972. Additional information. [BibTeX entry]

• Jin Y. Yen. Finding the lengths of all shortest paths in N-node nonnegative-distance complete networks using (N^3)/2 additions and N^3 comparisons. Journal of the ACM, 19(3):423-424, July 1972. Citations, etc. [BibTeX entry]

• L. E. Stanfel. Practical aspects of doubly chained trees for retrieval. Journal of the ACM, 19(3):425-436, July 1972. References, etc. [BibTeX entry]

• Nancy M. Huang and Randall E. Cline. Inversion of persymmetric matrices having Toeplitz inverses. Journal of the ACM, 19(3):437-444, July 1972. References, etc. [BibTeX entry]

• I. Mitrani. Nonpriority multiprogramming systems under heavy demand conditions -- customers' viewpoint. Journal of the ACM, 19(3):445-452, July 1972. References, etc. [BibTeX entry]

• Richard E. Nance, U. Narayan Bhat, and Billy G. Claybrook. Busy period analysis of a time-sharing system: Transform inversion. Journal of the ACM, 19(3):453-463, July 1972. References, etc. [BibTeX entry]

• L. Kleinrock and R. R. Muntz. Processor sharing queueing models of mixed scheduling disciplines for time shared system. Journal of the ACM, 19(3):464-482, July 1972. References, etc. [BibTeX entry]

• Gary D. Schultz. A stochastic model for message assembly buffering with a comparison of block assignment strategies. Journal of the ACM, 19(3):483-495, July 1972. References, etc. [BibTeX entry]

• James R. Slagle. An approach for finding C-linear complete inference systems. Journal of the ACM, 19(3):496-516, July 1972. References, Citations, etc. [BibTeX entry]

• J. Bruno and K. Steiglitz. The expression of algorithms by charts. Journal of the ACM, 19(3):517-525, July 1972. Citations, etc. [BibTeX entry]

• Robert L. Constable and Allan B. Borodin. Subrecursive programming languages, part I: Efficiency and program structure. Journal of the ACM, 19(3):526-568, July 1972. References, etc. [BibTeX entry]

• J. D. Ullman. A note on the efficiency of hashing functions. Journal of the ACM, 19(3):569-575, July 1972. Additional information. [BibTeX entry]

• A. Borodin. Corrigendum: ``Computational complexity and the existence of complexity gaps''. Journal of the ACM, 19(3):576, July 1972. References and Citations. [BibTeX entry]

Volume 19, Number 4, October 1972

• Robert E. Beck and Bernard Kolman. Computer approaches to the representations of Lie algebras. Journal of the ACM, 19(4):577-589, October 1972. Additional information. [BibTeX entry]

• Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Real-time simulation of multihead tape units. Journal of the ACM, 19(4):590-607, October 1972. References, Citations, etc. [BibTeX entry]

• Oscar H. Ibarra. A note concerning nondeterministic tape complexities. Journal of the ACM, 19(4):608-612, October 1972. References, Citations, etc. [BibTeX entry]

• James C. Beatty. An axiomatic approach to code optimization for expressions. Journal of the ACM, 19(4):613-640, October 1972. References, Citations, etc. [BibTeX entry]

• W. D. Frazer and B. T. Bennett. Bounds on optimal merge performance, and a strategy for optimality. Journal of the ACM, 19(4):641-648, October 1972. References, etc. [BibTeX entry]

• Edward M. Reingold. On the optimality of some set algorithms. Journal of the ACM, 19(4):649-659, October 1972. References, Citations, etc. [BibTeX entry]

• J. E. Savage. Computational work and time on finite machines. Journal of the ACM, 19(4):660-674, October 1972. References, Citations, etc. [BibTeX entry]

• James N. Gray and Michael A. Harrison. On the covering and reduction problems for context-free grammars. Journal of the ACM, 19(4):675-698, October 1972. References, Citations, etc. [BibTeX entry]

• Shi-Kuo Chang. The generation of minimal trees with a Steiner topology. Journal of the ACM, 19(4):699-711, October 1972. Additional information. [BibTeX entry]

• V. Srinivasan and G. L. Thompson. Accelerated algorithms for labeling and relabeling of trees, with applications to distribution problems. Journal of the ACM, 19(4):712-726, October 1972. References, Citations, etc. [BibTeX entry]

• Carl M. Harris and Paul G. Marlin. A note on feedback queues with bulk service. Journal of the ACM, 19(4):727-733, October 1972. References, etc. [BibTeX entry]

• A. J. Bayes. A minimum variance sampling technique for simulation models. Journal of the ACM, 19(4):734-741, October 1972. Additional information. [BibTeX entry]

• Bernard P. Zeigler. Towards a formal theory of modeling and simulation: Structure preserving morphisms. Journal of the ACM, 19(4):742-764, October 1972. References, etc. [BibTeX entry]

Shortcuts: