Journals in DBLP

Theor. Comput. Sci.
2003, volume: 292, number: 3

1. André Berthiaume, John D. Rogers
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:573- [Journal]
   
2. John Watrous
   PSPACE has constant-round quantum interactive proof systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:575-588 [Journal]
   
3. Pawel Horodecki, John A. Smolin, Barbara M. Terhal, Ashish V. Thapliyal
   Rank two bipartite bound entangled states do not exist. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:589-596 [Journal]
   
4. Lance Fortnow
   One complexity theorist's view of quantum computing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:597-610 [Journal]
   
5. Andrzej Ehrenfeucht, Grzegorz Rozenberg
   Forbidding-enforcing systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:611-638 [Journal]
   
6. Hermann Jung, Maria J. Serna, Paul G. Spirakis
   An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:639-652 [Journal]
   
7. Grzegorz Rozenberg, Herman P. Spaink
   DNA computing by blocking. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:653-665 [Journal]
   
8. Wei-Mei Chen, Gen-Huey Chen
   Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:667-677 [Journal]
   
9. Xuemin Lin, Peter Eades
   Towards area requirements for drawing hierarchically planar graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:3, pp:679-695 [Journal]
   
10. Yuliang Zheng, Xian-Mo Zhang
    Connections among nonlinearity, avalanche and correlation immunity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:697-710 [Journal]
    
11. Andrés Moreira
    Universality and decidability of number-conserving cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:711-721 [Journal]
    
12. Jack Jie Dai
    A stronger Kolmogorov zero-one law for resource-bounded measure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:723-732 [Journal]