Hemaspaandra, E.; Hemaspaandra, L. A.; Hempel, H. \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness. (English) Zbl 0896.68060 Theory Comput. Syst. 31, No. 3, 307-325 (1998). MSC: 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Bouabdallah, A.; Heydemann, M. C.; Opatrny, J.; Sotteau, D. Embedding complete binary trees into star and Pancake graphs. (English) Zbl 0896.68108 Theory Comput. Syst. 31, No. 3, 279-305 (1998). MSC: 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Cormen, T. H.; Bruhl, K. Don’t be too clever: Routing BMMC permutations on the MasPar MP-2. (English) Zbl 0896.68004 Theory Comput. Syst. 31, No. 3, 251-278 (1998). MSC: 68M07 68M99 × Cite Format Result Cite Review PDF Full Text: DOI
Gemis, M.; Paredaens, J.; Peelman, P.; Van den Bussche, J. Expressiveness and complexity of generic graph machines. (English) Zbl 0896.68054 Theory Comput. Syst. 31, No. 3, 231-249 (1998). MSC: 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Staiger, L. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. (English) Zbl 0896.68080 Theory Comput. Syst. 31, No. 3, 215-229 (1998). MSC: 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI