Journals in DBLP

Theor. Comput. Sci.
1997, volume: 181, number: 2

1. Ding-Zhu Du, Ming Li
   Foreword (COCOON'95). [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:227- [Journal]
   
2. Jay Belanger, Jie Wang
   No NP Problems Averaging Over Ranking of Distributions are Harder. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:229-245 [Journal]
   
3. Jianer Chen
   Algorithmic Graph Embeddings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:247-266 [Journal]
   
4. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
   Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:267-287 [Journal]
   
5. Kojiro Kobayashi
   Transformations that Preserve Malignness of Universal Distributions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:289-306 [Journal]
   
6. Andrzej Lingas
   Maximum Tree-Packing in Time O(n^5/2). [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:307-316 [Journal]
   
7. Kouichi Sakurai
   Practical Proofs of Knowledge without Relying on Theoretical Proofs of Membership on Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:317-335 [Journal]
   
8. John Tromp, Louxin Zhang, Ying Zhao
   Small Weight Bases for Hamming Codes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:337-345 [Journal]
   
9. Peng-Jun Wan, Qifan Yang, Dean Kelley
   A 3/2 log 3-Competitive Algorithm for the Counterfeit Coin Problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:181, n:2, pp:347-356 [Journal]
   
10. Xiangdong Yu, Moti Yung
    Scheduling Task-Trees with Additive Scales on Parallel/Distributed Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:357-378 [Journal]
    
11. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:379-404 [Journal]