Information and Computation, Volume 200

Volume 200, Number 1, 1 July 2005

• Holger Spakowski, Mayur Thakur, Rahul Tripathi:
  Quantum and classical complexity classes: Separations, collapses, and closure properties. 1-34
  Electronic Edition (link) BibTeX
• Yonit Kesten, Nir Piterman, Amir Pnueli:
  Bridging the gap between fair simulation and trace inclusion. 35-61
  Electronic Edition (link) BibTeX
• Amos Israeli, Amnon Shaham:
  Time and space optimal implementations of atomic multi-writer register. 62-106
  Electronic Edition (link) BibTeX
• Mohammad Reza Mousavi, Michel A. Reniers, Jan Friso Groote:
  Notions of bisimulation and congruence formats for SOS with data. 107-147
  Electronic Edition (link) BibTeX

Volume 200, Number 2, 1 August 2005

• Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Verena Wolf:
  Comparative branching-time semantics for Markov chains. 149-214
  Electronic Edition (link) BibTeX
• Paola Quaglia, David Walker:
  Types and full abstraction for polyadic pi-calculus. 215-246
  Electronic Edition (link) BibTeX
• Christian Glaßer, Alan L. Selman, Samik Sengupta:
  Reductions between disjoint NP-Pairs. 247-267
  Electronic Edition (link) BibTeX