The optimal binary search tree for Andersson's search algorithm David Spuler OriginalPaper Pages: 405 - 407
Scheduling saves in fault-tolerant computations E. G. Coffman Jr.Leopold FlattoA. Y. Kreinin OriginalPaper Pages: 409 - 423
Decomposing a window into maximal quadtree blocks Walid G. ArefHanan Samet OriginalPaper Pages: 425 - 439
On simplest possible solutions for Post Correspondence Problems Alexandru MateescuArto Salomaa OriginalPaper Pages: 441 - 457
Infinitary parallelism without unbounded nondeterminism in CSP K. Narayan KumarParitosh K. Pandya OriginalPaper Pages: 467 - 487
On minimizing the ∀-≩ degree of a connective-free formula Jan Van den Bussche OriginalPaper Pages: 489 - 502
