1. Querying fragmented relations in a distributed database

   • C. Meghini
   • C. Thanos

   OriginalPaper 01 June 1985 Pages: 125 - 138

2. On scheduling tasks with exponential service times and in-tree precedence constraints

   • John Bruno

   OriginalPaper 01 June 1985 Pages: 139 - 148

3. Rewrite systems on a lattice of types

   • R. J. Cunningham
   • A. J. J. Dick

   OriginalPaper 01 June 1985 Pages: 149 - 169

4. An algorithm for merging heaps

   • Jörg -R. Sack
   • Thomas Strothotte

   OriginalPaper 01 June 1985 Pages: 171 - 186

5. Drawing plane graphs nicely

   • Norishige Chiba
   • Kazunori Onoguchi
   • Takao Nishizeki

   OriginalPaper 01 June 1985 Pages: 187 - 201

6. An effectively given initial semigroup

   • Tsutomu Kamimura

   OriginalPaper 01 June 1985 Pages: 203 - 227

7. A 2.5n lower bound on the monotone network complexity of T₃ⁿ

   • Paul E. Dunne

   OriginalPaper 01 June 1985 Pages: 229 - 240