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
  
• Christiane Frougny:
  On the Sequentiality of the Successor Function. 17-38
  
• Giorgio Ghelli:
  Termination of System F-bounded: A Complete Proof. 39-56
  
• Franco Barbanera, Stefano Berardi:
  The Simply-Typed Theory of Beta-Conversion has no Maximum Extension. 57-61
  
• Stephen L. Bloom, Zoltán Ésik:
  Axiomatizing Shuffle and Concatenation in Languages. 62-91
  
• Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos:
  On Interval Routing Schemes and Treewidth. 92-109
  

Volume 139, Number 2, December 15, 1997

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

Last update Sat May 25 20:20:32 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page