1. Why Computational Complexity Requires Stricter Martingales

   • John M. Hitchcock
   • Jack H. Lutz

   OriginalPaper 14 June 2005 Pages: 277 - 296

2. The Expressive Power of Bijections over Weakly Arithmetized Structures

   • Étienne Ailloud
   • Arnaud Durand

   OriginalPaper 03 May 2005 Pages: 297 - 309

3. Algebraic Characterization of Reversible Logic Gates

   • Xiaoyu Song
   • Guowu Yang
   • Yuke Wang

   OriginalPaper 20 December 2004 Pages: 311 - 319

4. Optimal Implicit Dictionaries over Unbounded Universes

   • Gianni Franceschini
   • Roberto Grossi

   OriginalPaper 03 August 2005 Pages: 321 - 345

5. Reachability Problems on Regular Ground Tree Rewriting Graphs

   • Christof Löding

   OriginalPaper 28 January 2005 Pages: 347 - 383

6. A Reference Correction of "Effective Jordan Decomposition"

   • Xizhong Zheng
   • Robert Rettinger

   OriginalPaper 30 December 2005 Pages: 385 - 385