Theoretical Computer Science, Volume 156

Volume 156, Numbers 1&2, 25 March 1996

• Philippe Nehlig:
  Applications quasi affines: pavages par images réciproques. 1-38
  
• Rainer Kemp:
  Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities. 39-70
  
• Pál Gyenizse, Sándor Vágvölgyi:
  Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations. 71-97
  
• Matthias Krause:
  Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. 99-117
  
• Nicolas Bedon:
  Finite Automata and Ordinals. 119-144
  
• Olympia Louscou-Bozapalidou:
  Stochastically Costed Tree Automata: Turakainen's Theorem. 145-158
  
• Jean Françon:
  Sur la topologie d'un plan arithmétique. 159-176
  
• Michael I. Schwartzbach:
  Static Correctness of Hierarchical Procedures. 177-201
  
• Michael Forti, Furio Honsell:
  A General Construction of Hyperuniverses. 203-215
  
• Yoshikane Takahashi:
  A Unified Constructive Network Model for Problem-Solving. 217-261
  
• Yonghoan Kim:
  New Values in Domineering. 263-280
  
• Véronique Terrier:
  Language not Recognizable in Real Time by One-Way Cellular Automata. 281-287
  
• André Arnold, Ilaria Castellani:
  An Algebraic Characterization of Observational Equivalence. 289-299
  
• Giovanni Manzini:
  On the Ordering of Sparse Linear Systems. 301-313
  
• Roberto De Prisco, Alfredo De Santis:
  New Lower Bounds on the Cost of Binary Search Trees. 315-325
  

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