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=211
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Operational and denotational semantics for the box algebra
Maciej Koutny
,
Eike Best
Theoretical Computer Science
211
(1-2), 1999, pp. 1-83
The timed failures - Stability model for CSP
G.M. Reed
,
A.W. Roscoe
Theoretical Computer Science
211
(1-2), 1999, pp. 85-127
Representing scope in intuitionistic deductions
Matthew Stone
Theoretical Computer Science
211
(1-2), 1999, pp. 129-188
An algebraic generalization of Frege structures - Binding algebras
Yong Sun
Theoretical Computer Science
211
(1-2), 1999, pp. 189-232
From constructivism to computer science
A.S. Troelstra
Theoretical Computer Science
211
(1-2), 1999, pp. 233-252
Event-clock automata: A determinizable class of timed automata
Rajeev Alur
,
Limor Fix
,
Thomas A. Henzinger
Theoretical Computer Science
211
(1-2), 1999, pp. 253-273
Compositionality properties of
SLD
-derivations
Marco Comini
,
Maria Chiara Meo
Theoretical Computer Science
211
(1-2), 1999, pp. 275-309
Multisets and structural congruence of the pi-calculus with replication
Joost Engelfriet
,
Tjalling Gelsema
Theoretical Computer Science
211
(1-2), 1999, pp. 311-337
A complete equational axiomatization for MPA with string iteration
Luca Aceto
,
Jan Friso Groote
Theoretical Computer Science
211
(1-2), 1999, pp. 339-374
Explicit substitution - On the edge of strong normalization
Roel Bloo
,
Herman Geuvers
Theoretical Computer Science
211
(1-2), 1999, pp. 375-395