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=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A theory for nondeterminism, parallelism, communication, and concurrency
M. Broy
Theoretical Computer Science
45
(1), 1986, pp. 1-61
Transducers and repetitions
M. Crochemore
Theoretical Computer Science
45
(1), 1986, pp. 63-86
Manipulating derivation forests by scheduling techniques
J. Gonczarowski
Theoretical Computer Science
45
(1), 1986, pp. 87-119
A characterization of F-complete type assignments
M. Dezani-Ciancaglini
,
I. Margaria
Theoretical Computer Science
45
(2), 1986, pp. 121-157
The system F of variable types, fifteen years later
J.-Y. Girard
Theoretical Computer Science
45
(2), 1986, pp. 159-192
Merging regular processes by means of fixed-point theory
J.-J.Ch. Meyer
Theoretical Computer Science
45
(2), 1986, pp. 193-260
Reachability trees for high-level Petri nets
P. Huber
,
A.M. Jensen
,
L.O. Jepsen
,
K. Jensen
Theoretical Computer Science
45
(3), 1986, pp. 261-292
An algebraic semantics approach to the effective resolution of type equations
H. Ait-Kaci
Theoretical Computer Science
45
(3), 1986, pp. 293-351