2023 CoRR Adaptive Massively Parallel Connectivity in Optimal Space Jakub Łącki, Rustam Latypov, Yannic Maus, and Jara Uitto CoRR 2023 arXiv SODA Optimal Deterministic Massively Parallel Connectivity on Forests Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto In ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 arXiv doi 2022 DISC Exponential Speedup over Locality in MPC with Optimal Memory Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto In International Symposium on Distributed Computing (DISC) 2022 Invited to the Special Issue of DISC 2022 arXiv doi 2021 DISC Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees Sebastian Brandt, Rustam Latypov, and Jara Uitto In International Symposium on Distributed Computing (DISC) 2021 arXiv doi CoRR Deterministic 3-Coloring of Trees in the Sublinear MPC model Rustam Latypov, and Jara Uitto CoRR 2021 arXiv