A new lower bound on the monotone network complexity of Boolean sums Ingo Wegener OriginalPaper 01 February 1980 Pages: 109 - 114
Methods for the automatic construction of error correcting parsers Johannes Röhrich OriginalPaper 01 February 1980 Pages: 115 - 139
Efficient LL(1) error correction and recovery using only insertions C. N. FischerD. R. MiltonS. B. Quiring OriginalPaper 01 February 1980 Pages: 141 - 154
Efficient worst-case data structures for range searching J. L. BentleyH. A. Maurer OriginalPaper 01 February 1980 Pages: 155 - 168
Proving correctness of coroutines without history variables Edmund Melson Clarke OriginalPaper 01 February 1980 Pages: 169 - 188
An Ogden-like iteration lemma for rational power series Christophe Reutenauer OriginalPaper 01 February 1980 Pages: 189 - 197
Amounts of nondeterminism in finite automata Chandra M. R. KintalaDetlef Wotschke OriginalPaper 01 February 1980 Pages: 199 - 204