Andrea Pietracaprina

According to our database1, Andrea Pietracaprina authored at least 81 papers between 1988 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints.
ACM Trans. Knowl. Discov. Data, 2020

Scalable Distributed Approximation of Internal Measures for Clustering Evaluation.
CoRR, 2020

Coreset-based Strategies for Robust Center-type Problems.
CoRR, 2020

Distributed Graph Diameter Approximation.
Algorithms, 2020

Dimensionality-adaptive k-center in sliding windows.
Proceedings of the 7th IEEE International Conference on Data Science and Advanced Analytics, 2020

2019
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially.
Proc. VLDB Endow., 2019

Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Fast Coreset-based Diversity Maximization under Matroid Constraints.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

2017
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension.
Proc. VLDB Endow., 2017

Clustering Uncertain Graphs.
Proc. VLDB Endow., 2017

2016
Network-Oblivious Algorithms.
J. ACM, 2016

On the complexity of the shortest-path broadcast problem.
Discret. Appl. Math., 2016

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Heterogeneous machine learning system for improving the diagnosis of primary aldosteronism.
Pattern Recognit. Lett., 2015

Space-efficient parallel algorithms for combinatorial search problems.
J. Parallel Distributed Comput., 2015

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space.
CoRR, 2014

2013
On the Expansion and Diameter of Bluetooth-Like Topologies.
Theory Comput. Syst., 2013

2012
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.
J. ACM, 2012

Space-round tradeoffs for MapReduce computations.
Proceedings of the International Conference on Supercomputing, 2012

2011
Models of Computation, Theoretical.
Proceedings of the Encyclopedia of Parallel Computing, 2011

MADMX: A Strategy for Maximal Dense Motif Extraction.
J. Comput. Biol., 2011

Tight bounds on information dissemination in sparse mobile networks.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010
Mining top-<i>K</i> frequent itemsets through progressive sampling.
Data Min. Knowl. Discov., 2010

Infectious Random Walks
CoRR, 2010

Mining Top-K Frequent Itemsets Through Progressive Sampling
CoRR, 2010

An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree
CoRR, 2010

2009
On the connectivity of Bluetooth-based <i>ad hoc</i> networks.
Concurr. Comput. Pract. Exp., 2009

MADMX: A Novel Strategy for Maximal Dense Motif Extraction.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Introduction.
Proceedings of the Euro-Par 2009 Parallel Processing, 2009

2008
Preface.
Theor. Comput. Sci., 2008

Store-and-Forward Multicast Routing on the Mesh.
Theory Comput. Syst., 2008

2007
Decomposable BSP.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Network-Oblivious Algorithms.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

On the Connectivity of Bluetooth-Based Ad Hoc Networks.
Proceedings of the Euro-Par 2007, 2007

Efficient Incremental Mining of Top-K Frequent Closed Itemsets.
Proceedings of the Discovery Science, 10th International Conference, 2007

Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer.
Proceedings of the First International Conference on Complex, 2007

2006
Translating submachine locality into locality of reference.
J. Parallel Distributed Comput., 2006

Cache-oblivious simulation of parallel programs.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
On stalling in LogP.
J. Parallel Distributed Comput., 2005

Optimal many-to-one routing on the mesh with constant queues.
Inf. Process. Lett., 2005

The Potential of On-Chip Multiprocessing for QCD Machines.
Proceedings of the High Performance Computing, 2005

Topic 12 Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004
Topic 13: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
A General Pram Simulation Scheme For Clustered Machines.
Int. J. Found. Comput. Sci., 2003

Mining Frequent Itemsets using Patricia Tries.
Proceedings of the FIMI '03, 2003

2002
Deterministic parallel backtrack search.
Theor. Comput. Sci., 2002

Optimal Deterministic Protocols for Mobile Robots on a Grid.
Inf. Comput., 2002

Distribution Sweeping on Clustered Machines with Hierarchical Memories.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Seamless Integration of Parallelism and Memory Hierarchy.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree.
Inf. Comput., 2001

One-to-Many routing on the mesh.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Implementing Shared Memory on Clustered Machines.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Constructive, Deterministic Implementation of Shared Memory on Meshes.
SIAM J. Comput., 2000

On the Space and Access Complexity of Computation DAGs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Predicting Performance on SMPs. A Case Study: The SGI Power Challenge.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Fast Deterministic Parallel Branch-and-Bound.
Parallel Process. Lett., 1999

Deterministic Branch-and-Bound on Distributed Memory Machines.
Int. J. Found. Comput. Sci., 1999

BSP versus LogP.
Algorithmica, 1999

The Complexity of Parallel Multisearch on Coarse-Grained Machines.
Algorithmica, 1999

Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract).
Proceedings of the Parallel and Distributed Processing, 1999

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
Deterministic Routing of h-relations on the Multibutterfly.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines.
Theory Comput. Syst., 1997

Practical Constructive Schemes for Deterministic Shared-Memory Access.
Theory Comput. Syst., 1997

1996
The Deterministic Complexity of Parallel Multisearch (Extended Abstract).
Proceedings of the Algorithm Theory, 1996

BSP vs LogP.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Fast Deterministic Backtrack Search.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Improved Deterministic PRAM Simulation on the Mesh.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract).
Proceedings of the Algorithms, 1995

1994
Sharper analysis of packet routing on a butterfly.
Networks, 1994

Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy.
Proceedings of the Algorithms, 1994

1993
On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem.
Proceedings of the STACS 93, 1993

A Practical Constructive Scheme for Deterministic Shared-Memory Access.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992
Analysis and Implementation of Parallel Uniform Hashing.
Int. J. Found. Comput. Sci., 1992

1991
Analysis of Parallel Uniform Hashing.
Inf. Process. Lett., 1991

Packet Routing in Optimal Time on a Butterfly.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1990
A New Scheme for the Deterministic Simulation of PRAMs in VLSI.
Algorithmica, 1990

1988
A Probabilistic Simulation of PRAMs on a Bounded Degree Network.
Inf. Process. Lett., 1988


  Loading...