Theoretical Computer Science, Volume 351

Volume 351, Number 1, 14 February 2006

• Marc Daumas, Nathalie Revol:
  Preface. 1
  
• Matthew W. Parker:
  Three concepts of decidability for general subsets of uncountable spaces. 2-13
  
• Martin Ziegler:
  Stability versus speed in a computable algebraic model. 14-26
  
• Xizhong Zheng, Dianchen Lu, Kejin Bao:
  Divergence bounded computable real numbers. 27-38
  
• Alberto Ciaffaglione, Pietro Di Gianantonio:
  A certified, corecursive implementation of exact real numbers. 39-51
  
• Joris van der Hoeven:
  Computations with effective real numbers. 52-60
  
• Jesse Hughes, Milad Niqui:
  Admissible digit sets. 61-73
  
• Keith Briggs:
  Implementing exact real arithmetic in python, C++ and C. 74-81
  
• M. Hill, I. Robinson:
  Quadrature using 64-bit IEEE arithmetic for integrands over [0, 1] with a singularity at 1. 82-100
  
• Peter Kornerup, Jean-Michel Muller:
  Choosing starting values for certain Newton-Raphson iterations. 101-110
  
• Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion:
  The design of the Boost interval arithmetic library. 111-118
  
• Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau:
  Using interval arithmetic to prove that a set is path-connected. 119-128
  

Volume 351, Number 2, 21 February 2006

• Savi Maharaj, Carron Shankland, Charles Rattray:
  Preface. 129-130
  
• Hubert Garavel, Wendelin Serwe:
  State space reduction for process algebra specifications. 131-145
  
• Gillian Hill, Steven Vickers:
  A language for configuring multi-level specifications. 146-166
  
• Abdessamad Imine, Michaël Rusinowitch, Gérald Oster, Pascal Molli:
  Formal design and verification of operational transformation algorithms for copies convergence. 167-183
  
• Alexander Knapp, Stephan Merz, Martin Wirsing, Júlia Zappe:
  Specification and refinement of mobile systems in MTLA and mobile UML. 184-202
  
• Juliana Küster Filipe:
  Modelling concurrent interactions. 203-220
  
• Bernhard Möller, Georg Struth:
  Algebras of modal operators and partial correctness. 221-239
  
• M. Birna van Riemsdijk, John-Jules Ch. Meyer, Frank S. de Boer:
  Semantics of plan revision in intelligent agents. 240-257
  
• Élodie-Jane Sims:
  Extending separation logic with fixpoints and postponed substitution. 258-275
  
• Sun Meng, Luís Soares Barbosa:
  Components as coalgebras: The refinement dimension. 276-294
  

Volume 351, Number 3, 28 February 2006

• Rod Downey, Michael A. Langston, Rolf Niedermeier:
  Editorial. 295
  
• David Bryant, Jens Lagergren:
  Compatibility of unrooted phylogenetic trees is FPT. 296-302
  
• Jonathan F. Buss, Tarique Islam:
  Simplifying the weft hierarchy. 303-313
  
• Yijia Chen, Jörg Flum:
  On miniaturized problems in parameterized complexity theory. 314-336
  
• Peter Damaschke:
  Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. 337-350
  
• Michael R. Fellows, Stefan Szeider, Graham Wrightson:
  On finding short resolution refutations and small unsatisfiable subsets. 351-359
  
• Robert Haas, Michael Hoffmann:
  Chordless paths through three vertices. 360-371
  
• Petr Hlinený, Detlef Seese:
  Trees, grids, and MSO decidability: From graphs to matroids. 372-393
  
• Dániel Marx:
  Parameterized graph separation problems. 394-406
  
• Dániel Marx:
  Parameterized coloring problems on chordal graphs. 407-424
  
• Matthias Müller-Hannemann, Karsten Weihe:
  Moving policies in cyclic assembly line scheduling. 425-436
  
• Elena Prieto, Christian Sloper:
  Looking at the stars. 437-445
  
• Venkatesh Raman, Saket Saurabh:
  Parameterized algorithms for feedback set problems and their duals in tournaments. 446-458