
Journals in DBLP
 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:97122 [Journal]
 John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
Robust learningrich and poor. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:2, pp:123165 [Journal]
 Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Approximation algorithms for classes of graphs excluding singlecrossing graphs as minors. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:2, pp:166195 [Journal]
 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:196234 [Journal]
 Boris Alexeev
Minimal DFA for testing divisibility. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:2, pp:235243 [Journal]
 Howard Barnum, Michael E. Saks
A lower bound on the quantum query complexity of readonce functions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:2, pp:244258 [Journal]
 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:259280 [Journal]
 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:281302 [Journal]
