Journals in DBLP

J. Comput. Syst. Sci.
2003, volume: 66, number: 3

1. Hirotada Kobayashi, Keiji Matsumoto
   Quantum multi-prover interactive proof systems with limited prior entanglement. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:66, n:3, pp:429-450 [Journal]
   
2. Viliam Geffert
   Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:66, n:3, pp:451-472 [Journal]
   
3. Martin Sauerhoff
   Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:66, n:3, pp:473-495 [Journal]
   
4. Shai Ben-David, Nadav Eiron, Philip M. Long
   On the difficulty of approximately maximizing agreements. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:66, n:3, pp:496-514 [Journal]
   
5. Bruno Gaujal, Stefan Haar, Jean Mairesse
   Blocking a transition in a free choice net and what it tells about its throughput. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:66, n:3, pp:515-548 [Journal]
   
6. Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
   Completeness results for graph isomorphism. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:66, n:3, pp:549-566 [Journal]
   
7. Monika Rauch Henzinger, Stefano Leonardi
   Scheduling multicasts on unit-capacity trees and meshes. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:66, n:3, pp:567-611 [Journal]