Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=354
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Easiness in graph models
C. Berline
,
A. Salibra
Theoretical Computer Science
354
(1), 2006, pp. 4-23
Uniqueness logic
Dana Harrington
Theoretical Computer Science
354
(1), 2006, pp. 24-41
CSP-CASL - A new integration of process algebra and algebraic specification
Markus Roggenbach
Theoretical Computer Science
354
(1), 2006, pp. 42-71
Efficient transitive closure of sparse matrices over closed semirings
Gerald Penn
Theoretical Computer Science
354
(1), 2006, pp. 72-81
Closure properties of linear context-free tree languages with an application to optimality theory
Stephan Kepser
,
Uwe Mönnich
Theoretical Computer Science
354
(1), 2006, pp. 82-97
Metaphors and heuristic-driven theory projection (HDTP)
Helmar Gust
,
Kai-Uwe Kühnberger
,
Ute Schmid
Theoretical Computer Science
354
(1), 2006, pp. 98-117
Generating all permutations by context-free grammars in Chomsky normal form
Peter R.J. Asveld
Theoretical Computer Science
354
(1), 2006, pp. 118-130
Partial algebras, meaning categories and algebraization
Marcus Kracht
Theoretical Computer Science
354
(1), 2006, pp. 131-141
Sorted dependency insertion grammars
Radu Gramatovici
,
Carlos Martín-Vide
Theoretical Computer Science
354
(1), 2006, pp. 142-152
Refinement calculus: A basis for translation validation, debugging and certification
Rohit N. Kundaji
,
R.K. Shyamasundar
Theoretical Computer Science
354
(1), 2006, pp. 153-168
On the universal and existential fragments of the
\mu
-calculus
Thomas A. Henzinger
,
Orna Kupferman
,
Rupak Majumdar
Theoretical Computer Science
354
(2), 2006, pp. 173-186
Strategies for combining decision procedures
Sylvain Conchon
,
Sava Krstić
Theoretical Computer Science
354
(2), 2006, pp. 187-210
Compositional analysis for verification of parameterized systems
Samik Basu
,
C.R. Ramakrishnan
Theoretical Computer Science
354
(2), 2006, pp. 211-229
Modular strategies for recursive game graphs
Rajeev Alur
,
Salvatore La Torre
,
P. Madhusudan
Theoretical Computer Science
354
(2), 2006, pp. 230-249
Counterexample-guided predicate abstraction of hybrid systems
Rajeev Alur
,
Thao Dang
,
Franjo Ivanc̑ić
Theoretical Computer Science
354
(2), 2006, pp. 250-271
Scheduling with timed automata
Yasmina Abdeddaïm
,
Eugene Asarin
,
Oded Maler
Theoretical Computer Science
354
(2), 2006, pp. 272-300
Schedulability analysis of fixed-priority systems using timed automata
Elena Fersman
,
Leonid Mokrushin
,
Paul Pettersson
,
Wang Yi
Theoretical Computer Science
354
(2), 2006, pp. 301-317
Complexity of approximating bounded variants of optimization problems
Miroslav Chlebik
,
Janka Chlebíková
Theoretical Computer Science
354
(3), 2006, pp. 320-338
An improved analysis of Goemans and Williamson's
LP
-relaxation for MAX SAT
Takao Asano
Theoretical Computer Science
354
(3), 2006, pp. 339-353
Fast periodic correction networks
Grzegorz Stachowiak
Theoretical Computer Science
354
(3), 2006, pp. 354-366
Competitive exploration of rectilinear polygons
Mikael Hammar
,
Bengt J. Nilsson
,
Mia Persson
Theoretical Computer Science
354
(3), 2006, pp. 367-378
On boundaries of highly visible spaces and applications
John H. Reif
,
Zheng Sun
Theoretical Computer Science
354
(3), 2006, pp. 379-390
Computational depth: Concept and applications
Luis Antunes
,
Lance Fortnow
,
Dieter van Melkebeek
,
N.V. Vinodchandran
Theoretical Computer Science
354
(3), 2006, pp. 391-404
Operations preserving regular languages
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Bruno Petazzoni
,
Jean-Eric Pin
Theoretical Computer Science
354
(3), 2006, pp. 405-420
Compositionality of Hennessy-Milner logic by structural operational semantics
Wan Fokkink
,
Rob van Glabbeek
,
Paulien de Wind
Theoretical Computer Science
354
(3), 2006, pp. 421-440