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=254
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Structure theory of multi-level deterministically synchronized sequential processes
Laura Recalde
,
Enrique Teruel
,
Manuel Silva
Theoretical Computer Science
254
(1-2), 2001, pp. 1-33
A fully abstract denotational model for observational precongruence
Anna Ingólfsdóttir
,
Andrea Schalk
Theoretical Computer Science
254
(1-2), 2001, pp. 35-61
An ordinal measure based procedure for termination of functions
François Monin
,
Marianne Simonot
Theoretical Computer Science
254
(1-2), 2001, pp. 63-94
Quantales, finite observations and strong bisimulation
Pedro Resende
Theoretical Computer Science
254
(1-2), 2001, pp. 95-149
Subtractive logic
Tristan Crolard
Theoretical Computer Science
254
(1-2), 2001, pp. 151-185
Automata driven efficient subterm unification
R. Ramesh
,
I.V. Ramakrishnan
,
R.C. Sekar
Theoretical Computer Science
254
(1-2), 2001, pp. 187-223
Testing timed automata
Jan Springintveld
,
Frits Vaandrager
,
Pedro R. D'Argenio
Theoretical Computer Science
254
(1-2), 2001, pp. 225-257
Completeness, minimal logic and programs extraction
Christophe Raffalli
Theoretical Computer Science
254
(1-2), 2001, pp. 259-271
\exists
-universal termination of logic programs
Salvatore Ruggieri
Theoretical Computer Science
254
(1-2), 2001, pp. 273-296
Genuine atomic multicast in asynchronous distributed systems
Rachid Guerraoui
,
André Schiper
Theoretical Computer Science
254
(1-2), 2001, pp. 297-316
Parsing MELL proof nets
Stefano Guerini
,
Andrea Masini
Theoretical Computer Science
254
(1-2), 2001, pp. 317-335
Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
Xiao Jun Chen
,
Rocco de Nicola
Theoretical Computer Science
254
(1-2), 2001, pp. 337-361
Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
Jan van den Bussche
Theoretical Computer Science
254
(1-2), 2001, pp. 363-377
Fast asynchronous systems in dense time
Lars Jenner
,
Walter Vogler
Theoretical Computer Science
254
(1-2), 2001, pp. 379-422
On the expressiveness of linear-constraint query languages for spatial databases
Luc Vandeurzen
,
Marc Gyssens
,
Dirk Van Gucht
Theoretical Computer Science
254
(1-2), 2001, pp. 423-463
The limits of fixed-order computations
Konstantinos Sagonas
,
Terrance Swift
,
David S. Warren
Theoretical Computer Science
254
(1-2), 2001, pp. 465-499
Metric semantics for true concurrent real time
Joost-Pieter Katoen
,
Christel Baier
,
Diego Latella
Theoretical Computer Science
254
(1-2), 2001, pp. 501-542
Completeness of a relational calculus for program schemes
Marcelo F. Frias
,
Roger D. Maddux
Theoretical Computer Science
254
(1-2), 2001, pp. 543-556
A fully abstract denotational semantics for the calculus of higher-order communicating systems
B. Thomsen
,
S. Abramsky
Theoretical Computer Science
254
(1-2), 2001, pp. 557-589
Regular database update logics
Paul Spruit
,
Roel Wieringa
,
John-Jules Meyer
Theoretical Computer Science
254
(1-2), 2001, pp. 591-661
Stratified negation in temporal logic programming and the cycle-sum test
P. Rondogiannis
Theoretical Computer Science
254
(1-2), 2001, pp. 663-676
How to normalize the Jay
Dieter Probst
,
Thomas Studer
Theoretical Computer Science
254
(1-2), 2001, pp. 677-681
Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
Mark Levene
,
George Loizou
Theoretical Computer Science
254
(1-2), 2001, pp. 683-690