Theoretical Computer Science, Volume 382

Volume 382, Number 1, August 2007

• Alessandra Di Pierro, Herbert Wiklicky: Preface: Quantitative aspects of programming languages. 1-2
• Alessandro Aldini, Marco Bernardo:
  Mixing logics and rewards for the component-oriented specification of performance measures. 3-23
  
• Anne Remke, Boudewijn R. Haverkort, Lucia Cloth:
  CSL model checking algorithms for QBDs. 24-41
  
• Rocco De Nicola, Joost-Pieter Katoen, Diego Latella, Michele Loreti, Mieke Massink:
  Model checking mobile stochastic logic. 42-70
  
• Osman Hasan, Sofiène Tahar:
  Formalization of the Standard Uniform random variable. 71-83
  

Volume 382, Number 2, August 2007

• Mary Cryan, Martin Farach-Colton:
  Preface. 85
  

• Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono:
  A unified access bound on comparison-based dynamic dictionaries. 86-96
  
• Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
  On coding labeled trees. 97-108
  
• Olivier Carton, Chloe Rispal:
  Complementation of rational sets on scattered linear orderings of finite rank. 109-119
  
• Josep Díaz, Maria J. Serna, Nicholas C. Wormald:
  Bounds on the bisection width for random d -regular graphs. 120-130
  
• Claudio Gutierrez, Flavio Gutierrez, Maria-Cecilia Rivara:
  Complexity of the bisection method. 131-138
  
• Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
  On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. 139-150
  
• Kirk Pruhs, Gerhard J. Woeginger:
  Approximation schemes for a class of subset selection problems. 151-156
  
• Ke Yang:
  On the (im)possibility of non-interactive correlation distillation. 157-166
  

Volume 382, Number 3, September 2007

• Shai Ben-David, John Case, Thomas Zeugmann:
  Foreword. 167-169
  

• Eric Martin, Arun Sharma, Frank Stephan:
  On the data consumption benefits of accepting increased uncertainty. 170-182
  
• Jérôme Besombes, Jean-Yves Marion:
  Learning tree languages from positive examples and membership queries. 183-197
  
• Robert H. Sloan, Balázs Szörényi, György Turán:
  Revising threshold functions. 198-208
  
• Andrei A. Bulatov, Hubie Chen, Víctor Dalmau:
  Learning intersection-closed classes with signatures. 209-220
  
• Nicolò Cesa-Bianchi:
  Applications of regularized least squares to pattern classification. 221-231
  
• Amiran Ambroladze, Emilio Parrado-Hernández, John Shawe-Taylor:
  Complexity of pattern classes and the Lipschitz property. 232-246
  
• Marcus Hutter, Andrej Muchnik:
  On semimeasures predicting Martin-Löf random sequences. 247-261
  
• Hans-Ulrich Simon:
  On the complexity of working set selection. 262-279