Massively Parallel Algorithms for Large-Scale Graph Problems

Project Details

Acronym-
StatusActive
Effective start/end date01/09/202027/04/2025

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
  • A (3 + ε)-Approximate Correlation Clustering Algorithm in Dynamic Streams

    Cambus, M., Kuhn, F., Lindy, E., Pai, S. & Uitto, J., 2024, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Woodruff, D. P. (ed.). Society for Industrial and Applied Mathematics, p. 2861-2880 20 p.

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    Open Access
    3 Citations (Scopus)
  • Adaptive Massively Parallel Coloring in Sparse Graphs

    Latypov, R., Maus, Y., Pai, S. & Uitto, J., 17 Jun 2024, PODC 2024 - Proceedings of the 2024 ACM Symposium on Principles of Distributed Computing. ACM, p. 508-518 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    Open Access
    File
    8 Downloads (Pure)
  • The Message Complexity of Distributed Graph Optimization

    Dufoulon, F., Pai, S., Pandurangan, G., Pemmaraju, S. V. & Robinson, P., 2024, 15th Innovations in Theoretical Computer Science Conference, ITCS 2024. Guruswami, V. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 287).

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    Open Access
    File
    6 Downloads (Pure)