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=Inf.~Comput. AND Volume=89
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Type inference for polymorphic references
Mads Tofte
Information and Computation
89
(1), 1990, pp. 1-34
A characterization of lambda definable tree operations
Marek Zaionc
Information and Computation
89
(1), 1990, pp. 35-46
Creating order in sequence spaces with simple machines
Rudolf Ahlswede
,
Jian-Ping Ye
,
Zhen Zhang
Information and Computation
89
(1), 1990, pp. 47-94
Inductive definitions over finite structures
Daniel Leivant
Information and Computation
89
(2), 1990, December, pp. 95-108
Non-uniform automata over groups
David A. Mix Barrington
,
Howard Straubing
,
Denis Thérien
Information and Computation
89
(2), 1990, December, pp. 109-132
Turing machines with access to history
Bogdan S. Chlebus
Information and Computation
89
(2), 1990, December, pp. 133-143
Reduction and covering of infinite reachability trees
Alain Finkel
Information and Computation
89
(2), 1990, December, pp. 144-179
Efficient solution of some problems in free partially commutative monoids
Hai-Ning Liu
,
C. Wrathall
,
Kenneth Zeger
Information and Computation
89
(2), 1990, December, pp. 180-198