Why Computational Complexity Requires Stricter Martingales John M. HitchcockJack H. Lutz OriginalPaper 14 June 2005 Pages: 277 - 296
The Expressive Power of Bijections over Weakly Arithmetized Structures Étienne AilloudArnaud Durand OriginalPaper 03 May 2005 Pages: 297 - 309
Algebraic Characterization of Reversible Logic Gates Xiaoyu SongGuowu YangYuke Wang OriginalPaper 20 December 2004 Pages: 311 - 319
Optimal Implicit Dictionaries over Unbounded Universes Gianni FranceschiniRoberto Grossi OriginalPaper 03 August 2005 Pages: 321 - 345
Reachability Problems on Regular Ground Tree Rewriting Graphs Christof Löding OriginalPaper 28 January 2005 Pages: 347 - 383
A Reference Correction of "Effective Jordan Decomposition" Xizhong ZhengRobert Rettinger OriginalPaper 30 December 2005 Pages: 385 - 385