Journals in DBLP
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 ] Wojciech Palacz Algebraic hierarchical graph transformation. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2004, v:68, n:3, pp:497-520 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]