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=189
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fixed point characterization of infinite behavior of finite-state systems
Damian Niwiński
Theoretical Computer Science
189
(1-2), 1997, pp. 1-69
Formal validation of data-parallel programs: A two-component assertional proof system for a simple language
Luc Bougé
,
David Cachera
,
Yann le Guyadec
,
Gil Utard
,
Bernard Virot
Theoretical Computer Science
189
(1-2), 1997, pp. 71-107
Fairness and control in multi-agent systems
Hans-Dieter Burkhard
Theoretical Computer Science
189
(1-2), 1997, pp. 109-127
Abduction from logic programs: Semantics and complexity
Thomas Eiter
,
Georg Gottlob
,
Nicola Leone
Theoretical Computer Science
189
(1-2), 1997, pp. 129-177
A process algebra of communicating shared resources with dense time and priorities
Patrice Brémond-Grégoire
,
Insup Lee
Theoretical Computer Science
189
(1-2), 1997, pp. 179-219
c
\beta
-machine with
\lambda\beta
-reduction
Mohamed Mezghiche
Theoretical Computer Science
189
(1-2), 1997, pp. 221-228
On the rational behaviors of concurrent timers
Anne Bergeron
Theoretical Computer Science
189
(1-2), 1997, pp. 229-237
On the complexity of specification morphisms
Serafino Cicerone
,
Francesco Parisi-Presicce
Theoretical Computer Science
189
(1-2), 1997, pp. 239-248