Journal: Theory Comput. Syst.

Volume 43, Issue 3-4

295 -- 297Arnold Beckmann, Benedikt Löwe. Computability in Europe 2006
298 -- 321Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer. A Provably Correct Translation of the ::::lambda:::: -Calculus into a Mathematical Model of C++
322 -- 361Erika Ábrahám, Andreas Grüner, Martin Steffen. Abstract Interface Behavior of Object-Oriented Languages with Monitors
362 -- 393Roland Carl Backhouse, Henk Doornbos. Datatype-Generic Termination Proofs
394 -- 409Ulrich Berger, Tie Hou. Coinduction for Exact Real Number Computation
410 -- 424Jan A. Bergstra, John V. Tucker. Division Safe Calculation in Totalised Fields
425 -- 463David Doty. Dimension Extractors and Optimal Decompression
464 -- 470Christine Gaßner. A Hierarchy below the Halting Problem for Additive Machines
471 -- 497John M. Hitchcock, María López-Valdés, Elvira Mayordomo. Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
498 -- 515Margarita V. Korovina, Nicolai Vorobjov. Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
516 -- 541Lars Kristiansen. Complexity-Theoretic Hierarchies Induced by Fragments of Gödel s ::::T::::
542 -- 562Johann A. Makowsky. From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
563 -- 582Alban Ponse, Mark van der Zwaag. Risk Assessment for One-Counter Threads
583 -- 602Helmut Schwichtenberg. Realizability interpretation of proofs in constructive analysis
603 -- 624Xizhong Zheng. Classification of Computably Approximable Real Numbers

Volume 43, Issue 2

99 -- 0Sergei N. Artëmov, Volker Diekert, Dima Grigoriev. Foreword
100 -- 117Vikraman Arvind, Bireswar Das. SZK Proofs for Black-Box Group Problems
118 -- 135Olaf Beyersdorff. Tuples of Disjoint NP-Sets
136 -- 158Manuel Bodirsky, Jan Kára. The Complexity of Equality Constraint Languages
159 -- 184Anna Gál, Michal Koucký, Pierre McKenzie. Incremental Branching Programs
185 -- 203Evan Goris. Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic
204 -- 233Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao. On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
234 -- 253Daniel Mölle, Stefan Richter, Peter Rossmanith. Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
254 -- 271Vladimir V. Rybakov. Branching Time Logics ::::BTL:::::::U, S:::::N, N:::-1:::::(::::Z::::)::a:: with Operations ::::Until:::: and ::::Since:::: Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms
272 -- 293Tatiana Yavorskaya. Interacting Explicit Evidence Systems

Volume 43, Issue 1

1 -- 2Thomas Erlebach, Giuseppe Persiano. WAOA 2005 Special Issue of TOCS
3 -- 18Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz. Improved Approximation Algorithm for Convex Recoloring of Trees
19 -- 37Markus Bläser, L. Shankar Ram. Approximately Fair Cost Allocation in Metric Traveling Salesman Games
38 -- 55Xin Han, Kazuo Iwama, Guochuan Zhang. Online Removable Square Packing
56 -- 66Ronald Koch, Martin Skutella, Ines Spenke. Maximum ::::k:::: -Splittable ::::s:::: , ::::t:::: -Flows
67 -- 80Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut. Speed Scaling of Tasks with Precedence Constraints
81 -- 98Hadas Shachnai, Tami Tamir, Omer Yehezkely. Approximation Schemes for Packing with Item Fragmentation