A. Pietracaprina

发表

Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings

G. Italiano, G. Bilardi, A. Pietracaprina, 1998 .

Deterministic Routing of �-relations on the Multibutterfly

A. Pietracaprina, 2007 .

BSP vs LogP

Paul G. Spirakis, Geppino Pucci, Andrea Pietracaprina, 1996, SPAA '96.

Optimal many-to-one routing on the mesh with constant queues

A. Pietracaprina, G. Pucci, 2005, Inf. Process. Lett..

Topic 12 Theory and Algorithms for Parallel Computation

Andrea Pietracaprina, Christos D. Zaroliagis, Kieran T. Herley, 2005, Euro-Par.

Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer

Geppino Pucci, Andrea Pietracaprina, Paolo Bertasi, 2007, Computational Intelligence in Security for Information Systems.

MIMD Lattice Computation

Scott Pakin, Andrea Pietracaprina, William Gropp, 2011, Encyclopedia of Parallel Computing.

On the connectivity of Bluetooth‐based ad hoc networks

A. Pietracaprina, G. Pucci, P. Crescenzi, 2007, Concurr. Comput. Pract. Exp..

An efficient rigorous approach for identifying statistically significant frequent itemsets

M. Mitzenmacher, E. Upfal, Fabio Vandin, 2009, JACM.

Adaptive k-center and diameter estimation in sliding windows

A. Pietracaprina, G. Pucci, Paolo Pellizzoni, 2022, International Journal of Data Science and Analytics.

k-Center Clustering with Outliers in Sliding Windows

A. Pietracaprina, G. Pucci, Paolo Pellizzoni, 2022, Algorithms.

Dimensionality-adaptive k-center in sliding windows

Geppino Pucci, Andrea Pietracaprina, Paolo Pellizzoni, 2020, 2020 IEEE 7th International Conference on Data Science and Advanced Analytics (DSAA).

Coreset-based Strategies for Robust Center-type Problems pdf

Geppino Pucci, Andrea Pietracaprina, Federico Solda, 2020, ArXiv.

A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints

Geppino Pucci, Andrea Pietracaprina, Matteo Ceccarello, 2020, ACM Trans. Knowl. Discov. Data.

Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially

Geppino Pucci, Andrea Pietracaprina, Matteo Ceccarello, 2018, Proc. VLDB Endow..

Improved MapReduce and Streaming Algorithms for $k$-Center Clustering (with Outliers)

Geppino Pucci, Andrea Pietracaprina, Matteo Ceccarello, 2018 .

Fast Coreset-based Diversity Maximization under Matroid Constraints

Geppino Pucci, Andrea Pietracaprina, Matteo Ceccarello, 2018, WSDM.

Clustering Uncertain Graphs

Geppino Pucci, Andrea Pietracaprina, Fabio Vandin, 2016, Proc. VLDB Endow..

MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2016, Proc. VLDB Endow..

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2014, SPAA.

Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space pdf

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2014, ArXiv.

Network-Oblivious Algorithms

Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi, 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

Scalable Distributed Approximation of Internal Measures for Clustering Evaluation pdf

Geppino Pucci, Andrea Pietracaprina, Fabio Vandin, 2020, SDM.

On the complexity of the shortest-path broadcast problem

Geppino Pucci, Andrea Pietracaprina, Pierre Fraigniaud, 2016, Discret. Appl. Math..

Tight bounds on information dissemination in sparse mobile networks

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2011, PODC '11.

A General Pram Simulation Scheme For Clustered Machines

Geppino Pucci, Andrea Pietracaprina, Carlo Fantozzi, 2003, Int. J. Found. Comput. Sci..

Mining top-K frequent itemsets through progressive sampling

Eli Upfal, Andrea Pietracaprina, Fabio Vandin, 2010, Data Mining and Knowledge Discovery.

Models of Computation, Theoretical

Andrea Pietracaprina, Gianfranco Bilardi, G. Bilardi, 2011, Encyclopedia of Parallel Computing.

The Deterministic Complexity of Parallel Multisearch (Extended Abstract)

Andrea Pietracaprina, Armin Bäumker, Wolfgang Dittrich, 1996, SWAT.

Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer

Geppino Pucci, Andrea Pietracaprina, Mauro Bianco, 2007, First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07).

Space-round tradeoffs for MapReduce computations pdf

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2011, ICS '12.

Distributed Graph Diameter Approximation

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2020, Algorithms.

Predicting performance on SMPs. A case study: the SGI Power Challenge

Nancy M. Amato, Geppino Pucci, Andrea Pietracaprina, 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

MADMX: A Strategy for Maximal Dense Motif Extraction

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2011, J. Comput. Biol..

MADMX: A Novel Strategy for Maximal Dense Motif Extraction pdf

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2009, WABI.

Mining Frequent Itemsets using Patricia Tries

Andrea Pietracaprina, Dario Zandolin, A. Pietracaprina, 2003, FIMI.

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2015, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

An efficient rigorous approach for identifying statistically significant frequent itemsets

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2009, JACM.

A rigorous statistical approach for identifying significant itemsets

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2009 .

Scalable and space-efficient Robust Matroid Center algorithms

A. Pietracaprina, G. Pucci, Matteo Ceccarello, 2023, Journal of Big Data.

Accurate MapReduce Algorithms for $k$-median and $k$-means in General Metric Spaces pdf

Geppino Pucci, Andrea Pietracaprina, Alessio Mazzetto, 2019, ISAAC.

Infectious Random Walks pdf

Eli Upfal, Geppino Pucci, Andrea Pietracaprina, 2010, ArXiv.

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing

Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi, 1999, Euro-Par.

Decomposable BSP: A Bandwidth-Latency Model for Parallel and Hierarchical Computation

Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi, 2007 .

Optimal many-to-one routing on the mesh with constant queues

Geppino Pucci, Andrea Pietracaprina, A. Pietracaprina, 2001, Inf. Process. Lett..

Matrix Computations

Robert H. Halstead, Jan Kochanowski, Andrzej Chrzeszczyk, 2011, Encyclopedia of Parallel Computing.

Store-and-Forward Multicast Routing on the Mesh

Geppino Pucci, Andrea Pietracaprina, Kieran T. Herley, 2008, Theory of Computing Systems.

Deterministic parallel backtrack search

Geppino Pucci, Andrea Pietracaprina, Kieran T. Herley, 2002, Theor. Comput. Sci..

On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation

Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi, 2001, International Conference on Computational Science.

Fast Deterministic Backtrack Search

Geppino Pucci, Andrea Pietracaprina, Kieran T. Herley, 1996, ICALP.

A Cost Model for Communication on a Symmetric MultiProcessor

Geppino Pucci, Andrea Pietracaprina, Lucia K. Dale, 1998 .

Fast Deterministic Parallel Branch-and-Bound

Geppino Pucci, Andrea Pietracaprina, Kieran T. Herley, 1999, Parallel Process. Lett..

Constructive deterministic PRAM simulation on a mesh-connected computer

Geppino Pucci, Andrea Pietracaprina, Jop F. Sibeyn, 1994, SPAA '94.

A practical constructive scheme for deterministic shared-memory access

Andrea Pietracaprina, Franco P. Preparata, F. Preparata, 1993, SPAA '93.

Practical constructive schemes for deterministic shared-memory access

Andrea Pietracaprina, Franco P. Preparata, F. Preparata, 2007, Theory of Computing Systems.

BSP versus LogP

Paul G. Spirakis, Geppino Pucci, Andrea Pietracaprina, 1999, Algorithmica.

The Potential of On-Chip Multiprocessing for QCD Machines

G. Bilardi, A. Pietracaprina, G. Pucci, 2005, HiPC.

Optimal Deterministic Protocols for Mobile Robots on a Grid ∗

Geppino Pucci, Andrea Pietracaprina, Roberto Grossi, 2003 .

Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree

Geppino Pucci, Andrea Pietracaprina, Kieran T. Herley, 2001, Inf. Comput..

Constructive, Deterministic Implementation of Shared Memory on Meshes

Geppino Pucci, Andrea Pietracaprina, Jop F. Sibeyn, 2000, SIAM J. Comput..

Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract)

K. Herley, A. Pietracaprina, G. Pucci, 1995, ESA.

Heterogeneous machine learning system for improving the diagnosis of primary aldosteronism

Geppino Pucci, Andrea Pietracaprina, Loris Nanni, 2015, Pattern Recognit. Lett..

Translating submachine locality into locality of reference

A. Pietracaprina, G. Pucci, C. Fantozzi, 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

Seamless Integration of Parallelism and Memory Hierarchy

Geppino Pucci, Andrea Pietracaprina, Carlo Fantozzi, 2002, ICALP.

Implementing shared memory on clustered machines

Geppino Pucci, Andrea Pietracaprina, Carlo Fantozzi, 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

On stalling in LogP

Geppino Pucci, Andrea Pietracaprina, Gianfranco Bilardi, 2000, J. Parallel Distributed Comput..

Message Passing

Robert H. Halstead, B. Uçar, P. Amestoy, 2011, Encyclopedia of Parallel Computing.

Packet routing in optimal time on a butterfly

Andrea Pietracaprina, Bruce E. Hajek, Arvind Krishna, 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.