Journal of the ACM (JACM)


Search Issue
enter search term and/or author name


Journal of the ACM (JACM), Volume 19 Issue 1, Jan. 1972

What Is Computer Science?
G. Salton
Pages: 1-2
DOI: 10.1145/321679.321680

S -Semigroups of Automata
A. C. Fleck, S. T. Hedetniemi, R. H. Oehmke
Pages: 3-10
DOI: 10.1145/321679.321681

Linear and Context-Free Graph Grammars
T. Pavlidis
Pages: 11-22
DOI: 10.1145/321679.321682

Analysis of Graphs by Ordering of Nodes
C. P. Earnest, K. G. Balke, J. Anderson
Pages: 23-42
DOI: 10.1145/321679.321683

A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
Herbert Weinblatt
Pages: 43-56
DOI: 10.1145/321679.321684

Memory Requirements in a Multiprocessing Environment
Y. E. Chen, D. L. Epley
Pages: 57-69
DOI: 10.1145/321679.321685

Analysis of Two Time-Sharing Queueing Models
Harry C. Heacox, Jr., Paul W. Purdom, Jr.
Pages: 70-91
DOI: 10.1145/321679.321686

Service in a Loop System
Alan G. Konheim, Bernd Meister
Pages: 92-108
DOI: 10.1145/321679.321687

Fuzzy Logic and the Resolution Principle
Richard C. T. Lee
Pages: 109-119
DOI: 10.1145/321679.321688

Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
James R. Slagle
Pages: 120-135
DOI: 10.1145/321679.321689

Addressless Units for Carrying Out Loop-Free Computations
Andrzej Blikle
Pages: 136-157
DOI: 10.1145/321679.321690

Computational Complexity and the Existence of Complexity Gaps
A. Borodin
Pages: 158-174
DOI: 10.1145/321679.321691

The Operator Gap
Robert L. Constable
Pages: 175-183
DOI: 10.1145/321679.321692

Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
Norman Zadeh
Pages: 184-192
DOI: 10.1145/321679.321693