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=145
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decidability of the finiteness of ranges of tree transductions
Frank Drewes
,
Joost Engelfriet
Information and Computation
145
(1), 1998, pp. 1-50
On number systems with finite degree of ambiguity
Juha Honkala
Information and Computation
145
(1), 1998, pp. 51-63
Full abstractness for a functional/concurrent language with higher-order value-passing
Chrysafis Hartonas
,
Matthew Hennessy
Information and Computation
145
(1), 1998, pp. 64-106
Structural induction and coinduction in a fibrational setting
Claudio Hermida
,
Bart Jacobs
Information and Computation
145
(2), 1998, pp. 107-152
Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
Roberto Giacobazzi
,
Francesco Ranzato
Information and Computation
145
(2), 1998, pp. 153-190
On performance congruences for process algebras
Flavio Corradini
Information and Computation
145
(2), 1998, pp. 191-230