Information and Computation, Volume 139

Volume 139, Number 1, November 25, 1997

Yonatan Aumann, Michael A. Bender, Lisa Zhang: Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. 1-16 BibTeX
Christiane Frougny: On the Sequentiality of the Successor Function. 17-38 BibTeX
Giorgio Ghelli: Termination of System F-bounded: A Complete Proof. 39-56 BibTeX
Franco Barbanera, Stefano Berardi: The Simply-Typed Theory of Beta-Conversion has no Maximum Extension. 57-61 BibTeX
Stephen L. Bloom, Zoltán Ésik: Axiomatizing Shuffle and Concatenation in Languages. 62-91 BibTeX
Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos: On Interval Routing Schemes and Treewidth. 92-109 BibTeX

Alexander Moshe Rabinovich: Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. 111-129 BibTeX
Symeon Bozapalidis: Positive Tree Representations and Applications to Tree Automata. 130-153 BibTeX
Zena M. Ariola, Jan Willem Klop: Lambda Calculus with Explicit Recursion. 154-233 BibTeX
Maren Hinrichs, Gerd Wechsung: Time Bounded Frequency Computations. 234-257 BibTeX
Sergio De Agostino, Riccardo Silvestri: A Worst-Case Analysis of the LZ2 Compression Algorithm. 258-268 BibTeX