Journals in DBLP

Theory Comput. Syst.
1998, volume: 31, number: 1

1. Daniel Hammer, Alexander Shen
   A Strange Application of Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:1-4 [Journal]
   
2. Fabrizio Luccio, Linda Pagli
   Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:5-26 [Journal]
   
3. Sanjay Gupta
   Isolating an Odd Number of Elements and Applications in Complexity Theory. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:27-40 [Journal]
   
4. Amir Ben-Dor, Shai Halevi, Assaf Schuster
   Potential Function Analysis of Greedy Hot-Potato Routing. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:41-61 [Journal]
   
5. Frank K. Hwang, Y. C. Yao
   Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:63-66 [Journal]
   
6. Jin-yi Cai
   Frobenius's Degree Formula and Toda's Polynomials. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:67-75 [Journal]
   
7. Harry Buhrman, Jim Kadin, Thomas Thierauf
   Functions Computable with Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:77-92 [Journal]
   
8. K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
   The Chain Method to Separate Counting Classes. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:1, pp:93-108 [Journal]