Journals in DBLP

Theor. Comput. Sci.
2000, volume: 240, number: 2

1. Jin-yi Cai, D. Sivakumar
   Resolution of Hartmanis' conjecture for NL-hard sparse sets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:257-269 [Journal]
   
2. Vincent Berry, Olivier Gascuel
   Inferring evolutionary trees with strong combinatorial evidence. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:271-298 [Journal]
   
3. Lin Chen
   A selected tour of the theory of identification matrices. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:299-318 [Journal]
   
4. Rüdiger Reischuk
   Can large fanin circuits perform reliable computations in the presence of faults? [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:319-335 [Journal]
   
5. Yuji Kobayashi, Friedrich Otto
   Repetitiveness of languages generated by morphisms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:337-378 [Journal]
   
6. Peter Eades, Xuemin Lin
   Spring algorithms and symmetry. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:379-405 [Journal]
   
7. Abul Kashem, Xiao Zhou, Takao Nishizeki
   Algorithms for generalized vertex-rankings of partial k-trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:407-427 [Journal]
   
8. Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang
   Edge and node searching problems on trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:429-446 [Journal]
   
9. Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang
   Image compression for fast wavelet-based subregion retrieval. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:240, n:2, pp:447-469 [Journal]
   
10. Thomas Hofmeister, Matthias Krause, Hans-Ulrich Simon
    Contrast-optimal k out of n secret sharing schemes in visual cryptography. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:471-485 [Journal]
    
11. Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan
    A multi-tree routing scheme using acyclic orientations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:487-494 [Journal]