Information and Computation, Volume 84

Volume 84, Number 1, 1990

• George K. Georgakopoulos, Dimitris J. Kavvadias: The Banker's Problem with Precedences. 1-12 BibTeX
• Samir Khuller: Extending Planar Graph Algorithms to K_3,3-Free Graphs. 13-25 BibTeX
• Dieter Spreen: Computable One-to-One Enumerations of Effective Domains. 26-46 BibTeX
• Azeddine Lazrek, Pierre Lescanne, Jean-Jacques Thiel: Tools for Proving Inductive Equalities, Relative Completeness, and omega-Completeness. 47-70 BibTeX
• Torben Hagerup: Optimal Parallel Algorithms on Planar Graphs. 71-96 BibTeX
• Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung: The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks. 97-118 BibTeX
• Jin-yi Cai: A Note on the Determinant and Permanent Problem. 119-127 BibTeX

Volume 84, Number 2, 1990

• Pierre America, Frank S. de Boer: Proving Total Correctness of Recursive Procedures. 129-162 BibTeX
• Joost Engelfriet, Grzegorz Rozenberg: A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars. 163-206 BibTeX
• Shojiro Sakata: Extension of the Berlekamp-Massey Algorithm to N Dimensions. 207-239 BibTeX