Theoretical Computer Science, Volume 194

Volume 194, Numbers 1-2, 10 March 1998

• Philippe Flajolet, Brigitte Vallée:
  Continued Fraction Algorithms, Functional Operators, and Structure Constants. 1-34
  
• Henning Fernau, Dietmar Wätjen:
  Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars. 35-55
  
• G. Dányi, Zoltán Fülöp:
  Compositions with Superlinear Deterministic Top-Down Tree Transformations. 57-85
  
• Pál Gyenizse, Sándor Vágvölgyi:
  Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. 87-122
  
• Peng-Jun Wan:
  TWDM Multichannel Lightwave Hypercube Networks. 123-136
  
• Rolf Niedermeier, Peter Rossmanith:
  Unambiguous Computations and Locally Definable Acceptance Types. 137-161
  
• Sandy Irani, Steven S. Seiden:
  Randomized Algorithms for Metrical Task Systems. 163-182
  
• Anatoli N. Chebotarev, Marina K. Morokhovets:
  Resolution-Based Approach to Computability Analysis of Interacting Automata. 183-205
  
• Malika Hadjiat:
  Penelope's Graph: A Hard Minimum Cost Tension Instance. 207-218
  
• Corine Ceola, Pierre B. A. Lecomte:
  Computability of a Map and Decidability of its Graph in the Model of Blum, Shub and Smale. 219-223
  
• Pierre Fraigniaud:
  On XRAM and PRAM Models, and on Data-Movement-Intensive Problems. 225-237