| 2025 | FSCD | Unifying Boolean and Algebraic Descriptive Complexity. | Baptiste Chanus, Damiano Mazza, Morgan Rogers |
| 2024 | FSCD | Bhm and Taylor for All! | Alos Dufour, Damiano Mazza |
| 2020 | FLOPS | Polynomial Time over the Reals with Parsimony. | Emmanuel Hainry, Damiano Mazza, Romain Pchoux |
| 2016 | LICS | Church Meets Cook and Levin. | Damiano Mazza |
| 2015 | APLAS | A Strong Distillery. | Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza |
| 2015 | CSL | Simple Parsimonious Types and Logarithmic Space. | Damiano Mazza |
| 2015 | ICALP | Parsimonious Types and Non-uniform Computation. | Damiano Mazza, Kazushige Terui |
| 2015 | ICTAC | A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic. | Damiano Mazza, Luc Pellissier |
| 2014 | ESOP | A Core Quantitative Coeffect Calculus. | Alos Brunel, Marco Gaboardi, Damiano Mazza, Steve Zdancewic |
| 2014 | ICALP | Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus. | Damiano Mazza |
| 2014 | ICFP | Distilling abstract machines. | Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza |
| 2013 | CONCUR | A Hierarchy of Expressiveness in Concurrent Interaction Nets. | Andrei Dorman, Damiano Mazza |
| 2012 | FOSSACS | Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators. | Damiano Mazza, Neil J. Ross |
| 2012 | LICS | An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus. | Damiano Mazza |
| 2007 | LPAR | The Separation Theorem for Differential Interaction Nets. | Damiano Mazza, Michele Pagani |
| 2005 | CONCUR | Multiport Interaction Nets and Concurrency. | Damiano Mazza |