| 2026 | EDBT | Fair Center Clustering in Sliding Windows. | Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Francesco Vison |
| 2025 | ALT | Center-Based Approximation of a Drifting Distribution. | Alessio Mazzetto, Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
| 2024 | WWW | Fast and Accurate Fair k-Center Clustering in Doubling Metrics. | Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci |
| 2023 | EuroPar | Distributed k-Means with Outliers in General Metrics. | Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci |
| 2023 | WADS | Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. | Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci |
| 2021 | SDM | Scalable Distributed Approximation of Internal Measures for Clustering Evaluation. | Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin |
| 2020 | DSAA | Dimensionality-adaptive k-center in sliding windows. | Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci |
| 2019 | ISAAC | Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces. | Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci |
| 2018 | WSDM | Fast Coreset-based Diversity Maximization under Matroid Constraints. | Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci |
| 2015 | SPAA | Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. | Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
| 2013 | MFCS | Space-Efficient Parallel Algorithms for Combinatorial Search Problems. | Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin |
| 2012 | ICS | Space-round tradeoffs for MapReduce computations. | Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal |
| 2011 | PODC | Tight bounds on information dissemination in sparse mobile networks. | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
| 2009 | ESA | On the Expansion and Diameter of Bluetooth-Like Topologies. | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci |
| 2009 | EuroPar | Introduction. | Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin |
| 2009 | PODS | An efficient rigorous approach for identifying statistically significant frequent itemsets. | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2009 | WABI | MADMX: A Novel Strategy for Maximal Dense Motif Extraction. | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2007 | CISIS | Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer. | Paolo Bertasi, Mauro Bianco, Andrea Pietracaprina, Geppino Pucci |
| 2007 | DIS | Efficient Incremental Mining of Top-K Frequent Closed Itemsets. | Andrea Pietracaprina, Fabio Vandin |
| 2007 | EuroPar | On the Connectivity of Bluetooth-Based Ad Hoc Networks. | Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri |
| 2005 | EuroPar | Topic 12 Theory and Algorithms for Parallel Computation. | Andrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon |
| 2005 | HiPC | The Potential of On-Chip Multiprocessing for QCD Machines. | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione |
| 2004 | EuroPar | Topic 13: Theory and Algorithms for Parallel Computation. | Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina |
| 2002 | ICALP | Seamless Integration of Parallelism and Memory Hierarchy. | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci |
| 2001 | EuroPar | Optimal Many-to-One Routing on the Mesh with Constant Queues. | Andrea Pietracaprina, Geppino Pucci |
| 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 | One-to-Many routing on the mesh. | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
| 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 |
| 1996 | ICALP | Fast Deterministic Backtrack Search. | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
| 1996 | SPAA | BSP vs LogP. | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis |
| 1995 | ESA | Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
| 1995 | ICALP | Improved Deterministic PRAM Simulation on the Mesh. | Andrea Pietracaprina, Geppino Pucci |
| 1994 | ESA | Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. | Andrea Pietracaprina, Geppino Pucci |
| 1994 | SPAA | Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. | Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn |
| 1993 | STACS | On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. | Andrea Pietracaprina, Franco P. Preparata |
| 1993 | SPAA | A Practical Constructive Scheme for Deterministic Shared-Memory Access. | Andrea Pietracaprina, Franco P. Preparata |
| 1991 | INFOCOM | Packet Routing in Optimal Time on a Butterfly. | Arvind Krishna, Andrea Pietracaprina, Bruce E. Hajek |