Andrea Pietracaprina
Andrea Pietracaprina
Professor of Computer Science
Email verificata su unipd.it
Titolo
Citata da
Citata da
Anno
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
140*1996
Mining frequent itemsets using patricia tries
A Pietracaprina
1292003
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
1211996
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
722012
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
492012
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
472011
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
422010
A new scheme for the deterministic simulation of PRAMs in VLSI
F Luccio, A Pietracaprina, G Pucci
Algorithmica 5 (1), 529-544, 1990
411990
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
402001
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
332005
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
332000
Clustering uncertain graphs
M Ceccarello, C Fantozzi, A Pietracaprina, G Pucci, F Vandin
Proceedings of the VLDB Endowment 11 (4), 472-484, 2017
322017
Efficient incremental mining of top-K frequent closed itemsets
A Pietracaprina, F Vandin
International Conference on Discovery Science, 275-280, 2007
312007
Network-oblivious algorithms
G Bilardi, A Pietracaprina, G Pucci, M Scquizzato, F Silvestri
Journal of the ACM (JACM) 63 (1), 1-36, 2016
252016
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
251999
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
242018
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
242016
A probabilistic simulation of PRAMs on a bounded degree network
F Luccio, A Pietracaprina, G Pucci
Information Processing Letters 28 (3), 141-147, 1988
241988
A probabilistic simulation of PRAMs on a bounded degree network
F Luccio, A Pietracaprina, G Pucci
Information Processing Letters 28 (3), 141-147, 1988
241988
Space and time efficient parallel graph decomposition, clustering, and diameter approximation
M Ceccarello, A Pietracaprina, G Pucci, E Upfal
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
212015
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20