Journals in DBLP

J. Comput. Syst. Sci.
2004, volume: 68, number: 3

1. Narayan Vikas
   Computational complexity of compaction to irreflexive cycles. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:473-496 [Journal]
   
2. Wojciech Palacz
   Algebraic hierarchical graph transformation. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:497-520 [Journal]
   
3. Pirkko Kuusela, Daniel Ocone
   Learning with side information: PAC learning bounds. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:521-545 [Journal]
   
4. Etienne Grandjean, Frédéric Olive
   Graph properties checkable in linear time in the number of vertices. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:546-597 [Journal]
   
5. Hung-Min Sun, Bing-Chang Chen, Her-Tyan Yeh
   On the design of time-stamped signatures. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:598-610 [Journal]
   
6. Frank Drewes, Joost Engelfriet
   Branching synchronization grammars with nested tables. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:611-656 [Journal]
   
7. Christopher M. Homan
   Tight lower bounds on the ambiguity of strong, total, associative, one-way functions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:657-674 [Journal]
   
8. Pavol Duris, Juraj Hromkovic, Katsushi Inoue
   On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:68, n:3, pp:675-699 [Journal]