Andrea Pietracaprina

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 32

Top Venues

Publications

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
Fast and Accurate Fair k-Center Clustering in Doubling Metrics. WWW (2024)
Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci
Fully dynamic clustering and diversity maximization in doubling metrics. CoRR (2023)
Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci
Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. WADS (2023)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Federico Soldà
Scalable and space-efficient Robust Matroid Center algorithms. J. Big Data 10 (1) (2023)
Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci
Distributed k-Means with Outliers in General Metrics. Euro-Par (2023)
Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci
Adaptive k-center and diameter estimation in sliding windows. Int. J. Data Sci. Anal. 14 (2) (2022)
Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci
Distributed k-Means with Outliers in General Metrics. CoRR (2022)
Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci
k-Center Clustering with Outliers in Sliding Windows. CoRR (2022)
Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci
k-Center Clustering with Outliers in Sliding Windows. Algorithms 15 (2) (2022)
Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation. SDM (2021)
Andrea Pietracaprina, Geppino Pucci, Federico Soldà
Coreset-based Strategies for Robust Center-type Problems. CoRR (2020)
Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation. CoRR (2020)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. ACM Trans. Knowl. Discov. Data 14 (5) (2020)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. CoRR (2020)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
Distributed Graph Diameter Approximation. Algorithms 13 (9) (2020)
Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci
Dimensionality-adaptive k-center in sliding windows. DSAA (2020)
Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci
Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces. ISAAC (2019)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. Proc. VLDB Endow. 12 (7) (2019)
Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci
Accurate MapReduce Algorithms for $k$-median and $k$-means in General Metric Spaces. CoRR (2019)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
Fast Coreset-based Diversity Maximization under Matroid Constraints. WSDM (2018)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. CoRR (2018)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. Proc. VLDB Endow. 10 (5) (2017)
Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
Clustering Uncertain Graphs. Proc. VLDB Endow. 11 (4) (2017)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. J. ACM 63 (1) (2016)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. CoRR (2016)
Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
Clustering Uncertain Graphs. CoRR (2016)
Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199 (2016)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. IPDPS (2016)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
Space-efficient parallel algorithms for combinatorial search problems. J. Parallel Distributed Comput. 76 (2015)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. CoRR (2015)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. SPAA (2015)
Nicola Lazzarini, Loris Nanni, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Teresa Maria Seccia, Gian Paolo Rossi
Heterogeneous machine learning system for improving the diagnosis of primary aldosteronism. Pattern Recognit. Lett. 65 (2015)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. CoRR (2014)
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. CoRR (2014)
Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci
On the Expansion and Diameter of Bluetooth-Like Topologies. Theory Comput. Syst. 52 (2) (2013)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. MFCS (2013)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. CoRR (2013)
Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal
Space-round tradeoffs for MapReduce computations. ICS (2012)
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM 59 (3) (2012)
Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
Tight bounds on information dissemination in sparse mobile networks. PODC (2011)
Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal
Space-Round Tradeoffs for MapReduce Computations CoRR (2011)
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
MADMX: A Strategy for Maximal Dense Motif Extraction. J. Comput. Biol. 18 (4) (2011)
Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
Tight Bounds on Information Dissemination in Sparse Mobile Networks CoRR (2011)
Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal
Infectious Random Walks CoRR (2010)
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets CoRR (2010)
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
MADMX: A Novel Strategy for Maximal Dense Motif Extraction CoRR (2010)
Sara Nasso, Francesco Silvestri, Francesco Tisiot, Barbara Di Camillo, Andrea Pietracaprina, Gianna Maria Toffolo
An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree CoRR (2010)
Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin
frequent itemsets through progressive sampling. Data Min. Knowl. Discov. 21 (2) (2010)
Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin
Mining Top-K Frequent Itemsets Through Progressive Sampling CoRR (2010)
Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci
networks. Concurr. Comput. Pract. Exp. 21 (7) (2009)
Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci
On the Expansion and Diameter of Bluetooth-Like Topologies. ESA (2009)
Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin
Introduction. Euro-Par (2009)
Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin
An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS (2009)
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI (2009)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Store-and-Forward Multicast Routing on the Mesh. Theory Comput. Syst. 42 (4) (2008)
Nancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia
Preface. Theor. Comput. Sci. 408 (2-3) (2008)
Andrea Pietracaprina, Fabio Vandin
Efficient Incremental Mining of Top-K Frequent Closed Itemsets. Discovery Science (2007)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
Network-Oblivious Algorithms. IPDPS (2007)
Paolo Bertasi, Mauro Bianco, Andrea Pietracaprina, Geppino Pucci
Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer. CISIS (2007)
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri
On the Connectivity of Bluetooth-Based Ad Hoc Networks. Euro-Par (2007)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
Cache-oblivious simulation of parallel programs. IPDPS (2006)
Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
Translating submachine locality into locality of reference. J. Parallel Distributed Comput. 66 (5) (2006)
Andrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon
Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par (2005)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione
The Potential of On-Chip Multiprocessing for QCD Machines. HiPC (2005)
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
On stalling in LogP. J. Parallel Distributed Comput. 65 (3) (2005)
Andrea Pietracaprina, Geppino Pucci
Optimal many-to-one routing on the mesh with constant queues. Inf. Process. Lett. 96 (1) (2005)
Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina
Topic 13: Theory and Algorithms for Parallel Computation. Euro-Par (2004)
Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
Translating Submachine Locality into Locality of Reference. IPDPS (2004)
Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
A General Pram Simulation Scheme For Clustered Machines. Int. J. Found. Comput. Sci. 14 (6) (2003)
Andrea Pietracaprina, Dario Zandolin
Mining Frequent Itemsets using Patricia Tries. FIMI (2003)
Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
Seamless Integration of Parallelism and Memory Hierarchy. ICALP (2002)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Deterministic parallel backtrack search. Theor. Comput. Sci. 270 (1-2) (2002)
Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
Optimal Deterministic Protocols for Mobile Robots on a Grid. Inf. Comput. 173 (2) (2002)
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe
Distribution Sweeping on Clustered Machines with Hierarchical Memories. IPDPS (2002)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
One-to-Many routing on the mesh. SPAA (2001)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. Inf. Comput. 165 (2) (2001)
Andrea Pietracaprina, Geppino Pucci
Optimal Many-to-One Routing on the Mesh with Constant Queues. Euro-Par (2001)
Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. International Conference on Computational Science (2) (2001)
Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
Implementing Shared Memory on Clustered Machines. IPDPS (2001)
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
Constructive, Deterministic Implementation of Shared Memory on Meshes. SIAM J. Comput. 30 (2) (2000)
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
On Stalling in LogP. IPDPS Workshops (2000)
Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
On the Space and Access Complexity of Computation DAGs. WG (2000)
Nancy M. Amato, Jack Perdue, Mark M. Mathis, Andrea Pietracaprina, Geppino Pucci
Predicting Performance on SMPs. A Case Study: The SGI Power Challenge. IPDPS (2000)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). IPPS/SPDP Workshops (1999)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis
BSP versus LogP. Algorithmica 24 (3-4) (1999)
Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
The Complexity of Parallel Multisearch on Coarse-Grained Machines. Algorithmica 24 (3-4) (1999)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Deterministic Branch-and-Bound on Distributed Memory Machines. Int. J. Found. Comput. Sci. 10 (4) (1999)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Fast Deterministic Parallel Branch-and-Bound. Parallel Process. Lett. 9 (3) (1999)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. Euro-Par (1999)
Andrea Pietracaprina
Deterministic Routing of h-relations on the Multibutterfly. IPPS/SPDP (1998)
Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
Optimal Deterministic Protocols for Mobile Robots on a Grid. SWAT (1998)
Andrea Pietracaprina, Franco P. Preparata
Practical Constructive Schemes for Deterministic Shared-Memory Access. Theory Comput. Syst. 30 (1) (1997)
Andrea Pietracaprina, Geppino Pucci
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines. Theory Comput. Syst. 30 (3) (1997)
Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
The Deterministic Complexity of Parallel Multisearch (Extended Abstract). SWAT (1996)
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis
BSP vs LogP. SPAA (1996)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Fast Deterministic Backtrack Search. ICALP (1996)
Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). ESA (1995)
Andrea Pietracaprina, Geppino Pucci
Improved Deterministic PRAM Simulation on the Mesh. ICALP (1995)
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. SPAA (1994)
Arvind Krishna, Bruce E. Hajek, Andrea Pietracaprina
Sharper analysis of packet routing on a butterfly. Networks 24 (2) (1994)

Andrea Pietracaprina.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrea Pietracaprina