Journals in DBLP

J. Comput. Syst. Sci.
2002, volume: 64, number: 2

1. Mark A. Fulk
   Inductive Inference with Additional Information. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:153-159 [Journal]
   
2. Cristina Bazgan, Miklos Santha, Zsolt Tuza
   Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:160-170 [Journal]
   
3. Martin Große-Rhode, Francesco Parisi-Presicce, Marta Simeoni
   Formal Software Specification with Refinements and Modules of Typed Graph Transformation Systems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:171-218 [Journal]
   
4. Minos N. Garofalakis, Yannis E. Ioannidis, Banu Özden, Abraham Silberschatz
   Competitive On-line Scheduling of Continuous-Media Streams. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:219-248 [Journal]
   
5. Frank Drewes, Berthold Hoffmann, Detlef Plump
   Hierarchical Graph Transformation. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:249-283 [Journal]
   
6. Tom H. Westerdale
   Minimality of an Automaton Cascade Decomposition for Learning System Environments. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:284-307 [Journal]
   
7. Martin R. Bridson, Robert H. Gilman
   Context-Free Languages of Sub-exponential Growth. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:308-310 [Journal]
   
8. Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung
   Reducing the Number of Solutions of NP Functions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:311-328 [Journal]
   
9. Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal
   Interval Consistency of Asynchronous Distributed Computations. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2002, v:64, n:2, pp:329-349 [Journal]
   
10. Joost Engelfriet, Sebastian Maneth
    Output String Languages of Compositions of Deterministic Macro Tree Transducers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:350-395 [Journal]
    
11. Volker Diekert, Paul Gastin
    LTL Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:396-418 [Journal]
    
12. Detlef Sieling
    Lower Bounds for Linearly Transformed OBDDs and FBDDs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:419-438 [Journal]