A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction L. Staiger Pages: 215 - 229
Expressiveness and Complexity of Generic Graph Machines M. GemisJ. ParedaensJ. Van den Bussche Pages: 231 - 249
Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2 T. H. CormenK. Bruhl Pages: 251 - 278
Embedding Complete Binary Trees into Star and Pancake Graphs A. BouabdallahM. C. HeydemannD. Sotteau Pages: 279 - 305
R SN 1-tt (NP) Distinguishes Robust Many-One and Turing Completeness E. HemaspaandraL. A. HemaspaandraH. Hempel Pages: 307 - 325