Journals in DBLP

J. Comput. Syst. Sci.
1991, volume: 42, number: 3

1. Pavol Duris, Zvi Galil
   Two Lower Bounds in Asynchronous Distributed Computation. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1991, v:42, n:3, pp:254-266 [Journal]
   
2. Andrew Chi-Chih Yao
   Lower Bounds to Randomized Algorithms for Graph Properties. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1991, v:42, n:3, pp:267-287 [Journal]
   
3. Arkady Kanevsky, Vijaya Ramachandran
   Improved Algorithms for Graph Four-Connectivity. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1991, v:42, n:3, pp:288-306 [Journal]
   
4. Abhiram G. Ranade
   How to Emulate Shared Memory. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1991, v:42, n:3, pp:307-326 [Journal]
   
5. William Aiello, Johan Håstad
   Statistical Zero-Knowledge Languages can be Recognized in Two Rounds. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1991, v:42, n:3, pp:327-345 [Journal]
   
6. Yuri Gurevich
   Average Case Completeness. [Citation Graph (1, 0)][DBLP]
   J. Comput. Syst. Sci., 1991, v:42, n:3, pp:346-398 [Journal]