1. Computing extremal and approximate distances in graphs having unit cost edges

   • Kellogg S. Booth
   • Richard J. Lipton

   OriginalPaper Pages: 319 - 328

2. Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems

   • W. Lipski Jr.
   • F. P. Preparata

   OriginalPaper Pages: 329 - 346

3. Regenerative simulation of response times in networks of queues: statistical efficiency

   • Donald L. Iglehart
   • Gerald S. Shedler

   OriginalPaper Pages: 347 - 363

4. The logic of aliasing

   • Robert Cartwright
   • Derek Oppen

   OriginalPaper Pages: 365 - 384

5. Goto statements: semantics and deduction systems

   • Arie de Bruin

   OriginalPaper Pages: 385 - 424

6. A specification technique based on predicate transformers

   • Harald Würges

   OriginalPaper Pages: 425 - 445

7. Eliminating unit reductions from LR(k) parsers using minimum contexts

   • Takehiro Tokuda

   OriginalPaper Pages: 447 - 470

8. General purpose schedulers for database systems

   • M. A. Casanova
   • P. A. Bernstein

   Erratum Pages: 471 - 471