Andrea Pietracaprina

117 papers A* 7A 15B 13C 1Misc 3Journal 63Unranked 13

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