Journals in DBLP

J. ACM
1976, volume: 23, number: 1

1. Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman
   Bounds on the Complexity of the Longest Common Subsequence Problem. [Citation Graph (1, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:1-12 [Journal]
   
2. C. K. Wong, Ashok K. Chandra
   Bounds for the String Editing Problem. [Citation Graph (1, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:13-16 [Journal]
   
3. M. Dennis Mickunas
   On the Complete Covering Problem for LR(k)Grammars. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:17-30 [Journal]
   
4. Julian R. Ullmann
   An Algorithm for Subgraph Isomorphism. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:31-42 [Journal]
   
5. M. R. Garey, David S. Johnson
   The Complexity of Near-Optimal Graph Coloring. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:43-49 [Journal]
   
6. Robert A. Wagner
   A Shortest Path Algorithm for Edge-Sparse Graphs. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:50-57 [Journal]
   
7. Alberto Martelli
   A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:58-73 [Journal]
   
8. Narsingh Deo
   Note on Hopcroft and Tarjan's Planarity Algorithm. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:74-75 [Journal]
   
9. Clement T. Yu, Gerard Salton
   Precision Weighting - An Effective Automatic Indexing Method. [Citation Graph (3, 0)][DBLP]
   J. ACM, 1976, v:23, n:1, pp:76-88 [Journal]
   
10. Kenny S. Crump
    Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:89-96 [Journal]
    
11. Dominique Potier, Erol Gelenbe, Jacques Lenfant
    Adaptive Allocation of Central Processing Unit Quanta. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:97-102 [Journal]
    
12. R. A. Cody, Edward G. Coffman Jr.
    Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:103-115 [Journal]
    
13. Sartaj Sahni
    Algorithms for Scheduling Independent Tasks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:116-127 [Journal]
    
14. Ronald Fagin, Malcolm C. Easton
    The independence of miss ratio on page size. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:128-146 [Journal]
    
15. Daniel S. Hirschberg, C. K. Wong
    A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:147-154 [Journal]
    
16. Britton Harris
    A Code for the Transportation Problem of Linear Programming. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:155-157 [Journal]
    
17. John B. Kam, Jeffrey D. Ullman
    Global Data Flow Analysis and Iterative Algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:158-171 [Journal]
    
18. Susan L. Graham, Mark N. Wegman
    A Fast and Usually Linear Algorithm for Global Flow Analysis. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:172-202 [Journal]
    
19. Christoph M. Hoffmann, Lawrence H. Landweber
    A Completeness Theorem for Straight-Line Programs with Structured Variables. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:203-220 [Journal]