Theoretical Computer Science, Volume 221

Volume 221, Numbers 1-2, June 1999

• Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
  Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. 3-18
  
• Yair Bartal, Stefano Leonardi:
  On-Line Routing in All-Optical Networks. 19-39
  
• Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
  Enumerative Sequences of Leaves and Nodes in Rational Trees. 41-60
  
• Bruno Durand:
  Tilings and Quasiperiodicity. 61-75
  
• Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow:
  A Few Logs Suffice to Build (almost) All Trees: Part II. 77-118
  
• Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano:
  Optimal Wavelength Routing on Directed Fiber Trees. 119-137
  
• Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
  Improving Spanning Trees by Upgrading Nodes. 139-155
  
• Giovanni Manzini, Luciano Margara:
  A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm. 157-177
  
• Krzysztof R. Apt:
  The Essence of Constraint Propagation. 179-210
  
• Ahmed Bouajjani, Peter Habermehl:
  Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. 211-250
  
• Olaf Burkart, Bernhard Steffen:
  Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes. 251-270
  
• Erik P. de Vink, Jan J. M. M. Rutten:
  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. 271-293
  
• Pietro Di Gianantonio:
  An Abstract Data Type for Real Numbers. 295-326
  
• Yuxi Fu:
  Variations on Mobile Processes. 327-368
  
• Thomas A. Henzinger, Peter W. Kopke:
  Discrete-Time Control for Rectangular Hybrid Automata. 369-392
  
• Kohei Honda, Nobuko Yoshida:
  Game-Theoretic Analysis of Call-by-Value Computation. 393-456
  
• Davide Sangiorgi:
  The Name Discipline of Uniform Receptiveness. 457-493