default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Asperti
Person information
- affiliation: University of Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j37]Andrea Asperti
, Salvatore Fiorilla, Lorenzo Orsini:
A Generative Approach to Person Reidentification. Sensors 24(4): 1240 (2024)- [c56]X. Angelo Huang, Emanuele La Malfa, Samuele Marro, Andrea Asperti, Anthony G. Cohn, Michael J. Wooldridge:
A Notion of Complexity for Theory of Mind via Discrete World Models. EMNLP (Findings) 2024: 2964-2983 - [i22]Fabio Merizzi, Andrea Asperti, Stefano Colamonaco:
Wind speed super-resolution and validation: from ERA5 to CERRA via diffusion models. CoRR abs/2401.15469 (2024) - [i21]X. Angelo Huang, Emanuele La Malfa, Samuele Marro, Andrea Asperti, Anthony G. Cohn, Michael J. Wooldridge:
A Notion of Complexity for Theory of Mind via Discrete World Models. CoRR abs/2406.11911 (2024) - 2023
- [j36]Andrea Asperti, Davide Evangelista, Samuele Marro, Fabio Merizzi:
Image embedding for denoising generative models. Artif. Intell. Rev. 56(12): 14511-14533 (2023) - [j35]Andrea Asperti, Valerio Tonelli:
Comparing the latent space of generative models. Neural Comput. Appl. 35(4): 3155-3172 (2023) - [j34]Andrea Asperti, Daniele Filippini:
Deep Learning for Head Pose Estimation: A Survey. SN Comput. Sci. 4(4): 349 (2023) - [i20]Andrea Asperti, Davide Evangelista, Samuele Marro, Fabio Merizzi:
Image Embedding for Denoising Generative Models. CoRR abs/2301.07485 (2023) - [i19]Andrea Asperti, Gabriele Colasuonno, Antonio Guerra:
Head Rotation in Denoising Diffusion Models. CoRR abs/2308.06057 (2023) - [i18]Andrea Asperti, Fabio Merizzi, Alberto Paparella, Giorgio Pedrazzi, Matteo Angelinelli, Stefano Colamonaco:
Precipitation nowcasting with generative diffusion models. CoRR abs/2308.06733 (2023) - 2022
- [j33]Andrea Asperti, Laura Bugo, Daniele Filippini:
Enhancing Variational Generation Through Self-Decomposition. IEEE Access 10: 67510-67520 (2022) - [c55]Andrea Asperti, Marco Del Brutto:
MicroRacer: A Didactic Environment for Deep Reinforcement Learning. LOD (1) 2022: 239-252 - [i17]Andrea Asperti, Laura Bugo, Daniele Filippini:
Enhancing variational generation through self-decomposition. CoRR abs/2202.02738 (2022) - [i16]Andrea Asperti, Marco Del Brutto:
MicroRacer: a didactic environment for Deep Reinforcement Learning. CoRR abs/2203.10494 (2022) - [i15]Andrea Asperti, Valerio Tonelli:
Comparing the latent space of generative models. CoRR abs/2207.06812 (2022) - 2021
- [j32]Andrea Asperti, Stefano Dal Bianco:
Syllabification of the Divine Comedy. ACM Journal on Computing and Cultural Heritage 14(3): 27:1-27:26 (2021) - [j31]Andrea Asperti, Davide Evangelista, Elena Loli Piccolomini:
A Survey on Variational Autoencoders from a Green AI Perspective. SN Comput. Sci. 2(4): 301 (2021) - [c54]Andrea Asperti, Davide Evangelista, Moreno Marzolla:
Dissecting FLOPs Along Input Dimensions for GreenAI Cost Estimations. LOD 2021: 86-100 - [i14]Andrea Asperti, Davide Evangelista, Elena Loli Piccolomini:
A survey on Variational Autoencoders from a GreenAI perspective. CoRR abs/2103.01071 (2021) - [i13]Andrea Asperti, Davide Evangelista, Moreno Marzolla:
Dissecting FLOPs along input dimensions for GreenAI cost estimations. CoRR abs/2107.11949 (2021) - 2020
- [j30]Andrea Asperti, Matteo Trentin:
Balancing Reconstruction Error and Kullback-Leibler Divergence in Variational Autoencoders. IEEE Access 8: 199440-199448 (2020) - [j29]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): 177-186 (2020) - [c53]Andrea Asperti:
Variance Loss in Variational Autoencoders. LOD (1) 2020: 297-308 - [i12]Andrea Asperti, Matteo Trentin:
Balancing reconstruction error and Kullback-Leibler divergence in Variational Autoencoders. CoRR abs/2002.07514 (2020) - [i11]Andrea Asperti:
Variance Loss in Variational Autoencoders. CoRR abs/2002.09860 (2020) - [i10]Andrea Asperti, Stefano Dal Bianco:
Syllabification of the Divine Comedy. CoRR abs/2010.13515 (2020)
2010 – 2019
- 2019
- [c52]Andrea Asperti:
About Generative Aspects of Variational Autoencoders. LOD 2019: 71-82 - 2018
- [c51]Andrea Asperti, Claudio Mastronardo:
The Effectiveness of Data Augmentation for Detection of Gastrointestinal Diseases from Endoscopical Images. BIOIMAGING 2018: 199-205 - [c50]Andrea Asperti, Daniele Cortesi, Francesco Sovrano:
Crawling in Rogue's Dungeons with (Partitioned) A3C. LOD 2018: 264-275 - [i9]Andrea Asperti, Daniele Cortesi, Francesco Sovrano:
Crawling in Rogue's dungeons with (partitioned) A3C. CoRR abs/1804.08685 (2018) - [i8]Andrea Asperti:
Sparsity in Variational Autoencoders. CoRR abs/1812.07238 (2018) - 2017
- [i7]Andrea Asperti:
Automatic verification and interactive theorem proving. CoRR abs/1701.03602 (2017) - [i6]Andrea Asperti:
About the efficient reduction of lambda terms. CoRR abs/1701.04240 (2017) - [i5]Andrea Asperti, Claudio Mastronardo:
The Effectiveness of Data Augmentation for Detection of Gastrointestinal Diseases from Endoscopical Images. CoRR abs/1712.03689 (2017) - 2015
- [j28]Andrea Asperti:
Reverse Complexity. J. Autom. Reason. 55(4): 373-388 (2015) - [j27]Andrea Asperti, Wilmer Ricciotti:
A formalization of multi-tape Turing machines. Theor. Comput. Sci. 603: 23-42 (2015) - [j26]Andrea Asperti:
Computational Complexity Via Finite Types. ACM Trans. Comput. Log. 16(3): 26:1-26:25 (2015) - [c49]Andrea Asperti:
The Speedup Theorem in a Primitive Recursive Framework. CPP 2015: 175-182 - 2014
- [j25]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen:
Matita Tutorial. J. Formaliz. Reason. 7(2): 91-199 (2014) - 2013
- [c48]Andrea Asperti:
A Formal Proof of Borodin-Trakhtenbrot's Gap Theorem. CPP 2013: 163-177 - [c47]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: 163-179 - [c46]Andrea Asperti, Jean-Jacques Lévy:
The Cost of Usage in the Lambda-Calculus. LICS 2013: 293-300 - 2012
- [j24]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) - [j23]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): 427-451 (2012) - [j22]Andrea Asperti, Wilmer Ricciotti:
A proof of Bertrand's postulate. J. Formaliz. Reason. 5(1): 37-57 (2012) - [c45]Andrea Asperti:
Proof, Message and Certificate. AISC/MKM/Calculemus 2012: 17-31 - [c44]Andrea Asperti, Wilmer Ricciotti:
A Web Interface for Matita. AISC/MKM/Calculemus 2012: 417-421 - [c43]Andrea Asperti, Wilmer Ricciotti:
Rating Disambiguation Errors. CPP 2012: 240-255 - [c42]Andrea Asperti:
A Compact Proof of Decidability for Regular Expression Equivalence. ITP 2012: 283-298 - [c41]Andrea Asperti, Ferruccio Guidi:
Type systems for dummies. TLDI 2012: 79-90 - [c40]Andrea Asperti, Wilmer Ricciotti:
Formalizing Turing Machines. WoLLIC 2012: 1-25 - [i4]Andrea Asperti, Wilmer Ricciotti:
A Web Interface for Matita. CoRR abs/1207.2892 (2012) - 2011
- [j21]Andrea Asperti, Jeremy Avigad:
Zen and the art of formalisation. Math. Struct. Comput. Sci. 21(4): 679-682 (2011) - [c39]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
The Matita Interactive Theorem Prover. CADE 2011: 64-69 - [c38]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: 278-280 - [c37]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: 175-177 - 2010
- [c36]Andrea Asperti, Claudio Sacerdoti Coen:
Some Considerations on the Usability of Interactive Provers. AISC/MKM/Calculemus 2010: 147-156 - [c35]Andrea Asperti, Enrico Tassi:
Smart Matching. AISC/MKM/Calculemus 2010: 263-277 - [i3]Andrea Asperti, Enrico Tassi:
Smart matching. CoRR abs/1005.0349 (2010) - [i2]Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi:
Regular Expressions, au point. CoRR abs/1010.2604 (2010)
2000 – 2009
- 2009
- [j20]Roberto M. Amadio, Giuseppe Castagna, Andrea Asperti:
Preface. Inf. Comput. 207(5): 543-544 (2009) - [j19]Andrea Asperti, Herman Geuvers, Raja Natarajan:
Social processes, program verification and all that. Math. Struct. Comput. Sci. 19(5): 877-896 (2009) - [j18]Andrea Asperti, Nadia Busi:
Mobile Petri nets. Math. Struct. Comput. Sci. 19(6): 1265-1278 (2009) - [c34]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
Hints in Unification. TPHOLs 2009: 84-98 - [c33]Andrea Asperti, Enrico Tassi:
Superposition as a logical glue. TYPES 2009: 1-15 - 2008
- [j17]Andrea Asperti, Cristian Armentano:
A Page in Number Theory. J. Formaliz. Reason. 1(1): 1-23 (2008) - [c32]Andrea Asperti:
The intensional content of Rice's theorem. POPL 2008: 113-119 - [c31]Andrea Asperti, Wilmer Ricciotti:
About the Formalization of Some Results by Chebyshev in Number Theory. TYPES 2008: 19-31 - [c30]Andrea Asperti, Enrico Tassi:
An Interactive Driver for Goal-directed Proof Strategies. UITP@TPHOLs 2008: 89-105 - 2007
- [j16]Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli:
User Interaction with the Matita Proof Assistant. J. Autom. Reason. 39(2): 109-139 (2007) - [c29]Andrea Asperti, Enrico Tassi:
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. Calculemus/MKM 2007: 146-160 - 2006
- [c28]Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli:
Crafting a Proof Assistant. TYPES 2006: 18-32 - 2005
- [c27]Andrea Asperti, Herman Geuvers, Iris Loeb, Lionel Elie Mamane, Claudio Sacerdoti Coen:
An Interactive Algebra Course with Formalised Proofs and Definitions. MKM 2005: 315-329 - 2004
- [j15]Andrea Asperti, Paolo Coppola, Simone Martini:
(Optimal) duplication is not elementary recursive. Inf. Comput. 193(1): 21-56 (2004) - [c26]Andrea Asperti, Matteo Selmi:
Efficient Retrieval of Mathematical Statements. MKM 2004: 17-31 - [c25]Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli:
A Content Based Mathematical Search Engine: Whelp. TYPES 2004: 17-32 - [e2]Andrea Asperti, Grzegorz Bancerek, Andrzej Trybulec:
Mathematical Knowledge Management, Third International Conference, MKM 2004, Bialowieza, Poland, September 19-21, 2004, Proceedings. Lecture Notes in Computer Science 3119, Springer 2004, ISBN 3-540-23029-7 [contents] - 2003
- [j14]Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Ferruccio Guidi, Irene Schena:
Mathematical Knowledge Management in HELM. Ann. Math. Artif. Intell. 38(1-3): 27-46 (2003) - [e1]Andrea Asperti, Bruno Buchberger, James H. Davenport:
Mathematical Knowledge Management, Second International Conference, MKM 2003, Bertinoro, Italy, February 16-18, 2003, Proceedings. Lecture Notes in Computer Science 2594, Springer 2003, ISBN 3-540-00568-4 [contents] - 2002
- [j13]Andrea Asperti, Luca Roversi:
Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. 3(1): 137-175 (2002) - [c24]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: 14-23 - 2001
- [j12]Andrea Asperti, Harry G. Mairson:
Parallel Beta Reduction Is Not Elementary Recursive. Inf. Comput. 170(1): 49-80 (2001) - [c23]Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena:
XML, Stylesheets and the Re-mathematization of Formal Content. Extreme Markup Languages® 2001 - [c22]Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena:
HELM and the Semantic Math-Web. TPHOLs 2001: 59-74 - 2000
- [c21]Andrea Asperti, Paolo Coppola, Simone Martini:
(Optimal) Duplication is not Elementary Recursive. POPL 2000: 96-107 - [i1]Andrea Asperti, Luca Roversi:
Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness). CoRR cs.LO/0006010 (2000)
1990 – 1999
- 1998
- [b2]Andrea Asperti, Stefano Guerrini:
The optimal implementation of functional programming languages. Cambridge tracts in theoretical computer science 45, Cambridge University Press 1998, ISBN 978-0-521-62112-0, pp. I-XI, 1-392 - [c20]Andrea Asperti:
Light Affine Logic. LICS 1998: 300-308 - [c19]Andrea Asperti:
Optimal Reduction of Functional Expressions. PLILP/ALP 1998: 427-428 - [c18]Andrea Asperti, Harry G. Mairson:
Parallel Beta Reduction is not Elementary Recursive. POPL 1998: 303-315 - 1997
- [j11]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): 437-468 (1997) - [j10]Andrea Asperti, Agata Ciabattoni:
A Sufficient Condition for Completability of Partial Combinatory Algebras. J. Symb. Log. 62(4): 1209-1214 (1997) - [c17]Andrea Asperti, Cosimo Laneve:
On the Dynamics of Sharing Graphs. ICALP 1997: 259-269 - 1996
- [j9]Andrea Asperti, Cecilia Giovanetti, Andrea Naletto:
The Bologna Optimal Higher-Order Machine. J. Funct. Program. 6(6): 763-810 (1996) - [j8]Andrea Asperti, Cosimo Laneve:
Interaction Systems II: The Practice of Optimal Reductions. Theor. Comput. Sci. 159(2): 191-244 (1996) - [c16]Andrea Asperti:
On the Complexity of Beta-Reduction. POPL 1996: 110-118 - 1995
- [j7]Andrea Asperti:
Linear Logic, Comonads and Optimal Reduction. Fundam. Informaticae 22(1/2): 3-22 (1995) - [j6]Andrea Asperti:
Causal Dependencies in Multiplicative Linear Logic with MIX. Math. Struct. Comput. Sci. 5(3): 351-380 (1995) - [j5]Andrea Asperti, Cosimo Laneve:
Paths, Computations and Labels in the lambda-Calculus. Theor. Comput. Sci. 142(2): 277-297 (1995) - [c15]Andrea Asperti, Agata Ciabattoni:
Effective Applicative Structures. Category Theory and Computer Science 1995: 81-95 - [c14]Andrea Asperti:
deltao!Epsilon = 1 - Optimizing Optimal lambda-Calculus Implementations. RTA 1995: 102-116 - [c13]Andrea Asperti, Cosimo Laneve:
Comparing Lambda-calculus translations in Sharing Graphs. TLCA 1995: 1-15 - 1994
- [j4]Andrea Asperti, Cosimo Laneve:
Interaction Systems I: The Theory of Optimal Reductions. Math. Struct. Comput. Sci. 4(4): 457-504 (1994) - [c12]Andrea Asperti:
Category Theory: Basic notions and general philosophy. JFPLC 1994: 307-108 - [c11]Andrea Asperti, Giovanna M. Dore:
Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX. LFCS 1994: 34-46 - [c10]Andrea Asperti, Vincent Danos, Cosimo Laneve, Laurent Regnier:
Paths in the lambda-calculus. LICS 1994: 426-436 - [c9]Andrea Asperti, Cosimo Laneve:
The Family Relation in Interaction Systems. TACS 1994: 366-384 - 1993
- [c8]Andrea Asperti, Cosimo Laneve:
Interaction Systems. HOA 1993: 1-19 - [c7]Andrea Asperti, Cosimo Laneve:
Paths, Computations and Labels in the Lambda-Calculus. RTA 1993: 152-167 - [c6]Andrea Asperti, Cosimo Laneve:
Optimal Reductions in Interaction Systems. TAPSOFT 1993: 485-500 - 1992
- [j3]Andrea Asperti, Simone Martini:
Categorical Models of Polymorphism. Inf. Comput. 99(1): 1-79 (1992) - [j2]Andrea Asperti:
A Categorical Understanding of Environment Machines. J. Funct. Program. 2(1): 23-59 (1992) - [c5]Andrea Corradini, Andrea Asperti:
A Categorial Model for Logic Programs: Indexed Monoidal Categories. REX Workshop 1992: 110-137 - 1991
- [b1]Andrea Asperti, Giuseppe Longo:
Categories, types and structures - an introduction to category theory for the working computer scientist. Foundations of computing, MIT Press 1991, ISBN 978-0-262-01125-9, pp. I-XI, 1-306 - 1990
- [j1]Andrea Asperti:
Stability and Computability in Coherent Domains. Inf. Comput. 86(2): 115-139 (1990) - [c4]Andrea Asperti:
Integrating Strict and Lazy Evaluation: The lambda-sl-Calculus. PLILP 1990: 238-254 - [c3]Andrea Asperti, Gian-Luigi Ferrari, Roberto Gorrieri:
Implicative Formulae in the "Proofs as Computations" Analogy. POPL 1990: 59-71
1980 – 1989
- 1989
- [c2]Andrea Asperti, Simone Martini:
Projections Instead of Variables: A Category Theoretic Interpretation of Logic Programs. ICLP 1989: 337-352 - 1986
- [c1]Andrea Asperti, Giuseppe Longo:
Relating Type-Structures: Partial Variations on a Theme of Friedman and Statman. CAAP 1986: 266-287
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-18 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
