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: Author="Asperti, Andrea"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
(Optimal) duplication is not elementary recursive
Andrea Asperti
,
Paolo Coppola
,
Simone Martini
Information and Computation
193
(1), 2004, pp. 21-56
Parallel beta reduction is not elementary recursive
Andrea Asperti
,
Harry G. Mairson
Information and Computation
170
(1), 2001, pp. 49-80
On the dynamics of sharing graphs
Andrea Asperti
,
Cosimo Laneve
Lecture Notes in Computer Science
1256
, 1997, pp. 259-269
Interaction systems II: The practice of optimal reductions
Andrea Asperti
,
Cosimo Laneve
Theoretical Computer Science
159
(2), 1996, pp. 191-244
Paths, computations and labels in the
\lambda
-calculus
Andrea Asperti
,
Cosimo Laneve
Theoretical Computer Science
142
(2), 1995, pp. 277-297
Categorical models of polymorphism
Andrea Asperti
,
Simone Martini
Information and Computation
99
(1), 1992, July, pp. 1-79
Stability and computability in coherent domains
Andrea Asperti
Information and Computation
86
(2), 1990, pp. 115-139