default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 354
Volume 354, Number 1, 21 March 2006
- Anton Nijholt
, Giuseppe Scollo, Uwe Mönnich:
Editorial. 1-3 - Chantal Berline, Antonino Salibra:
Easiness in graph models. 4-23 - Dana Harrington:
Uniqueness logic. 24-41 - Markus Roggenbach:
CSP-CASL - A new integration of process algebra and algebraic specification. 42-71 - Gerald Penn:
Efficient transitive closure of sparse matrices over closed semirings. 72-81 - Stephan Kepser, Uwe Mönnich:
Closure properties of linear context-free tree languages with an application to optimality theory. 82-97 - Helmar Gust, Kai-Uwe Kühnberger, Ute Schmid:
Metaphors and heuristic-driven theory projection (HDTP). 98-117 - Peter R. J. Asveld:
Generating all permutations by context-free grammars in Chomsky normal form. 118-130 - Marcus Kracht:
Partial algebras, meaning categories and algebraization. 131-141 - Radu Gramatovici, Carlos Martín-Vide:
Sorted dependency insertion grammars. 142-152 - Rohit N. Kundaji, R. K. Shyamasundar:
Refinement calculus: A basis for translation validation, debugging and certification. 153-168
Volume 354, Number 2, 28 March 2006
- Hubert Garavel, John Hatcliff:
TACAS 2003 Special Issue - Preface. 169-172 - Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar:
On the universal and existential fragments of the mu-calculus. 173-186 - Sylvain Conchon, Sava Krstic:
Strategies for combining decision procedures. 187-210 - Samik Basu, C. R. Ramakrishnan:
Compositional analysis for verification of parameterized systems. 211-229 - Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular strategies for recursive game graphs. 230-249 - Rajeev Alur, Thao Dang, Franjo Ivancic:
Counterexample-guided predicate abstraction of hybrid systems. 250-271 - Yasmina Abdeddaïm, Eugene Asarin, Oded Maler:
Scheduling with timed automata. 272-300 - Elena Fersman, Leonid Mokrushin, Paul Pettersson, Wang Yi:
Schedulability analysis of fixed-priority systems using timed automata. 301-317
Volume 354, Number 3, 4 April 2006
- Andrzej Lingas, Leszek Gasieniec:
Preface. 319 - Miroslav Chlebík, Janka Chlebíková:
Complexity of approximating bounded variants of optimization problems. 320-338 - Takao Asano:
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT. 339-353 - Grzegorz Stachowiak:
Fast periodic correction networks. 354-366 - Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive exploration of rectilinear polygons. 367-378 - John H. Reif, Zheng Sun:
On boundaries of highly visible spaces and applications. 379-390 - Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N. V. Vinodchandran:
Computational depth: Concept and applications. 391-404 - Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations preserving regular languages. 405-420 - Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Compositionality of Hennessy-Milner logic by structural operational semantics. 421-440
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-02-20 19:43 CET 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:
