default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 43
Volume 43, Number 1, July 2008
- Thomas Erlebach
, Giuseppe Persiano:
WAOA 2005 Special Issue of TOCS. 1-2 - Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees. 3-18 - Markus Bläser, L. Shankar Ram:
Approximately Fair Cost Allocation in Metric Traveling Salesman Games. 19-37 - Xin Han, Kazuo Iwama, Guochuan Zhang:
Online Removable Square Packing. 38-55 - Ronald Koch, Martin Skutella, Ines Spenke:
Maximum k -Splittable s , t -Flows. 56-66 - Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
Speed Scaling of Tasks with Precedence Constraints. 67-80 - Hadas Shachnai, Tami Tamir, Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation. 81-98
Volume 43, Number 2, August 2008
- Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
Foreword. 99 - Vikraman Arvind, Bireswar Das:
SZK Proofs for Black-Box Group Problems. 100-117 - Olaf Beyersdorff:
Tuples of Disjoint NP-Sets. 118-135 - Manuel Bodirsky, Jan Kára:
The Complexity of Equality Constraint Languages. 136-158 - Anna Gál, Michal Koucký, Pierre McKenzie:
Incremental Branching Programs. 159-184 - Evan Goris:
Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic. 185-203 - Leonid 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. 204-233 - Daniel Mölle, Stefan Richter, Peter Rossmanith:
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. 234-253 - Vladimir V. Rybakov:
Branching Time Logics BTLU, SN, N-1(Z)a with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms. 254-271 - Tatiana Yavorskaya:
Interacting Explicit Evidence Systems. 272-293
Volume 43, Numbers 3-4, December 2008
- Arnold Beckmann, Benedikt Löwe:
Computability in Europe 2006. 295-297 - Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer:
A Provably Correct Translation of the lambda -Calculus into a Mathematical Model of C++. 298-321 - Erika Ábrahám, Andreas Grüner, Martin Steffen:
Abstract Interface Behavior of Object-Oriented Languages with Monitors. 322-361 - Roland Carl Backhouse, Henk Doornbos:
Datatype-Generic Termination Proofs. 362-393 - Ulrich Berger, Tie Hou:
Coinduction for Exact Real Number Computation. 394-409 - Jan A. Bergstra, John V. Tucker:
Division Safe Calculation in Totalised Fields. 410-424 - David Doty:
Dimension Extractors and Optimal Decompression. 425-463 - Christine Gaßner:
A Hierarchy below the Halting Problem for Additive Machines. 464-470 - John M. Hitchcock, María López-Valdés, Elvira Mayordomo:
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. 471-497 - Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. 498-515 - Lars Kristiansen:
Complexity-Theoretic Hierarchies Induced by Fragments of Gödel's T. 516-541 - Johann A. Makowsky:
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. 542-562 - Alban Ponse, Mark van der Zwaag:
Risk Assessment for One-Counter Threads. 563-582 - Helmut Schwichtenberg:
Realizability interpretation of proofs in constructive analysis. 583-602 - Xizhong Zheng:
Classification of Computably Approximable Real Numbers. 603-624
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
