Journals in DBLP

J. ACM
1974, volume: 21, number: 3

1. Ramachendra P. Batni, Jeffrey D. Russell, Charles R. Kime
   An Efficient Algorithm for Finding an Irredundant Set Cover. [Citation Graph (1, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:351-355 [Journal]
   
2. Robert M. Haralick
   The Diclique Representation and Decomposition of Binary Relations. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:356-366 [Journal]
   
3. Matthew S. Hecht, Jeffrey D. Ullman
   Characterizations of Reducible Flow Graphs. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:367-375 [Journal]
   
4. Edgar M. Palmer, M. A. Rahimi, Robert W. Robinson
   Efficiency of a Binary Comparison Storage Technique. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:376-384 [Journal]
   
5. Chung C. Wang
   An Algorithm for the Chromatic Number of a Graph. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:385-391 [Journal]
   
6. C. K. Wong, Don Coppersmith
   A Combinatorial Problem Related to Multimodule Memory Organizations. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:392-402 [Journal]
   
7. Gregory J. Chaitin
   Information-Theoretic Limitations of Formal Systems. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:403-424 [Journal]
   
8. John Gill, Manuel Blum
   On Almost Everywhere Complex Recursive Functions. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:425-435 [Journal]
   
9. Lenhart K. Schubert
   Iterated Limiting Recursion and the Program Minimization Problem. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1974, v:21, n:3, pp:436-445 [Journal]
   
10. Thomas N. Hibbard
    Context-Limited Grammars. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:446-453 [Journal]
    
11. Paul L. Richman
    Computing a Subinterval of the Image. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:454-458 [Journal]
    
12. Hisashi Kobayashi
    Application of the Diffusion Approximation to Queueing Networks II: Nonequilibrium Distributions and Applications to Computer Modeling. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:459-469 [Journal]
    
13. Alan G. Konheim, Bernd Meister
    Waiting Lines and Times in a System with Polling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:470-490 [Journal]
    
14. John Michael Robson
    Bounds for Some Functions Concerning Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:491-499 [Journal]
    
15. Mandell Bellmore, Saman Hong
    Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:500-504 [Journal]
    
16. Leslie E. Trotter Jr., C. M. Shetty
    An Algorithm for the Bounded Variable Integer Programming Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:505-513 [Journal]
    
17. Trevor I. Fenner, George Loizou
    Some New Bounds on the Condition Numbers of Optimally Scaled Matrices. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:3, pp:514-524 [Journal]