Geppino Pucci

Int. J. Data Sci. Anal., 2022

k-Center Clustering with Outliers in Sliding Windows.

[BibT_eX]

[DOI]

Paolo Pellizzoni

Algorithms, 2022

2021

Scalable Distributed Approximation of Internal Measures for Clustering Evaluation.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

2020

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

[BibT_eX]

[DOI]

Matteo Ceccarello

ACM Trans. Knowl. Discov. Data, 2020

Coreset-based Strategies for Robust Center-type Problems.

[BibT_eX]

[DOI]

Federico Soldà

CoRR, 2020

Distributed Graph Diameter Approximation.

[BibT_eX]

[DOI]

Algorithms, 2020

Dimensionality-adaptive k-center in sliding windows.

[BibT_eX]

[DOI]

Paolo Pellizzoni

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.

[BibT_eX]

[DOI]

Matteo Ceccarello

Proc. VLDB Endow., 2019

Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces.

[BibT_eX]

[DOI]

Alessio Mazzetto

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Fast Coreset-based Diversity Maximization under Matroid Constraints.

[BibT_eX]

[DOI]

Matteo Ceccarello

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.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Clustering Uncertain Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

2016

Network-Oblivious Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2016

On the complexity of the shortest-path broadcast problem.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Pierre Fraigniaud

Magnús M. Halldórsson

Hovhannes A. Harutyunyan

Chiara Pierucci

Discret. Appl. Math., 2016

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015

Heterogeneous machine learning system for improving the diagnosis of primary aldosteronism.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2015

Space-efficient parallel algorithms for combinatorial search problems.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

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

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014

Foreword: Parallelism in Algorithms and Architectures.

[BibT_eX]

[DOI]

Victor Luchangco

Rajmohan Rajaraman

Theory Comput. Syst., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

2013

On the Expansion and Diameter of Bluetooth-Like Topologies.

[BibT_eX]

[DOI]

Alberto Pettarin

Theory Comput. Syst., 2013

2012

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.

[BibT_eX]

[DOI]

J. ACM, 2012

Space-round tradeoffs for MapReduce computations.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Supercomputing, 2012

Topic 12: Theory and Algorithms for Parallel Computation.

[BibT_eX]

[DOI]

Christos D. Zaroliagis

Henning Meyerhenke

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011

Universality in VLSI Computation.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Parallel Computing, 2011

MADMX: A Strategy for Maximal Dense Motif Extraction.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

Tight bounds on information dissemination in sparse mobile networks.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010

Infectious Random Walks

[BibT_eX]

[DOI]

CoRR, 2010

2009

Foreword.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Theory Comput. Syst., 2009

On the connectivity of Bluetooth-based <i>ad hoc</i> networks.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2009

MADMX: A Novel Strategy for Maximal Dense Motif Extraction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

2008

Area-time tradeoffs for universal VLSI circuits.

[BibT_eX]

[DOI]

Sandeep N. Bhatt

Theor. Comput. Sci., 2008

Store-and-Forward Multicast Routing on the Mesh.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Topic 12: Theory and Algorithms for Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2008, 2008

2007

Decomposable BSP.

[BibT_eX]

[DOI]

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

Network-Oblivious Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

On the Connectivity of Bluetooth-Based Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2007, 2007

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

[BibT_eX]

[DOI]

Proceedings of the First International Conference on Complex, 2007

2006

Translating submachine locality into locality of reference.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

A Static Parallel Multifrontal Solver for Finite Element Meshes.

[BibT_eX]

[DOI]

Alberto Bertoldo

Mauro Bianco

Proceedings of the Parallel and Distributed Processing and Applications, 2006

Cache-oblivious simulation of parallel programs.

[BibT_eX]

[DOI]

Francesco Silvestri

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005

On stalling in LogP.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2005

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

The Potential of On-Chip Multiprocessing for QCD Machines.

[BibT_eX]

[DOI]

Sebastiano Fabio Schifano

Raffaele Tripiccione

Proceedings of the High Performance Computing, 2005

2004

A Fast Multifrontal Solver for Non-linear Multi-physics Problems.

[BibT_eX]

[DOI]

Alberto Bertoldo

Mauro Bianco

Proceedings of the Computational Science, 2004

2003

A General Pram Simulation Scheme For Clustered Machines.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

2002

Deterministic parallel backtrack search.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Optimal Deterministic Protocols for Mobile Robots on a Grid.

[BibT_eX]

[DOI]

Roberto Grossi

Inf. Comput., 2002

An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems.

[BibT_eX]

[DOI]

Bernhard A. Schrefler

Proceedings of the Computational Science - ICCS 2002, 2002

Seamless Integration of Parallelism and Memory Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

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

[BibT_eX]

[DOI]

Inf. Comput., 2001

One-to-Many routing on the mesh.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Implementing Shared Memory on Clustered Machines.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

2000

Constructive, Deterministic Implementation of Shared Memory on Meshes.

[BibT_eX]

[DOI]

Jop F. Sibeyn

SIAM J. Comput., 2000

Predicting Performance on SMPs. A Case Study: The SGI Power Challenge.

[BibT_eX]

[DOI]

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

A Compact, Thread-Safe Communication Library for Efficient Cluster Computing.

[BibT_eX]

[DOI]

Marco Danelutto

Proceedings of the High-Performance Computing and Networking, 8th International Conference, 2000

On the Predictive Quality of BSP-like Cost Functions for NOWs.

[BibT_eX]

[DOI]

Mauro Bianco

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999

Fast Deterministic Parallel Branch-and-Bound.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1999

Deterministic Branch-and-Bound on Distributed Memory Machines.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

BSP versus LogP.

[BibT_eX]

[DOI]

Algorithmica, 1999

Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Processing, 1999

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

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

Area-Universal Circuits with Constant Slowdown.

[BibT_eX]

[DOI]

Sandeep N. Bhatt

Proceedings of the 18th Conference on Advanced Research in VLSI (ARVLSI '99), 1999

1998

Tight Bounds on Parallel List Marking.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

1997

The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

1996

On Bufferless Routing of Variable Length Messages in Leveled Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1996

BSP vs LogP.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Fast Deterministic Backtrack Search.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

Parallel Algorithms for Priority Queue Operations.

[BibT_eX]

[DOI]

Maria Cristina Pinotti

Theor. Comput. Sci., 1995

Improved Deterministic PRAM Simulation on the Mesh.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Counting the Number of Fault Patterns in Redundant VLSI Arrays.

[BibT_eX]

[DOI]

Linda Pagli

Inf. Process. Lett., 1994

Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.

[BibT_eX]

[DOI]

Jop F. Sibeyn

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Scattering and Gathering Messages in Networks of Processors.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

A New Approach to the Modeling of Recovery Block Structures.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1992

Analysis and Implementation of Parallel Uniform Hashing.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

Three non Conventional Paradigms of Parallel Computation.

[BibT_eX]

[DOI]

Linda Pagli

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991

Parallel Priority Queues.

[BibT_eX]

[DOI]

Maria Cristina Pinotti

Inf. Process. Lett., 1991

Analysis of Parallel Uniform Hashing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1990

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

[BibT_eX]

[DOI]

Algorithmica, 1990

On the modelling and testing of recovery block structures.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1988

A Probabilistic Simulation of PRAMs on a Bounded Degree Network.

[BibT_eX]

[DOI]