Tools to generate and check consistency of model classes for Java PathFinder. - Matteo Ceccarello; Nastaran Shafiei (ACM SIGSOFT Softw. Eng. Notes, 2012)

Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (CoRR, 2014)

Automated generation of model classes for Java PathFinder. - Matteo Ceccarello; Oksana Tkachuk (ACM SIGSOFT Softw. Eng. Notes, 2014)

Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. - Matteo Ceccarello; Francesco Silvestri 001 (ALENEX, 2015)

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (SPAA, 2015)

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (IPDPS, 2016)

Clustering Uncertain Graphs. - Matteo Ceccarello; Carlo Fantozzi; Andrea Pietracaprina; Geppino Pucci; Fabio Vandin (Proc. VLDB Endow., 2017)

MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (Proc. VLDB Endow., 2017)

Fast Coreset-based Diversity Maximization under Matroid Constraints. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (WSDM, 2018)

Benchmarking Nearest Neighbor Search: Influence of Local Intrinsic Dimensionality and Result Diversity in Real-World Datasets. - Martin Aumüller 001; Matteo Ceccarello (EDML@SDM, 2019)

The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search. - Martin Aumüller 001; Matteo Ceccarello (SISAP, 2019)

FRESH: Fréchet Similarity with Hashing. - Matteo Ceccarello; Anne Driemel; Francesco Silvestri 001 (WADS, 2019)

Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (Proc. VLDB Endow., 2019)

Running Experiments with Confidence and Sanity. - Martin Aumüller 001; Matteo Ceccarello (SISAP, 2020)

Distributed Graph Diameter Approximation. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (Algorithms, 2020)

A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (ACM Trans. Knowl. Discov. Data, 2020)

The role of local dimensionality measures in benchmarking nearest neighbor search. - Martin Aumüller 001; Matteo Ceccarello (Inf. Syst., 2021)

What's New in Temporal Databases? - Johann Gamper; Matteo Ceccarello; Anton Dignös (ADBIS, 2022)

Efficient Computation of All-Window Length Correlations. - Adam Charane; Matteo Ceccarello; Anton Dignös; Johann Gamper (DB&IS, 2022)

Implementing Distributed Similarity Joins using Locality Sensitive Hashing. - Martin Aumüller 001; Matteo Ceccarello (EDBT, 2022)

Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees. - Matteo Ceccarello; Johann Gamper (Proc. VLDB Endow., 2022)

Solving k-Closest Pairs in High-Dimensional Data. - Martin Aumüller 001; Matteo Ceccarello (SISAP, 2023)

Recent Approaches and Trends in Approximate Nearest Neighbor Search, with Remarks on Benchmarking. - Martin Aumüller 001; Matteo Ceccarello (IEEE Data Eng. Bull., 2023)

Scalable and space-efficient Robust Matroid Center algorithms. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Federico Soldà (J. Big Data, 2023)

Comparison of Measures for Characterizing the Difficulty of Time Series Classification. - Adam Charane; Matteo Ceccarello; Johann Gamper (DaWaK, 2024)

Shapelets Evaluation using Silhouettes for Time Series Classification. - Adam Charane; Matteo Ceccarello; Johann Gamper (DOLAP, 2024)

Scaling Expected Force: Efficient Identification of Key Nodes in Network-Based Epidemic Models. - Paolo Sylos Labini; Andrej Jurco; Matteo Ceccarello; Stefano Guarino; Enrico Mastrostefano; Flavio Vella (PDP, 2024)

Fast and Accurate Fair k-Center Clustering in Doubling Metrics. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci (WWW, 2024)

Center-Based Approximation of a Drifting Distribution. - Alessio Mazzetto; Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Eli Upfal (ALT, 2025)

LEIT-motifs: Scalable Motif Mining in Multidimensional Time Series. - Matteo Ceccarello; Francesco Pio Monaco; Francesco Silvestri 001 (CoRR, 2025)

Fair Center Clustering in Sliding Windows. - Matteo Ceccarello; Andrea Pietracaprina; Geppino Pucci; Francesco Visonà (CoRR, 2025)

VIBE: Vector Index Benchmark for Embeddings. - Elias Jääsaari; Ville Hyvönen; Matteo Ceccarello; Teemu Roos; Martin Aumüller 001 (CoRR, 2025)

Indexing temporal relations for range-duration queries. - Matteo Ceccarello; Anton Dignös; Johann Gamper; Christina Khnaisser (Distributed Parallel Databases, 2025)