Journals in DBLP

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

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