Journals in DBLP

J. Comput. Syst. Sci.
1998, volume: 57, number: 1

1. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
   The Relative Complexity of NP Search Problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1998, v:57, n:1, pp:3-19 [Journal]
   
2. Persi Diaconis, Laurent Saloff-Coste
   What Do We Know about the Metropolis Algorithm? [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1998, v:57, n:1, pp:20-36 [Journal]
   
3. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson
   On Data Structures and Asymmetric Communication Complexity. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1998, v:57, n:1, pp:37-49 [Journal]
   
4. Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan
   Randomized Query Processing in Robot Path Planning. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1998, v:57, n:1, pp:50-66 [Journal]
   
5. Jon M. Kleinberg, Éva Tardos
   Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1998, v:57, n:1, pp:61-73 [Journal]
   
6. Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
   Sorting in Linear Time? [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1998, v:57, n:1, pp:74-93 [Journal]
   
7. Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pravin Varaiya
   What's Decidable about Hybrid Automata? [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1998, v:57, n:1, pp:94-124 [Journal]