Journals in DBLP

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

1. Natarajan Shankar
   A mechanical proof of the Church-Rosser theorem. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:475-522 [Journal]
   
2. Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch
   Finding a maximum-genus graph imbedding. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:523-534 [Journal]
   
3. Wen-Lian Hsu
   The coloring and maximum independent set problems on planar perfect graphs. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:535-563 [Journal]
   
4. Wansoo T. Rhee, Michel Talagrand
   Some distributions that allow perfect packing. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:564-578 [Journal]
   
5. Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March
   Stability of binary exponential backoff. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:579-602 [Journal]
   
6. Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith
   The physical mapping problem for parallel architectures. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:603-634 [Journal]
   
7. S. Rao Kosaraju, Mikhail J. Atallah
   Optimal simulations between mesh-connected arrays of processors. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:635-650 [Journal]
   
8. Faith E. Fich, Martin Tompa
   The parallel complexity of exponentiating polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:651-667 [Journal]
   
9. Hans Daduna
   Busy periods for subnetworks in stochastic networks: mean value analysis. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:3, pp:668-674 [Journal]
   
10. Jan Robin Rohlicek, Alan S. Willsky
    The reduction of perturbed Markov generators: an algorithm exposing the role of transient states. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:675-696 [Journal]
    
11. Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis
    On the power of one-way communication. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:697-726 [Journal]
    
12. Michael R. Fellows, Michael A. Langston
    Nonconstructive tools for proving polynomial-time decidability. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:727-739 [Journal]
    
13. Friedhelm Meyer auf der Heide
    Fast algorithms for N-dimensional restrictions of hard problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:740-747 [Journal]
    
14. Arnold Schönhage
    A nonlinear lower bound for random-access machines under logarithmic cost. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:748-754 [Journal]