A Probabilistic Simulation of PRAMs on a Bounded Degree Network. - Fabrizio Luccio; Geppino Pucci; Andrea Pietracaprina (Inf. Process. Lett., 1988)

On the modelling and testing of recovery block structures. - Geppino Pucci (FTCS, 1990)

A New Scheme for the Deterministic Simulation of PRAMs in VLSI. - Fabrizio Luccio; Andrea Pietracaprina; Geppino Pucci (Algorithmica, 1990)

Analysis of Parallel Uniform Hashing. - Fabrizio Luccio; Andrea Pietracaprina; Geppino Pucci (Inf. Process. Lett., 1991)

Parallel Priority Queues. - Maria Cristina Pinotti; Geppino Pucci (Inf. Process. Lett., 1991)

Three non Conventional Paradigms of Parallel Computation. - Fabrizio Luccio; Linda Pagli; Geppino Pucci (Heinz Nixdorf Symposium, 1992)

Analysis and Implementation of Parallel Uniform Hashing. - Fabrizio Luccio; Andrea Pietracaprina; Geppino Pucci (Int. J. Found. Comput. Sci., 1992)

A New Approach to the Modeling of Recovery Block Structures. - Geppino Pucci (IEEE Trans. Software Eng., 1992)

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 (ESA, 1993)

Scattering and Gathering Messages in Networks of Processors. - Sandeep N. Bhatt; Geppino Pucci; Abhiram G. Ranade; Arnold L. Rosenberg (IEEE Trans. Computers, 1993)

Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. - Andrea Pietracaprina; Geppino Pucci (ESA, 1994)

Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. - Andrea Pietracaprina; Geppino Pucci; Jop F. Sibeyn (SPAA, 1994)

Counting the Number of Fault Patterns in Redundant VLSI Arrays. - Linda Pagli; Geppino Pucci (Inf. Process. Lett., 1994)

Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (ESA, 1995)

Improved Deterministic PRAM Simulation on the Mesh. - Andrea Pietracaprina; Geppino Pucci (ICALP, 1995)

Parallel Algorithms for Priority Queue Operations. - Maria Cristina Pinotti; Geppino Pucci (Theor. Comput. Sci., 1995)

Fast Deterministic Backtrack Search. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (ICALP, 1996)

BSP vs LogP. - Gianfranco Bilardi; Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci; Paul G. Spirakis (SPAA, 1996)

On Bufferless Routing of Variable Length Messages in Leveled Networks. - Sandeep N. Bhatt; Gianfranco Bilardi; Geppino Pucci; Abhiram G. Ranade; Arnold L. Rosenberg; Eric J. Schwabe (IEEE Trans. Computers, 1996)

The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines. - Andrea Pietracaprina; Geppino Pucci (Theory Comput. Syst., 1997)

Tight Bounds on Parallel List Marking. - Sandeep N. Bhatt; Gianfranco Bilardi; Kieran T. Herley; Geppino Pucci; Abhiram G. Ranade (J. Parallel Distributed Comput., 1998)

Area-Universal Circuits with Constant Slowdown. - Sandeep N. Bhatt; Gianfranco Bilardi; Geppino Pucci (ARVLSI, 1999)

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci (Euro-Par, 1999)

Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (IPPS/SPDP Workshops, 1999)

BSP versus LogP. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Kieran T. Herley; Paul G. Spirakis (Algorithmica, 1999)

Deterministic Branch-and-Bound on Distributed Memory Machines. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Int. J. Found. Comput. Sci., 1999)

Fast Deterministic Parallel Branch-and-Bound. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Parallel Process. Lett., 1999)

On the Predictive Quality of BSP-like Cost Functions for NOWs. - Mauro Bianco; Geppino Pucci (Euro-Par, 2000)

A Compact, Thread-Safe Communication Library for Efficient Cluster Computing. - Marco Danelutto; Geppino Pucci (HPCN Europe, 2000)

Predicting Performance on SMPs. A Case Study: The SGI Power Challenge. - Nancy M. Amato; Jack Perdue; Mark M. Mathis; Andrea Pietracaprina; Geppino Pucci (IPDPS, 2000)

Constructive, Deterministic Implementation of Shared Memory on Meshes. - Andrea Pietracaprina; Geppino Pucci; Jop F. Sibeyn (SIAM J. Comput., 2000)

On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. - Gianfranco Bilardi; Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci (International Conference on Computational Science (2), 2001)

Implementing Shared Memory on Clustered Machines. - Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci (IPDPS, 2001)

One-to-Many routing on the mesh. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (SPAA, 2001)

Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Inf. Comput., 2001)

Seamless Integration of Parallelism and Memory Hierarchy. - Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci (ICALP, 2002)

An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems. - Mauro Bianco; Gianfranco Bilardi; Francesco Pesavento; Geppino Pucci; Bernhard A. Schrefler (International Conference on Computational Science (1), 2002)

Optimal Deterministic Protocols for Mobile Robots on a Grid. - Roberto Grossi; Andrea Pietracaprina; Geppino Pucci (Inf. Comput., 2002)

Deterministic parallel backtrack search. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Theor. Comput. Sci., 2002)

A General Pram Simulation Scheme For Clustered Machines. - Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci (Int. J. Found. Comput. Sci., 2003)

A Fast Multifrontal Solver for Non-linear Multi-physics Problems. - Alberto Bertoldo; Mauro Bianco; Geppino Pucci (International Conference on Computational Science, 2004)

The Potential of On-Chip Multiprocessing for QCD Machines. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Sebastiano Fabio Schifano; Raffaele Tripiccione (HiPC, 2005)

Optimal many-to-one routing on the mesh with constant queues. - Andrea Pietracaprina; Geppino Pucci (Inf. Process. Lett., 2005)

On stalling in LogP. - Gianfranco Bilardi; Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (J. Parallel Distributed Comput., 2005)

Cache-oblivious simulation of parallel programs. - Andrea Pietracaprina; Geppino Pucci; Francesco Silvestri 001 (IPDPS, 2006)

A Static Parallel Multifrontal Solver for Finite Element Meshes. - Alberto Bertoldo; Mauro Bianco; Geppino Pucci (ISPA, 2006)

Translating submachine locality into locality of reference. - Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci (J. Parallel Distributed Comput., 2006)

Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer. - Paolo Bertasi; Mauro Bianco; Andrea Pietracaprina; Geppino Pucci (CISIS, 2007)

On the Connectivity of Bluetooth-Based Ad Hoc Networks. - Pilu Crescenzi; Carlo Nocentini; Andrea Pietracaprina; Geppino Pucci; Carlo Sandri (Euro-Par, 2007)

Network-Oblivious Algorithms. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Francesco Silvestri 001 (IPDPS, 2007)

Decomposable BSP. - Geppino Pucci; Andrea Pietracaprina; Gianfranco Bilardi (Handbook of Parallel Computing, 2007)

Topic 12: Theory and Algorithms for Parallel Computation. - Geppino Pucci; Coromoto León; Ioannis Caragiannis; Kieran T. Herley (Euro-Par, 2008)

Store-and-Forward Multicast Routing on the Mesh. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Theory Comput. Syst., 2008)

Area-time tradeoffs for universal VLSI circuits. - Sandeep N. Bhatt; Gianfranco Bilardi; Geppino Pucci (Theor. Comput. Sci., 2008)

MADMX: A Novel Strategy for Maximal Dense Motif Extraction. - Roberto Grossi; Andrea Pietracaprina; Nadia Pisanti; Geppino Pucci; Eli Upfal; Fabio Vandin (WABI, 2009)

On the connectivity of Bluetooth-based ad hoc networks. - Pierluigi Crescenzi; Carlo Nocentini; Andrea Pietracaprina; Geppino Pucci (Concurr. Comput. Pract. Exp., 2009)

Foreword. - Pierluigi Crescenzi; Fabrizio Luccio; Geppino Pucci (Theory Comput. Syst., 2009)

Infectious Random Walks - Alberto Pettarin; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (CoRR, 2010)

Tight bounds on information dissemination in sparse mobile networks. - Alberto Pettarin; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (PODC, 2011)

MADMX: A Strategy for Maximal Dense Motif Extraction. - Roberto Grossi; Andrea Pietracaprina; Nadia Pisanti; Geppino Pucci; Eli Upfal; Fabio Vandin (J. Comput. Biol., 2011)

Universality in VLSI Computation. - Gianfranco Bilardi; Geppino Pucci (Encyclopedia of Parallel Computing, 2011)

Topic 12: Theory and Algorithms for Parallel Computation. - Geppino Pucci; Christos D. Zaroliagis; Kieran T. Herley; Henning Meyerhenke (Euro-Par, 2012)

Space-round tradeoffs for MapReduce computations. - Andrea Pietracaprina; Geppino Pucci; Matteo Riondato; Francesco Silvestri 001; Eli Upfal (ICS, 2012)

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. - Adam Kirsch; Michael Mitzenmacher; Andrea Pietracaprina; Geppino Pucci; Eli Upfal; Fabio Vandin (J. ACM, 2012)

On the Expansion and Diameter of Bluetooth-Like Topologies. - Alberto Pettarin; Andrea Pietracaprina; Geppino Pucci (Theory Comput. Syst., 2013)

Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (CoRR, 2014)

Foreword: Parallelism in Algorithms and Architectures. - Geppino Pucci; Victor Luchangco; Rajmohan Rajaraman (Theory Comput. Syst., 2014)

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (SPAA, 2015)

Space-efficient parallel algorithms for combinatorial search problems. - Andrea Pietracaprina; Geppino Pucci; Francesco Silvestri 001; Fabio Vandin (J. Parallel Distributed Comput., 2015)

Heterogeneous machine learning system for improving the diagnosis of primary aldosteronism. - Nicola Lazzarini; Loris Nanni; Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci; Teresa Maria Seccia; Gian Paolo Rossi 002 (Pattern Recognit. Lett., 2015)

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (IPDPS, 2016)

On the complexity of the shortest-path broadcast problem. - Pierluigi Crescenzi; Pierre Fraigniaud; Magnús M. Halldórsson; Hovhannes A. Harutyunyan; Chiara Pierucci; Andrea Pietracaprina; Geppino Pucci (Discret. Appl. Math., 2016)

Network-Oblivious Algorithms. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Michele Scquizzato; Francesco Silvestri 001 (J. ACM, 2016)

Clustering Uncertain Graphs. - Matteo Ceccarello; Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci; Fabio Vandin (Proc. VLDB Endow., 2017)

MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (Proc. VLDB Endow., 2017)

Fast Coreset-based Diversity Maximization under Matroid Constraints. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (WSDM, 2018)

Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces. - Alessio Mazzetto; Andrea Pietracaprina; Geppino Pucci (ISAAC, 2019)

Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (Proc. VLDB Endow., 2019)

Dimensionality-adaptive k-center in sliding windows. - Paolo Pellizzoni; Andrea Pietracaprina; Geppino Pucci (DSAA, 2020)

Distributed Graph Diameter Approximation. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (Algorithms, 2020)

Coreset-based Strategies for Robust Center-type Problems. - Andrea Pietracaprina; Geppino Pucci; Federico Soldà (CoRR, 2020)

A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (ACM Trans. Knowl. Discov. Data, 2020)

Scalable Distributed Approximation of Internal Measures for Clustering Evaluation. - Federico Altieri; Andrea Pietracaprina; Geppino Pucci; Fabio Vandin (SDM, 2021)

k-Center Clustering with Outliers in Sliding Windows. - Paolo Pellizzoni; Andrea Pietracaprina; Geppino Pucci (Algorithms, 2022)

Adaptive k-center and diameter estimation in sliding windows. - Paolo Pellizzoni; Andrea Pietracaprina; Geppino Pucci (Int. J. Data Sci. Anal., 2022)

Distributed k-Means with Outliers in General Metrics. - Enrico Dandolo; Andrea Pietracaprina; Geppino Pucci (Euro-Par, 2023)

Scalable and space-efficient Robust Matroid Center algorithms. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Federico Soldà (J. Big Data, 2023)

Fast and Accurate Fair k-Center Clustering in Doubling Metrics. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (WWW, 2024)

MapReduce algorithms for robust center-based clustering in doubling metrics. - Enrico Dandolo; Alessio Mazzetto; Andrea Pietracaprina; Geppino Pucci (J. Parallel Distributed Comput., 2024)

Center-Based Approximation of a Drifting Distribution. - Alessio Mazzetto; Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (ALT, 2025)

Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. - Paolo Pellizzoni; Andrea Pietracaprina; Geppino Pucci (ACM Trans. Knowl. Discov. Data, 2025)

Fair Center Clustering in Sliding Windows. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Francesco Visonà (CoRR, 2025)