1. A new lower bound on the monotone network complexity of Boolean sums

   • Ingo Wegener

   OriginalPaper 01 February 1980 Pages: 109 - 114

2. Methods for the automatic construction of error correcting parsers

   • Johannes Röhrich

   OriginalPaper 01 February 1980 Pages: 115 - 139

3. Efficient LL(1) error correction and recovery using only insertions

   • C. N. Fischer
   • D. R. Milton
   • S. B. Quiring

   OriginalPaper 01 February 1980 Pages: 141 - 154

4. Efficient worst-case data structures for range searching

   • J. L. Bentley
   • H. A. Maurer

   OriginalPaper 01 February 1980 Pages: 155 - 168

5. Proving correctness of coroutines without history variables

   • Edmund Melson Clarke

   OriginalPaper 01 February 1980 Pages: 169 - 188

6. An Ogden-like iteration lemma for rational power series

   • Christophe Reutenauer

   OriginalPaper 01 February 1980 Pages: 189 - 197

7. Amounts of nondeterminism in finite automata

   • Chandra M. R. Kintala
   • Detlef Wotschke

   OriginalPaper 01 February 1980 Pages: 199 - 204