Theoretical Computer Science, Volume 201

Volume 201, Numbers 1-2, 6 July 1998

• Philippe Jacquet, Wojciech Szpankowski:
  Analytical Depoissonization and its Applications. 1-62
  
• E. A. Cichon, Elias Tahhan-Bittar:
  Ordinal Recursive Bounds for Higman's Theorem. 63-84
  
• Tak Wah Lam, Ka Hing Lee:
  An Improved Scheme for Set Equality Testing and Updating. 85-97
  
• Cristopher Moore:
  Dynamical Recognizers: Real-Time Language Recognition by Analog Computers. 99-136
  
• Natacha Portier:
  Résolutions universelles pour des problèmes NP-complets. 137-150
  
• Laurent Rosaz:
  Inventories of Unavoidable Languages and the Word-Extension Conjecture. 151-170
  
• Gianpiero Cattaneo, Luciano Margara:
  Generalized Sub-Shifts in Elementary Cellular Automata: The "Strange Case" of Chaotic Rule 180. 171-187
  
• Mariusz Flasinski:
  Power Properties of NLC Graph Grammars with a Polynomial Membership Problem. 189-231
  
• Koichi Wada, Akinari Takaki, Kimio Kawaguchi:
  Efficient Algorithms for a Mixed k-Partition Problem of Graphs Without Specifying Bases. 233-248
  
• Paolo Ferragina, Roberto Grossi, Manuela Montangero:
  On Updating Suffix Tree Labels. 249-262
  
• Kunsoo Park:
  Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. 263-273
  
• Kuo-Liang Chung:
  An Improved Algorithm for Solving the Banded Cyclic String-to-String Correction Problem. 275-279
  
• Josep Díaz, Maria J. Serna, Paul G. Spirakis:
  On the Random Generation and Counting of Matchings in Dense Graphs. 281-290