Journals in DBLP

J. Comput. Syst. Sci.
2004, volume: 69, number: 2

1. John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
   Scaled dimension and nonuniform complexity. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:97-122 [Journal]
   
2. John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
   Robust learning--rich and poor. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:123-165 [Journal]
   
3. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
   Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:166-195 [Journal]
   
4. Deepak Chawla, Lin Li, Stephen Scott
   On approximating weighted sums with exponentially many terms. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:196-234 [Journal]
   
5. Boris Alexeev
   Minimal DFA for testing divisibility. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:235-243 [Journal]
   
6. Howard Barnum, Michael E. Saks
   A lower bound on the quantum query complexity of read-once functions. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:244-258 [Journal]
   
7. Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack
   On relations between counting communication complexity classes. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:259-280 [Journal]
   
8. Andrew Lomonosov, Meera Sitharam, Kihong Park
   Network QoS games: stability vs optimality tradeoff. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2004, v:69, n:2, pp:281-302 [Journal]