1. Lower bounds for sorting on mesh-connected architectures

   • Manfred Kunde

   OriginalPaper Pages: 121 - 130

2. Losslessness and project-join constructibility in relational databases

   • G. Loizou
   • P. Thanisch

   OriginalPaper Pages: 131 - 144

3. Redundant proofs of non-interference in Levin-Gries CSP program proofs

   • Thomas P. Murtagh

   OriginalPaper Pages: 145 - 156

4. The undecidability of the unification and matching problem for canonical theories

   • Stephan Heilbrunner
   • Steffen Hölldobler

   OriginalPaper Pages: 157 - 171

5. An analysis of a contention resolution algorithm

   • Wojciech Szpankowski

   OriginalPaper Pages: 173 - 190

6. SLR(1) and LALR(1) parsing for unrestricted grammars

   • Lawrence A. Harris

   OriginalPaper Pages: 191 - 209

7. Extensional equivalences for transition systems

   • Rocco De Nicola

   OriginalPaper Pages: 211 - 237