Journals in DBLP

J. ACM
1988, volume: 35, number: 4

1. Vasek Chvátal, Endre Szemerédi
   Many Hard Examples for Resolution. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:759-768 [Journal]
   
2. Michael D. Grigoriadis, B. Kalantari
   A new class of heuristic algorithms for weighted perfect matching. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:769-776 [Journal]
   
3. Richard Cole, Alan Siegel
   Optimal VLSI circuits for sorting. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:777-809 [Journal]
   
4. Teofilo F. Gonzalez, Sing-Ling Lee
   A linear time algorithm for optimal routing around a rectangle. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:810-831 [Journal]
   
5. Shivendra S. Panwar, Donald F. Towsley, Jack K. Wolf
   Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:832-844 [Journal]
   
6. Hagit Attiya, Marc Snir, Manfred K. Warmuth
   Computing on an anonymous ring. [Citation Graph (1, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:845-875 [Journal]
   
7. Anna R. Karlin, Eli Upfal
   Parallel hashing: an efficient implementation of shared memory. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:876-892 [Journal]
   
8. Lyle Ramshaw
   Eliminating go to's while preserving program structure. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:893-920 [Journal]
   
9. Andrew V. Goldberg, Robert Endre Tarjan
   A new approach to the maximum-flow problem. [Citation Graph (1, 0)][DBLP]
   J. ACM, 1988, v:35, n:4, pp:921-940 [Journal]
   
10. David A. Mix Barrington, Denis Thérien
    Finite monoids and the fine structure of NC¹. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:941-952 [Journal]
    
11. Daniel Leivant, Tim Fernando
    Meager and replete failures of relative completeness. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:953-964 [Journal]
    
12. Leonard Pitt, Leslie G. Valiant
    Computational limitations on learning from examples. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:965-984 [Journal]
    
13. Joel I. Seiferas, Paul M. B. Vitányi
    Counting is easy. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:985-1000 [Journal]
    
14. Bruce Jay Collings, G. Barry Hembree
    Addendum to ``Initializing Generalized Feedback Shift Register Pseudorandom Number Generators''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:1001- [Journal]