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 | 136* | 1996 |

Mining frequent itemsets using patricia tries A Pietracaprina | 127 | 2003 |

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 | 117 | 1996 |

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 | 69 | 2012 |

Pilot study of rapamycin in patients with hormone-refractory prostate cancer RJ Amato, J Jac, T Mohammad, S Saxena Clinical genitourinary cancer 6 (2), 97-102, 2008 | 67 | 2008 |

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 | 47 | 2012 |

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 | 47 | 2011 |

Mining top-K frequent itemsets through progressive sampling A Pietracaprina, M Riondato, E Upfal, F Vandin Data Mining and Knowledge Discovery 21 (2), 310-326, 2010 | 41 | 2010 |

On the effectiveness of D-BSP as a bridging model of parallel computation G Bilardi, C Fantozzi, A Pietracaprina, G Pucci International Conference on Computational Science, 579-588, 2001 | 40 | 2001 |

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

Evolving Computational Systems. SG Akl Handbook of Parallel Computing, 2007 | 33 | 2007 |

The potential of on-chip multiprocessing for QCD machines G Bilardi, A Pietracaprina, G Pucci, F Schifano, R Tripiccione International Conference on High-Performance Computing, 386-397, 2005 | 33 | 2005 |

On the space and access complexity of computation DAGs G Bilardi, A Pietracaprina, P D’Alberto International Workshop on Graph-Theoretic Concepts in Computer Science, 47-58, 2000 | 33 | 2000 |

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

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

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing⋆ G Bilardi, A Pietracaprina, G Pucci European Conference on Parallel Processing, 543-551, 1999 | 25 | 1999 |

Network-oblivious algorithms G Bilardi, A Pietracaprina, G Pucci, M Scquizzato, F Silvestri Journal of the ACM (JACM) 63 (1), 1-36, 2016 | 24 | 2016 |

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

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

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 | 22 | 2016 |