Andrea Asperti

ORCID

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 33

Top Venues

Publications

X. Angelo Huang, Emanuele La Malfa, Samuele Marro, Andrea Asperti, Anthony G. Cohn, Michael Wooldridge
A Notion of Complexity for Theory of Mind via Discrete World Models. CoRR (2024)
Andrea Asperti, Salvatore Fiorilla, Lorenzo Orsini
A Generative Approach to Person Reidentification. Sensors 24 (4) (2024)
Fabio Merizzi, Andrea Asperti, Stefano Colamonaco
Wind speed super-resolution and validation: from ERA5 to CERRA via diffusion models. CoRR (2024)
Andrea Asperti, Gabriele Colasuonno, Antonio Guerra
Head Rotation in Denoising Diffusion Models. CoRR (2023)
Andrea Asperti, Valerio Tonelli
Comparing the latent space of generative models. Neural Comput. Appl. 35 (4) (2023)
Andrea Asperti, Fabio Merizzi, Alberto Paparella, Giorgio Pedrazzi, Matteo Angelinelli, Stefano Colamonaco
Precipitation nowcasting with generative diffusion models. CoRR (2023)
Andrea Asperti, Daniele Filippini
Deep Learning for Head Pose Estimation: A Survey. SN Comput. Sci. 4 (4) (2023)
Andrea Asperti, Davide Evangelista, Samuele Marro, Fabio Merizzi
Image Embedding for Denoising Generative Models. CoRR (2023)
Andrea Asperti, Davide Evangelista, Samuele Marro, Fabio Merizzi
Image embedding for denoising generative models. Artif. Intell. Rev. 56 (12) (2023)
Andrea Asperti, Marco Del Brutto
MicroRacer: a didactic environment for Deep Reinforcement Learning. CoRR (2022)
Andrea Asperti, Marco Del Brutto
MicroRacer: A Didactic Environment for Deep Reinforcement Learning. LOD (1) (2022)
Andrea Asperti, Laura Bugo, Daniele Filippini
Enhancing variational generation through self-decomposition. CoRR (2022)
Andrea Asperti, Valerio Tonelli
Comparing the latent space of generative models. CoRR (2022)
Andrea Asperti, Laura Bugo, Daniele Filippini
Enhancing Variational Generation Through Self-Decomposition. IEEE Access 10 (2022)
Andrea Asperti, Davide Evangelista, Moreno Marzolla
Dissecting FLOPs Along Input Dimensions for GreenAI Cost Estimations. LOD (2021)
Andrea Asperti, Davide Evangelista, Elena Loli Piccolomini
A Survey on Variational Autoencoders from a Green AI Perspective. SN Comput. Sci. 2 (4) (2021)
Andrea Asperti, Davide Evangelista, Moreno Marzolla
Dissecting FLOPs along input dimensions for GreenAI cost estimations. CoRR (2021)
Andrea Asperti, Davide Evangelista, Elena Loli Piccolomini
A survey on Variational Autoencoders from a GreenAI perspective. CoRR (2021)
Andrea Asperti, Stefano Dal Bianco
Syllabification of the Divine Comedy. ACM Journal on Computing and Cultural Heritage 14 (3) (2021)
Andrea Asperti
Variance Loss in Variational Autoencoders. LOD (1) (2020)
Andrea Asperti, Stefano Dal Bianco
Syllabification of the Divine Comedy. CoRR (2020)
Andrea Asperti, Matteo Trentin
Balancing reconstruction error and Kullback-Leibler divergence in Variational Autoencoders. CoRR (2020)
Andrea Asperti, Daniele Cortesi, Carlo De Pieri, Gianmaria Pedrini, Francesco Sovrano
Crawling in Rogue's Dungeons With Deep Reinforcement Techniques. IEEE Trans. Games 12 (2) (2020)
Andrea Asperti, Matteo Trentin
Balancing Reconstruction Error and Kullback-Leibler Divergence in Variational Autoencoders. IEEE Access 8 (2020)
Andrea Asperti
Variance Loss in Variational Autoencoders. CoRR (2020)
Andrea Asperti
About Generative Aspects of Variational Autoencoders. LOD (2019)
Andrea Asperti, Claudio Mastronardo
The Effectiveness of Data Augmentation for Detection of Gastrointestinal Diseases from Endoscopical Images. BIOIMAGING (2018)
Andrea Asperti, Daniele Cortesi, Francesco Sovrano
Crawling in Rogue's dungeons with (partitioned) A3C. CoRR (2018)
Andrea Asperti, Daniele Cortesi, Francesco Sovrano
Crawling in Rogue's Dungeons with (Partitioned) A3C. LOD (2018)
Andrea Asperti
Sparsity in Variational Autoencoders. CoRR (2018)
Andrea Asperti
About the efficient reduction of lambda terms. CoRR (2017)
Andrea Asperti, Claudio Mastronardo
The Effectiveness of Data Augmentation for Detection of Gastrointestinal Diseases from Endoscopical Images. CoRR (2017)
Andrea Asperti
Automatic verification and interactive theorem proving. CoRR (2017)
Andrea Asperti
The Speedup Theorem in a Primitive Recursive Framework. CPP (2015)
Andrea Asperti
Computational Complexity Via Finite Types. ACM Trans. Comput. Log. 16 (3) (2015)
Andrea Asperti
Reverse Complexity. J. Autom. Reason. 55 (4) (2015)
Andrea Asperti, Wilmer Ricciotti
A formalization of multi-tape Turing machines. Theor. Comput. Sci. 603 (2015)
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen
Matita Tutorial. J. Formaliz. Reason. 7 (2) (2014)
Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, François Garillot, Stéphane Le Roux, Assia Mahboubi, Russell O'Connor, Sidi Ould Biha, Ioana Pasca, Laurence Rideau, Alexey Solovyev, Enrico Tassi, Laurent Théry
A Machine-Checked Proof of the Odd Order Theorem. ITP (2013)
Andrea Asperti
A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem. CPP (2013)
Andrea Asperti, Jean-Jacques Lévy
The Cost of Usage in the Lambda-Calculus. LICS (2013)
Andrea Asperti, Wilmer Ricciotti
A proof of Bertrand's postulate. J. Formaliz. Reason. 5 (1) (2012)
Andrea Asperti
A Compact Proof of Decidability for Regular Expression Equivalence. ITP (2012)
Andrea Asperti, Wilmer Ricciotti
A Web Interface for Matita CoRR (2012)
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover. J. Autom. Reason. 49 (3) (2012)
Andrea Asperti, Ferruccio Guidi
Type systems for dummies. TLDI (2012)
Andrea Asperti
Proof, Message and Certificate. AISC/MKM/Calculemus (2012)
Andrea Asperti, Wilmer Ricciotti
Rating Disambiguation Errors. CPP (2012)
Andrea Asperti, Wilmer Ricciotti
A Web Interface for Matita. AISC/MKM/Calculemus (2012)
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions Log. Methods Comput. Sci. 8 (1) (2012)
Andrea Asperti, Wilmer Ricciotti
Formalizing Turing Machines. WoLLIC (2012)
Andrea Asperti, Maria Emilia Maietti, Claudio Sacerdoti Coen, Giovanni Sambin, Silvio Valentini
Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita. Calculemus/MKM (2011)
Andrea Asperti, Jeremy Avigad
Zen and the art of formalisation. Math. Struct. Comput. Sci. 21 (4) (2011)
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
The Matita Interactive Theorem Prover. CADE (2011)
R. Armadio, Andrea Asperti, Nicholas Ayache, Brian Campbell, Dominic P. Mulligan, Randy Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, Ian Stark
Certified Complexity. FET (2011)
Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi
Regular Expressions, au point CoRR (2010)
Andrea Asperti, Enrico Tassi
Smart Matching. AISC/MKM/Calculemus (2010)
Andrea Asperti, Claudio Sacerdoti Coen
Some Considerations on the Usability of Interactive Provers. AISC/MKM/Calculemus (2010)
Andrea Asperti, Enrico Tassi
Smart matching CoRR (2010)
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
Hints in Unification. TPHOLs (2009)
Andrea Asperti, Herman Geuvers, Raja Natarajan
Social processes, program verification and all that. Math. Struct. Comput. Sci. 19 (5) (2009)
Andrea Asperti, Enrico Tassi
An Interactive Driver for Goal-directed Proof Strategies. Electron. Notes Theor. Comput. Sci. 226 (2009)
Andrea Asperti, Nadia Busi
Mobile Petri nets. Math. Struct. Comput. Sci. 19 (6) (2009)
Roberto M. Amadio, Giuseppe Castagna, Andrea Asperti
Preface. Inf. Comput. 207 (5) (2009)
Andrea Asperti, Enrico Tassi
Superposition as a logical glue TYPES (2009)
Andrea Asperti, Wilmer Ricciotti
About the Formalization of Some Results by Chebyshev in Number Theory. TYPES (2008)
Andrea Asperti, Cristian Armentano
A Page in Number Theory. J. Formaliz. Reason. 1 (1) (2008)
Andrea Asperti
The intensional content of Rice's theorem. POPL (2008)
Andrea Asperti, Enrico Tassi
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. Calculemus/MKM (2007)
Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
User Interaction with the Matita Proof Assistant. J. Autom. Reason. 39 (2) (2007)
Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
Crafting a Proof Assistant. TYPES (2006)
Andrea Asperti, Herman Geuvers, Iris Loeb, Lionel Elie Mamane, Claudio Sacerdoti Coen
An Interactive Algebra Course with Formalised Proofs and Definitions. MKM (2005)
Andrea Asperti, Paolo Coppola, Simone Martini
(Optimal) duplication is not elementary recursive. Inf. Comput. 193 (1) (2004)
Andrea Asperti, Matteo Selmi
Efficient Retrieval of Mathematical Statements. MKM (2004)
Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli
A Content Based Mathematical Search Engine: Whelp. TYPES (2004)
Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Ferruccio Guidi, Irene Schena
Mathematical Knowledge Management in HELM. Ann. Math. Artif. Intell. 38 (1-3) (2003)
Andrea Asperti, Bernd Wegner
MOWGLI - An Approach to Machine-Understandable Representation of the Mathematical Information in Digital Documents. Electronic Information and Communication in Mathematics (2002)
Andrea Asperti, Luca Roversi
Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. 3 (1) (2002)
Andrea Asperti, Harry G. Mairson
Parallel Beta Reduction Is Not Elementary Recursive. Inf. Comput. 170 (1) (2001)
Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena
HELM and the Semantic Math-Web. TPHOLs (2001)
Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena
XML, Stylesheets and the Re-mathematization of Formal Content. Extreme Markup Languages® (2001)
Andrea Asperti, Luca Roversi
Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness) CoRR (2000)
Andrea Asperti, Paolo Coppola, Simone Martini
(Optimal) Duplication is not Elementary Recursive. POPL (2000)
Andrea Asperti
Light Affine Logic. LICS (1998)
Andrea Asperti, Harry G. Mairson
Parallel Beta Reduction is not Elementary Recursive. POPL (1998)
Andrea Asperti
Optimal Reduction of Functional Expressions. PLILP/ALP (1998)
Andrea Asperti, Cosimo Laneve
On the Dynamics of Sharing Graphs. ICALP (1997)
Andrea Asperti, Juliusz Chroboczek
Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations - Optimizing Optimal lambda-Calculus Implementations. Appl. Algebra Eng. Commun. Comput. 8 (6) (1997)
Andrea Asperti, Agata Ciabattoni
A Sufficient Condition for Completability of Partial Combinatory Algebras. J. Symb. Log. 62 (4) (1997)
Andrea Asperti, Cosimo Laneve
Interaction Systems II: The Practice of Optimal Reductions. Theor. Comput. Sci. 159 (2) (1996)
Andrea Asperti
On the Complexity of Beta-Reduction. POPL (1996)
Andrea Asperti, Cecilia Giovanetti, Andrea Naletto
The Bologna Optimal Higher-Order Machine. J. Funct. Program. 6 (6) (1996)
Andrea Asperti
Linear Logic, Comonads and Optimal Reduction. Fundam. Informaticae 22 (1/2) (1995)
Andrea Asperti, Cosimo Laneve
Comparing Lambda-calculus translations in Sharing Graphs. TLCA (1995)
Andrea Asperti
-Calculus Implementations. RTA (1995)
Andrea Asperti, Cosimo Laneve
Paths, Computations and Labels in the lambda-Calculus. Theor. Comput. Sci. 142 (2) (1995)
Andrea Asperti, Agata Ciabattoni
Effective Applicative Structures. Category Theory and Computer Science (1995)
Andrea Asperti
Causal Dependencies in Multiplicative Linear Logic with MIX. Math. Struct. Comput. Sci. 5 (3) (1995)
Andrea Asperti, Cosimo Laneve
Interaction Systems I: The Theory of Optimal Reductions. Math. Struct. Comput. Sci. 4 (4) (1994)
Andrea Asperti, Giovanna M. Dore
Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. LFCS (1994)

Andrea Asperti.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrea Asperti