Journals in DBLP

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

1. Ludwig Staiger
   A. Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:3, pp:215-229 [Journal]
   
2. Marc Gemis, Jan Paredaens, Peter Peelman, Jan Van den Bussche
   Expressiveness and Complexity of Generic Graph Machines. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:3, pp:231-249 [Journal]
   
3. Thomas H. Cormen, Kristin Bruhl
   Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:3, pp:251-278 [Journal]
   
4. A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
   Embedding Complete Binary Trees Into Star and Pancake Graphs. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:3, pp:279-305 [Journal]
   
5. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
   R^{S N}_1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 1998, v:31, n:3, pp:307-325 [Journal]