Journals in DBLP

J. ACM
1993, volume: 40, number: 5

1. Edward G. Coffman Jr., M. R. Garey
   Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:991-1018 [Journal]
   
2. Zhi-Quan Luo, John N. Tsitsiklis
   On the Communication Complexity of Distributed Algebraic Computation. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1019-1047 [Journal]
   
3. Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif
   Kinodynamic Motion Planning. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1048-1066 [Journal]
   
4. Y. C. Tay
   On the Optimality of Strategies for Multiple Joins. [Citation Graph (2, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1067-1086 [Journal]
   
5. Alan Fekete, Nancy A. Lynch, Yishay Mansour, John Spinelli
   The Impossibility of Implementing Reliable Communication in the Face of Crashes. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1087-1107 [Journal]
   
6. Martin Charles Golumbic, Ron Shamir
   Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1108-1133 [Journal]
   
7. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
   An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1134-1164 [Journal]
   
8. Jean Fonlupt, Armand Nachef
   Dynamic Programming and the Graphical Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1165-1187 [Journal]
   
9. Alain Jean-Marie, Levent Gün
   Parallel Queues with Resequencing. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1993, v:40, n:5, pp:1188-1208 [Journal]
   
10. François Baccelli, Zhen Liu, Donald F. Towsley
    Extremal Scheduling of Parallel Processing with and without Real-Time Constraints. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1209-1237 [Journal]
    
11. Charles Knessl
    On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1238-1301 [Journal]