Lower bounds for sorting on mesh-connected architectures Manfred Kunde OriginalPaper Pages: 121 - 130
Losslessness and project-join constructibility in relational databases G. LoizouP. Thanisch OriginalPaper Pages: 131 - 144
Redundant proofs of non-interference in Levin-Gries CSP program proofs Thomas P. Murtagh OriginalPaper Pages: 145 - 156
The undecidability of the unification and matching problem for canonical theories Stephan HeilbrunnerSteffen Hölldobler OriginalPaper Pages: 157 - 171
SLR(1) and LALR(1) parsing for unrestricted grammars Lawrence A. Harris OriginalPaper Pages: 191 - 209