Journals in DBLP

J. ACM
1972, volume: 19, number: 1

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