Information and Computation, Volume 78

Volume 78, Number 1, 1988

Bruno Courcelle, Pierre Deransart: Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming. 1-55 BibTeX
Ming Li, Paul M. B. Vitányi: Tape versus Queue and Stacks: The Lower Bounds. 56-85 BibTeX

Alan L. Selman: Promise Problems Complete for Complexity Classes. 87-97 BibTeX
László Babai, Bettina Just, Friedhelm Meyer auf der Heide: On the Limits of Computations with the Floor Function. 99-107 BibTeX
Kevin J. Compton: The Computational Complexity of Asymptotic Problems I: Partial Orders. 108-123 BibTeX
Kosaburo Hashiguchi: Algorithms for Determining Relative Star Height and Star Height. 124-169 BibTeX

Toshiya Itoh, Shigeo Tsujii: A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases. 171-177 BibTeX
Sophocles Ephremidis, Christos H. Papadimitriou, Martha Sideri: Complexity Characterizations of Attribute Grammar Languages. 178-186 BibTeX
Heiko Vogler: The OI-Hierarchy Is Closed under Control. 187-204 BibTeX
Jos C. M. Baeten, Jan A. Bergstra: Global Renaming Operators in Concrete Process Algebra. 205-245 BibTeX
Susan Landau: Some Remarks on Computing the Square Parts of Integers. 246-253 BibTeX