Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. - Mélanie Cambus; Davin Choo; Havu Miikonen; Jara Uitto (DISC, 2021)

Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. - Mélanie Cambus; Fabian Kuhn; Shreyas Pai; Jara Uitto (DISC, 2023)

Improved Solutions for Multidimensional Approximate Agreement via Centroid Computation. - Mélanie Cambus; Darya Melnyk (CoRR, 2023)

A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams. - Mélanie Cambus; Fabian Kuhn; Etna Lindy; Shreyas Pai; Jara Uitto (SODA, 2024)

Approximate Agreement Algorithms for Byzantine Collaborative Learning. - Mélanie Cambus; Darya Melnyk; Tijana Milentijevic; Stefan Schmid 001 (SPAA, 2025)

A (3+ε)-Approximate Correlation Clustering Algorithm in Dynamic Streams. - Mélanie Cambus; Fabian Kuhn; Etna Lindy; Shreyas Pai; Jara Uitto (TheoretiCS, 2025)

Centroid Approximation for Byzantine-Tolerant Federated Learning. - Mélanie Cambus; Darya Melnyk; Tijana Milentijevic; Stefan Schmid 001 (CoRR, 2025)