| Exponential speedup over locality in MPC with optimal memory A Balliu, S Brandt, M Fischer, R Latypov, Y Maus, D Olivetti, J Uitto arXiv preprint arXiv:2208.09453, 2022 | 8 | 2022 |
| Optimal deterministic massively parallel connectivity on forests A Balliu, R Latypov, Y Maus, D Olivetti, J Uitto Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 7 | 2023 |
| Fast dynamic programming in trees in the mpc model C Gupta, R Latypov, Y Maus, S Pai, S Särkkä, J Studený, J Suomela, ... Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 3 | 2023 |
| Brief announcement: Memory efficient massively parallel algorithms for LCL problems on trees S Brandt, R Latypov, J Uitto 35th International Symposium on Distributed Computing (DISC 2021) 209, 50, 2021 | 2 | 2021 |
| Conditionally Optimal Parallel Coloring of Forests C Grunau, R Latypov, Y Maus, S Pai, J Uitto arXiv preprint arXiv:2308.00355, 2023 | 1 | 2023 |
| Adaptive Massively Parallel Coloring in Sparse Graphs R Latypov, Y Maus, S Pai, J Uitto arXiv preprint arXiv:2402.13755, 2024 | | 2024 |
| Adaptive Massively Parallel Connectivity in Optimal Space R Latypov, J Łącki, Y Maus, J Uitto Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | | 2023 |
| Adaptive Massively Parallel Connectivity in Optimal Space J Uitto, J Łącki, R Latypov, Y Maus | | 2023 |
| Towards a Complexity Classification of LCL Problems in Massively Parallel Computation S Brandt, R Latypov, J Uitto arXiv preprint arXiv:2112.09479, 2021 | | 2021 |
| Coloring Trees in Massively Parallel Computation R Latypov, J Uitto arXiv preprint arXiv:2105.13980, 2021 | | 2021 |
| Coloring Sparse Graphs with 3 Colors in the Massively Parallel Computation (MPC) Model Using Strongly Sublinear Memory R Latypov | | 2021 |
| Inverse problem for resistor networks R Latypov | | 2018 |
