1. A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction

   • L. Staiger

   Pages: 215 - 229

2. Expressiveness and Complexity of Generic Graph Machines

   • M. Gemis
   • J. Paredaens
   • J. Van den Bussche

   Pages: 231 - 249

3. Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2

   • T. H. Cormen
   • K. Bruhl

   Pages: 251 - 278

4. Embedding Complete Binary Trees into Star and Pancake Graphs

   • A. Bouabdallah
   • M. C. Heydemann
   • D. Sotteau

   Pages: 279 - 305

5. R ^SN _1-tt (NP) Distinguishes Robust Many-One and Turing Completeness

   • E. Hemaspaandra
   • L. A. Hemaspaandra
   • H. Hempel

   Pages: 307 - 325