1. The optimal binary search tree for Andersson's search algorithm

   • David Spuler

   OriginalPaper Pages: 405 - 407

2. Scheduling saves in fault-tolerant computations

   • E. G. Coffman Jr.
   • Leopold Flatto
   • A. Y. Kreinin

   OriginalPaper Pages: 409 - 423

3. Decomposing a window into maximal quadtree blocks

   • Walid G. Aref
   • Hanan Samet

   OriginalPaper Pages: 425 - 439

4. On simplest possible solutions for Post Correspondence Problems

   • Alexandru Mateescu
   • Arto Salomaa

   OriginalPaper Pages: 441 - 457

5. On the expected height of fringe-balanced trees

   • Luc Devroye

   OriginalPaper Pages: 459 - 466

6. Infinitary parallelism without unbounded nondeterminism in CSP

   • K. Narayan Kumar
   • Paritosh K. Pandya

   OriginalPaper Pages: 467 - 487

7. On minimizing the ∀-≩ degree of a connective-free formula

   • Jan Van den Bussche

   OriginalPaper Pages: 489 - 502