External Links

    Journal: Theory Comput. Syst.

    Volume 39, Issue 2

    277 -- 296John M. Hitchcock, Jack H. Lutz. Why Computational Complexity Requires Stricter Martingales
    297 -- 309Étienne Ailloud, Arnaud Durand. The Expressive Power of Bijections over Weakly Arithmetized Structures
    311 -- 319Xiaoyu Song, Guowu Yang, Marek A. Perkowski, Yuke Wang. Algebraic Characterization of Reversible Logic Gates
    321 -- 345Gianni Franceschini, Roberto Grossi. Optimal Implicit Dictionaries over Unbounded Universes
    347 -- 383Christof Löding. Reachability Problems on Regular Ground Tree Rewriting Graphs
    385 -- 385Xizhong Zheng, Robert Rettinger. A Reference Correction of Effective Jordan Decomposition
    runs on