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=247
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Asynchronous cellular automata for pomsets
Manfred Droste
,
Paul Gastin
,
Dietrich Kuske
Theoretical Computer Science
247
(1-2), 2000, pp. 1-38
Parallel and serial hypercoherences
Thomas Ehrhard
Theoretical Computer Science
247
(1-2), 2000, pp. 39-81
Interaction nets for linear logic
Ian Mackie
Theoretical Computer Science
247
(1-2), 2000, pp. 83-140
Detecting equivalence of modular specifications with categorical diagrams
Catherine Oriat
Theoretical Computer Science
247
(1-2), 2000, pp. 141-190
Some first-order probability logics
Zoran Ognjanovic
,
Miodrag Ras̑kovic
Theoretical Computer Science
247
(1-2), 2000, pp. 191-212
On the total
_k
-diameter of connection networks
Yefim Dinitz
,
Tamar Eilam
,
Shlomo Moran
,
Shmuel Zaks
Theoretical Computer Science
247
(1-2), 2000, pp. 213-228
Domain representations of topological spaces
Jens Blanck
Theoretical Computer Science
247
(1-2), 2000, pp. 229-255
Semantic distance between specifications
Rym Mili
,
Jules Desharnais
,
Marc Frappier
,
Ali Mili
Theoretical Computer Science
247
(1-2), 2000, pp. 257-276
On principal types of combinators
Sabine Broda
,
Luís Damas
Theoretical Computer Science
247
(1-2), 2000, pp. 277-290
A generalization of Nundorf's fixpoint theorem
Wim H. Hesselink
Theoretical Computer Science
247
(1-2), 2000, pp. 291-296