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=222
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A specification structure for deadlock-freedom of synchronous processes
S. Abramskky
,
S.J. Gay
,
R. Nagarajan
Theoretical Computer Science
222
(1-2), 1999, pp. 1-53
On arithmetical first-order theories allowing encoding and decoding of lists
Patrick Cegielski
,
Denis Richard
Theoretical Computer Science
222
(1-2), 1999, pp. 55-75
The powerset operator on abstract interpretations
Gilberto Filé
,
Francesco Ranzato
Theoretical Computer Science
222
(1-2), 1999, pp. 77-111
Optimal transmission schedules for lightwave networks embedded with de Bruijn graphs
Feng Cao
,
Al Borchers
Theoretical Computer Science
222
(1-2), 1999, pp. 113-131
Monadic simultaneous rigid
E
-unification
Yuri Gurevich
,
Andrei Voronkov
Theoretical Computer Science
222
(1-2), 1999, pp. 133-152
Design of abstract domains using first-order logic
Elena Marchiori
Theoretical Computer Science
222
(1-2), 1999, pp. 153-179
On diagonal fixed points of increasing functions
Loïc Colson
Theoretical Computer Science
222
(1-2), 1999, pp. 181-186
A polynomial
\lambda
-bisimilar normalization for reset Petri nets
Catherine Dufourd
,
Alain Finkel
Theoretical Computer Science
222
(1-2), 1999, pp. 187-194