| 2020 | ISCAS | A Novel Start-Up Technique for Time-Based Boost Converters with Seamless PFM/PWM Transition. | Tommaso Rosa, Mauro Leoncini, Salvatore Levantino, Massimo Ghioni |
| 2017 | RTNS | A branch-and-bound algorithm to compute a tighter bound to tardiness for preemptive global EDF scheduler. | Mauro Leoncini, Manuela Montangero, Paolo Valente |
| 2009 | ICSE | Self Organization and Self Maintenance of Mobile Ad Hoc Networks through Dynamic Topology Control. | Douglas M. Blough, Giovanni Resta, Paolo Santi, Mauro Leoncini |
| 2008 | MASS | An STDMA-based framework for QoS provisioning in wireless mesh networks. | Mauro Leoncini, Paolo Santi, Paolo Valente |
| 2007 | HCI | Untitled record | Filippo Geraci, Mauro Leoncini, Manuela Montangero, Marco Pellegrini, M. Elena Renda |
| 2006 | ESA | Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games. | Bruno Codenotti, Mauro Leoncini, Giovanni Resta |
| 2005 | MSWIM | Topology control with better radio models: implications for energy and multi-hop interference. | Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi |
| 2003 | MOBIHOC | The lit K-neigh protocol for symmetric topology control in ad hoc networks. | Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi |
| 2001 | OPODIS | Distributed Algorithm for Certain Assignment Problems. | Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero |
| 2000 | CIAC | On the Lovsz Number of Certain Circulant Graphs. | Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini |
| 1997 | SPAA | On the Parallel Complexity of Matrix Factorization Algorithms. | Mauro Leoncini, Giovanni Manzini, Luciano Margara |
| 1996 | ESA | Parallel Complexity of Householder QR Factorization. | Mauro Leoncini, Giovanni Manzini, Luciano Margara |
| 1994 | SPAA | How Much Can We Speedup Gaussian Elimination with Pivoting? | Mauro Leoncini |