Journals in DBLP

J. ACM
1983, volume: 30, number: 3

1. Michael Tarsi
   Optimal Search on Some Game Trees [Citation Graph (0, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:389-396 [Journal]
   
2. Arnold L. Rosenberg
   Three-Dimensional VLSI: A Case Study [Citation Graph (0, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:397-416 [Journal]
   
3. David W. Matula, Leland L. Beck
   Smallest-Last Ordering and clustering and Graph Coloring Algorithms [Citation Graph (0, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:417-427 [Journal]
   
4. Kenneth J. Supowit
   The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees [Citation Graph (0, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:428-448 [Journal]
   
5. Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch
   Efficiency of Synchronous Versus Asynchronous Distributed Systems [Citation Graph (0, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:449-456 [Journal]
   
6. Edward G. Coffman Jr., Ravi Sethi
   Instruction Sets for Evaluating Arithmetic Expressions [Citation Graph (0, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:457-478 [Journal]
   
7. Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis
   On the Desirability of Acyclic Database Schemes [Citation Graph (63, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:479-513 [Journal]
   
8. Ronald Fagin
   Degrees of Acyclicity for Hypergraphs and Relational Database Schemes [Citation Graph (35, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:514-550 [Journal]
   
9. Dan Gusfield
   Parametric Combinatorial Computing and a Problem of Program Module Distribution [Citation Graph (0, 0)][DBLP]
   J. ACM, 1983, v:30, n:3, pp:551-563 [Journal]
   
10. Rajan Suri
    Robustness of Queuing Network Formulas [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:564-594 [Journal]
    
11. Jean-Claude Raoult, Ravi Sethi
    Properties of a Notation for Combining Functions [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:595-611 [Journal]
    
12. Edmund M. Clarke, Steven M. German, Joseph Y. Halpern
    Effective Axiomatizations of Hoare Logics [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:612-636 [Journal]
    
13. Georg Gati
    The Complexity of Solving Polynomial Equations by Quadrature [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:637-640 [Journal]
    
14. Oscar H. Ibarra, Brian S. Leininger
    On the Simplification and Equivalence Problems for Straight-Line Programs [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:641-656 [Journal]
    
15. Joseph JáJá
    Time-Space Trade-offs for Some Algebraic Problems [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:657-667 [Journal]
    
16. Leslie Lamport
    The Weak Byzantine Generals Problem [Citation Graph (2, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:668-676 [Journal]
    
17. Xu Mei-Rui, John E. Donner, Ronald V. Book
    Refining Nondeterminism in Relativizations of Complexity Classes [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:677-685 [Journal]