Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Fully Scalable MPC Algorithms for Euclidean k-Center
Artur Czumaj, Guichen Gao, Mohsen Ghaffari +1
The -center problem is a fundamental optimization problem with numerous applications in machine learning, data analysis, data mining, and communication networks. The -center…
cs.DS2025
Streaming Graph Algorithms in the Massively Parallel Computation Model
Artur Czumaj, Gopinath Mishra, Anish Mukherjee
We initiate the study of graph algorithms in the streaming setting on massive distributed and parallel systems inspired by practical data processing systems. The objective is to de…
cs.DS2024
Log Diameter Rounds MST Verification and Sensitivity in MPC
Sam Coy, Artur Czumaj, Gopinath Mishra +1
We consider two natural variants of the problem of minimum spanning tree (MST) of a graph in the parallel setting: MST verification (verifying if a given tree is an MST) and the se…