Information and Computation, Volume 84

Volume 84, Number 1, 1990

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

Volume 84, Number 2, 1990

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

Last update Fri May 24 20:21:54 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page