Rustam Latypov

CS Theory Group, Aalto University

prof_pic.jpg

A third-year PhD student, advised by Prof. Jara Uitto. My interests lie in the mathematical foundations of distributed and parallel computing, with an emphasis on the Massively Parallel Computation (MPC) model. Current research revolves around connectivity and coloring problems. Always up for new topics and collaboration.

firstname.lastname [at] aalto.fi
B315, Konemiehentie 2
02150, Espoo, Finland

news

Apr 29, 2024 Was awarded an encouragement grant (5000€) by The Finnish Foundation for Technology Promotion. [link]
Feb 12, 2024 Visiting Bernhard Haeupler at ETH Zurich until the end of May 2024.
Oct 20, 2023 Was awarded the Nokia Scholarship (5000€) by the Nokia Foundation. [link]
Jun 22, 2021 The CS department will fund my doctoral studies for 24 months. [link]

publications

  1. 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

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

  8. Deterministic 3-Coloring of Trees in the Sublinear MPC model
    Rustam Latypov, and Jara Uitto
    CoRR 2021