Journals in DBLP

Theory Comput. Syst.
2006, volume: 39, number: 2

1. John M. Hitchcock, Jack H. Lutz
   Why Computational Complexity Requires Stricter Martingales. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2006, v:39, n:2, pp:277-296 [Journal]
   
2. Étienne Ailloud, Arnaud Durand
   The Expressive Power of Bijections over Weakly Arithmetized Structures. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2006, v:39, n:2, pp:297-309 [Journal]
   
3. Xiaoyu Song, Guowu Yang, Marek A. Perkowski, Yuke Wang
   Algebraic Characterization of Reversible Logic Gates. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2006, v:39, n:2, pp:311-319 [Journal]
   
4. Gianni Franceschini, Roberto Grossi
   Optimal Implicit Dictionaries over Unbounded Universes. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2006, v:39, n:2, pp:321-345 [Journal]
   
5. Christof Löding
   Reachability Problems on Regular Ground Tree Rewriting Graphs. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2006, v:39, n:2, pp:347-383 [Journal]
   
6. Xizhong Zheng, Robert Rettinger
   A Reference Correction of "Effective Jordan Decomposition". [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2006, v:39, n:2, pp:385-385 [Journal]