Information and Computation, Volume 115

Volume 115, Number 1, 1994

• Moshe Y. Vardi, Pierre Wolper:
  Reasoning About Infinite Computations. 1-37
  
• Andrew K. Wright, Matthias Felleisen:
  A Syntactic Approach to Type Soundness. 38-94
  
• Alan David Fekete:
  Asynchronous Approximate Agreement. 95-124
  
• Eiichi Horita, J. W. de Bakker, Jan J. M. M. Rutten:
  Fully Abstract Denotational Models for Nonuniform Concurrent Languages. 125-178
  

Volume 115, Number 2, 1994

• Luca Aceto, Matthew Hennessy:
  Adding Action Refinement to a Finite Process Algebra. 179-247
  
• David Haussler, Nick Littlestone, Manfred K. Warmuth:
  Predicting \0,1\-Functions on Randomly Drawn Points. 248-292
  
• Alain J. Mayer, Larry J. Stockmeyer:
  Word Problems-This Time with Interleaving. 293-311
  
• Eli Upfal:
  Tolerating a Linear Number of Faults in Networks of Bounded Degree. 312-320
  
• Phokion G. Kolaitis, Madhukar N. Thakur:
  Logical Definability of NP Optimization Problems. 321-353
  
• Jan Friso Groote, Hans Hüttel:
  Undecidable Equivalences for Basic Process Algebra. 354-371
  

Last update Thu May 23 18:50:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page