
Journals in DBLP
 Ronen Shaltiel
Towards proving strong direct product theorems. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2003, v:12, n:12, pp:122 [Journal]
 Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2003, v:12, n:12, pp:2347 [Journal]
 John Watrous
On the complexity of simulating spacebounded quantum computations. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2003, v:12, n:12, pp:4884 [Journal]
