Theoretical Computer Science, Volume 390

Volume 390, Number 1, January 2008

• Eugene Asarin, Gordon J. Pace, Gerardo Schneider, Sergio Yovine:
  Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools. 1-26
  
• Ralf Klasing, Euripides Markou, Andrzej Pelc:
  Gathering asynchronous oblivious mobile robots in a ring. 27-39
  
• Alberto Apostolico, Laxmi Parida, Simona E. Rombo:
  Motif patterns in 2D. 40-55
  
• Victor Chepoi, Karim Nouioua, Yann Vaxès:
  A rounding algorithm for approximating minimum Manhattan networks. 56-69
  
• Jung-Heum Park:
  Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2^m, 4). 70-80
  
• Ehab Morsy, Hiroshi Nagamochi:
  An improved approximation algorithm for capacitated multicast routings in networks. 81-91
  
• Liesbeth De Mol:
  Tag systems and Collatz-like functions. 92-101
  
• Adrian Atanasiu, Radu Atanasiu, Ion Petre:
  Parikh matrices and amiable words. 102-109
  
• Yongqiang Shi, Deshi Ye:
  Online bin packing with arbitrary release times. 110-119
  

• Yongxi Cheng, Ker-I Ko, Weili Wu:
  On the complexity of non-unique probe selection. 120-125
  

Volume 390, Numbers 2-3, January 2008

• Vladimiro Sassone:
  Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005. 127-128
  

• Samy Abbes, Albert Benveniste:
  True-concurrency probabilistic models: Markov nets and a law of large numbers. 129-170
  
• Alan Jeffrey, Julian Rathke:
  Full abstraction for polymorphic pi-calculus. 171-196
  
• Kim Guldstrand Larsen, Jacob Illum Rasmussen:
  Optimal reachability for multi-priced timed automata. 197-213
  
• Andrzej S. Murawski, Igor Walukiewicz:
  Third-order Idealized Algol with iteration is decidable. 214-229
  
• Lutz Schröder:
  Expressivity of coalgebraic modal logic: The limits and beyond. 230-247
  
• Ian Stark:
  Free-algebra models for the pi -calculus. 248-270