| 2019 | SODA | The I/O complexity of Toom-Cook integer multiplication. | Gianfranco Bilardi, Lorenzo De Stefani |
| 2019 | SPIRE | Bounds and Estimates on the Average Edit Distance. | Michele Schimd, Gianfranco Bilardi |
| 2017 | WADS | The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. | Gianfranco Bilardi, Lorenzo De Stefani |
| 2015 | CC | A Graphical Model for Context-Free Grammar Parsing. | Keshav Pingali, Gianfranco Bilardi |
| 2012 | EuroPar | A Lower Bound Technique for Communication on BSP with Application to the FFT. | Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri |
| 2008 | EuroPar | Models for Parallel and Hierarchical On-Chip Computation. | Gianfranco Bilardi |
| 2005 | HiPC | The Potential of On-Chip Multiprocessing for QCD Machines. | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione |
| 2002 | ICCS | An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems. | Mauro Bianco, Gianfranco Bilardi, Francesco Pesavento, Geppino Pucci, Bernhard A. Schrefler |
| 2002 | SPAA | Optimal organizations for pipelined hierarchical memories. | Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik |
| 2001 | EuroPar | Topic 06: Complexity Theory and Algorithms. | Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs |
| 2001 | ICALP | A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. | Gianfranco Bilardi, Enoch Peserico |
| 2001 | ICCS | On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. | Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci |
| 2001 | SPAA | Computational power of pipelined memory hierarchies. | Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik |
| 2000 | WG | On the Space and Access Complexity of Computation DAGs. | Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto |
| 1999 | EuroPar | A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci |
| 1997 | CIAC | Algorithms and Data Structures for Control Dependence and Related Compiler Problems. | Gianfranco Bilardi |
| 1997 | EuroPar | Broadcast and Associative Operations on Fat-Trees. | Gianfranco Bilardi, Bruno Codenotti, Gianna Maria Del Corso, Maria Cristina Pinotti, Giovanni Resta |
| 1996 | PLDI | Generalized Dominance and Control Dependence. | Gianfranco Bilardi, Keshav Pingali |
| 1996 | SPAA | BSP vs LogP. | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis |
| 1995 | EuroPar | Tight Bounds on Parallel List Marking. | Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade |
| 1995 | ICDE | An International Masters in Software Engineering: Experience and Prospects. | Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo |
| 1995 | PLDI | APT: A Data Structure for Optimal Control Dependence Computation. | Keshav Pingali, Gianfranco Bilardi |
| 1995 | SPAA | Upper Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. | Gianfranco Bilardi, Franco P. Preparata |
| 1995 | WADS | Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. | Gianfranco Bilardi, Franco P. Preparata |
| 1994 | ESA | An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). | Gianfranco Bilardi, Paul Bay |
| 1993 | ESA | On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). | Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe |
| 1992 | COLT | Language Learning from Stochastic Input. | Shyam Kapur, Gianfranco Bilardi |
| 1992 | STACS | Language Learning without Overgeneralization. | Shyam Kapur, Gianfranco Bilardi |
| 1990 | FOCS | Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) | Paul Bay, Gianfranco Bilardi |
| 1989 | ICALP | Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions. | Gianfranco Bilardi, Abha Moitra |
| 1989 | SPAA | Optimal VLSI Architectures for Multidimensional DFT. | Gianfranco Bilardi, Scot W. Hornick, Majid Sarrafzadeh |
| 1987 | STOC | Size-Time Complexity of Boolean Networks for Prefix Computations | Gianfranco Bilardi, Franco P. Preparata |
| 1985 | ICALP | The Influence of Key Length on the Area-Time Complexity of Sorting. | Gianfranco Bilardi, Franco P. Preparata |
| 1984 | STOC | A Minimum Area VLSI Network for O(log n) Time Sorting | Gianfranco Bilardi, Franco P. Preparata |