Journals in DBLP

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

1. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
   Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:3, pp:473-496 [Journal]
   
2. Olivier Ly
   Automatic graphs and D0L-sequences of finite graphs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:3, pp:497-545 [Journal]
   
3. Sanjay Jain, Efim B. Kinber
   Intrinsic complexity of learning geometrical concepts from positive data. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:3, pp:546-607 [Journal]
   
4. Christopher M. Homan, Mayur Thakur
   One-way permutations and self-witnessing languages. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:3, pp:608-622 [Journal]
   
5. Chunguang Li, Xiaofeng Liao, Juebang Yu
   Complex-valued wavelet network. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:3, pp:623-632 [Journal]
   
6. Aravind Srinivasan
   On the approximability of clique and related maximization problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2003, v:67, n:3, pp:633-651 [Journal]