2025 SOSA 25 A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, and Aurelio Sulser In SIAM Symposium on Simplicity in Algorithms (SOSA) 2025 arXiv 2024 PODC 24 Adaptive Massively Parallel Coloring in Sparse Graphs Rustam Latypov, Yannic Maus, Shreyas Pai, and Jara Uitto In ACM Symposium on Principles of Distributed Computing (PODC) 2024 arXiv doi 2023 DISC 23 Conditionally Optimal Parallel Coloring of Forests Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, and Jara Uitto In International Symposium on Distributed Computing (DISC) 2023 arXiv doi SPAA 23 Adaptive Massively Parallel Connectivity in Optimal Space Rustam Latypov, Jakub Łącki, Yannic Maus, and Jara Uitto In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2023 arXiv doi SPAA 23 Fast Dynamic Programming in Trees in the MPC Model Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, and Hossein Vahidi In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2023 arXiv doi SODA 23 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 22 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 21 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 Coloring Trees in Massively Parallel Computation Rustam Latypov, and Jara Uitto CoRR 2021 arXiv