Journals in DBLP

J. Comput. Syst. Sci.
2001, volume: 63, number: 2

1. Pavel Pudlák
   Gust Editor's Foreword. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:147- [Journal]
   
2. Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
   The Communication Complexity of Enumeration, Elimination, and Selection. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:148-185 [Journal]
   
3. David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
   On the Complexity of Some Problems on Groups Input as Multiplication Tables. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:186-200 [Journal]
   
4. André Berthiaume, Wim van Dam, Sophie Laplante
   Quantum Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:201-221 [Journal]
   
5. Oliver Giel
   Branching Program Size Is Almost Linear in Formula Size. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:222-235 [Journal]
   
6. Valentine Kabanets
   Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:236-252 [Journal]
   
7. Ketan Mulmuley, Pradyut Shah
   A Lower Bound for the Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:253-267 [Journal]
   
8. Iannis Tourlakis
   Time-Space Tradeoffs for SAT on Nonuniform Machines. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:268-287 [Journal]
   
9. Ke Yang
   Integer Circuit Evaluation Is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2001, v:63, n:2, pp:288-303 [Journal]