Journals in DBLP

J. Comput. Syst. Sci.
2000, volume: 61, number: 3

1. Klaus Ambos-Spies, Levke Bentzien
   Separating NP-Completeness Notions under Strong Hypotheses. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:335-361 [Journal]
   
2. Mihir Bellare, Joe Kilian, Phillip Rogaway
   The Security of the Cipher Block Chaining Message Authentication Code. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:362-399 [Journal]
   
3. Francesco Quaglia, Roberto Baldoni, Bruno Ciciani
   On the No-Z-Cycle Property in Distributed Executions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:400-427 [Journal]
   
4. Michael J. Kearns, Dana Ron
   Testing Problems with Sublearning Sample Complexity. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:428-456 [Journal]
   
5. Sheng-Tzong Cheng, Chia-Mei Chen, Satish K. Tripathi
   A Fault-Tolerance Model for Multiprocessor Real-Time Systems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:457-477 [Journal]
   
6. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
   On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:478-507 [Journal]
   
7. Kim S. Larsen
   AVL Trees with Relaxed Balance. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:508-522 [Journal]
   
8. Jun-ichi Takeuchi, Naoki Abe, Shun-ichi Amari
   The Lob-Pass Problem. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:523-557 [Journal]
   
9. Beate Bollig, Ingo Wegener
   Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2000, v:61, n:3, pp:558-579 [Journal]