Theoretical Computer Science, Volume 358

Volume 358, Number 1, July 2006

• Grzegorz Rozenberg:
  Preface. 1-2
  

• Anne Broadbent, André Allan Méthot:
  On the power of non-local boxes. 3-14
  
• Katarzyna Miakisz, Edward W. Piotrowski, Jan Sladkowski:
  Quantization of games: Towards quantum artificial intelligence. 15-22
  
• Petrus H. Potgieter:
  Zeno machines and hypercomputation. 23-33
  
• Artur S. d'Avila Garcez, Luís C. Lamb, Dov M. Gabbay:
  Connectionist computations of intuitionistic reasoning. 34-55
  
• Bo Liao, Kequan Ding:
  A 3D graphical representation of DNA sequences and its application. 56-64
  
• Lvzhou Li, Daowen Qiu:
  Determination of equivalence between quantum sequential machines. 65-74
  
• Remco Loos:
  An alternative definition of splicing. 75-87
  
• Oscar H. Ibarra, Gheorghe Paun:
  Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems. 88-103
  
• Rajeev Kumar, Nilanjan Banerjee:
  Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem. 104-120
  
• Alex Rogers, Adam Prügel-Bennett, Nicholas R. Jennings:
  Phase transitions and symmetry breaking in genetic algorithms with crossover. 121-141
  

• Elena Czeizler, Eugen Czeizler:
  On the power of parallel communicating Watson-Crick automata systems. 142-147
  

Volume 358, Numbers 2-3, August 2006

• Philippa Gardner, Nobuko Yoshida:
  Editorial. 149
  

• Benedikt Bollig, Martin Leucker:
  Message-passing automata are expressively equivalent to EMSO logic. 150-172
  
• Daniele Varacca, Hagen Völzer, Glynn Winskel:
  Probabilistic event structures and domains. 173-199
  
• Paul-André Melliès:
  Asynchronous games 2: The true concurrency of innocence. 200-228
  
• Roberto M. Amadio, Silvano Dal-Zilio:
  Resource control for synchronous cooperative threads. 229-254
  
• Mikolaj Bojanczyk, Igor Walukiewicz:
  Characterizing EF and EX tree logics. 255-272
  
• Nicolas Markey, Jean-François Raskin:
  Model checking restricted sets of timed paths. 273-292
  
• Luís Caires, Étienne Lozes:
  Elimination of quantifiers and undecidability in spatial logics for concurrency. 293-314
  
• Antonín Kucera, Ph. Schnoebelen:
  A general approach to comparing infinite-state systems with their finite-state specifications. 315-333