BSP vs LogP G Bilardi, KT Herley, A Pietracaprina, G Pucci, P Spirakis Proceedings of the eighth annual ACM symposium on Parallel algorithms and …, 1996 | 142* | 1996 |

Mining Frequent Itemsets using Patricia Tries. A Pietracaprina, D Zandolin FIMI 3, 204-208, 2003 | 132 | 2003 |

Space-round tradeoffs for MapReduce computations A Pietracaprina, G Pucci, M Riondato, F Silvestri, E Upfal Proceedings of the 26th ACM international conference on Supercomputing, 235-244, 2012 | 81 | 2012 |

Solving -center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially M Ceccarello, A Pietracaprina, G Pucci arXiv preprint arXiv:1802.09205, 2018 | 70 | 2018 |

An efficient rigorous approach for identifying statistically significant frequent itemsets A Kirsch, M Mitzenmacher, A Pietracaprina, G Pucci, E Upfal, F Vandin Journal of the ACM (JACM) 59 (3), 1-22, 2012 | 56 | 2012 |

Clustering uncertain graphs M Ceccarello, C Fantozzi, A Pietracaprina, G Pucci, F Vandin Proceedings of the VLDB Endowment 11 (4), 472-484, 2017 | 54 | 2017 |

Tight bounds on information dissemination in sparse mobile networks A Pettarin, A Pietracaprina, G Pucci, E Upfal Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 52 | 2011 |

Mining top-*K* frequent itemsets through progressive samplingA Pietracaprina, M Riondato, E Upfal, F Vandin Data Mining and Knowledge Discovery 21, 310-326, 2010 | 49 | 2010 |

A new scheme for the deterministic simulation of PRAMs in VLSI F Luccio, A Pietracaprina, G Pucci Algorithmica 5, 529-544, 1990 | 45 | 1990 |

On the effectiveness of D-BSP as a bridging model of parallel computation G Bilardi, C Fantozzi, A Pietracaprina, G Pucci Computational Science-ICCS 2001: International Conference San Francisco, CA …, 2001 | 39 | 2001 |

On the space and access complexity of computation DAGs G Bilardi, A Pietracaprina, P D’Alberto Graph-Theoretic Concepts in Computer Science: 26th International Workshop …, 2000 | 37 | 2000 |

Mapreduce and streaming algorithms for diversity maximization in metric spaces of bounded doubling dimension M Ceccarello, A Pietracaprina, G Pucci, E Upfal arXiv preprint arXiv:1605.05590, 2016 | 35 | 2016 |

The potential of on-chip multiprocessing for QCD machines G Bilardi, A Pietracaprina, G Pucci, F Schifano, R Tripiccione High Performance Computing–HiPC 2005: 12th International Conference, Goa …, 2005 | 34 | 2005 |

Efficient incremental mining of top-K frequent closed itemsets A Pietracaprina, F Vandin International Conference on Discovery Science, 275-280, 2007 | 32 | 2007 |

Models of Computation, TheoreticalEncyclopedia of Parallel Computing G Bilardi, AA Pietracaprina Encyclopedia of Parallel Computing, 1150-1158, 2011 | 27 | 2011 |

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing⋆ G Bilardi, A Pietracaprina, G Pucci Euro-Par’99 Parallel Processing: 5th International Euro-Par Conference …, 1999 | 26 | 1999 |

A probabilistic simulation of PRAMs on a bounded degree network F Luccio, A Pietracaprina, G Pucci Information Processing Letters 28 (3), 141-147, 1988 | 25 | 1988 |

Fast coreset-based diversity maximization under matroid constraints M Ceccarello, A Pietracaprina, G Pucci Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018 | 24 | 2018 |

Constructive deterministic PRAM simulation on a mesh-connected computer A Pietracaprina, G Pucci, JF Sibeyn Proceedings of the sixth annual ACM symposium on Parallel algorithms and …, 1994 | 23 | 1994 |

MADMX: A strategy for maximal dense motif extraction R Grossi, A Pietracaprina, N Pisanti, G Pucci, E Upfal, F Vandin Journal of Computational Biology 18 (4), 535-545, 2011 | 22 | 2011 |