Rustam Latypov

Sublinear Algorithms Group, Aalto University

prof_pic.jpg

I’m a postdoc in the group of Jara Uitto at Aalto University with research and teaching experience in algorithm design and combinatorics. My research interests lie in the mathematical foundations of distributed and parallel computing. I specialize in fundamental graph problems in modern models of computing. During my free time I climb rocks.

github.com/rustamlatypov
firstname.lastname [at] aalto.fi
Room B315
Konemiehentie 2, 02150, Espoo, Finland

news

Apr 10, 2026 Defended my doctoral thesis, titled Massively Parallel Algorithms for Sparse Graphs.
Jan 19, 2025 Was on parental leave with my daughter, Liana, from July 2024 to January 2025.
Apr 29, 2024 Was awarded an encouragement grant (5000€) by The Finnish Foundation for Technology Promotion.
Feb 12, 2024 Visiting Bernhard Haeupler at ETH Zürich until the end of May 2024.
Oct 19, 2023 Was awarded the Nokia Scholarship (5000€) by the Nokia Foundation.

publications

  1. PhD Thesis
    Massively parallel algorithms for sparse graphs
    Rustam Latypov
    Aalto University publication series Doctoral Theses 82/ 2026

    isbn
  2. CoRR
    Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity
    Malte Baumecker, Rustam Latypov, Yannic Maus, and Jara Uitto
    CoRR 2026

    arXiv
  3. ICALP 25
    Near-Optimal Directed Low-Diameter Decompositions
    Karl Bringmann, Nick Fischer, Bernhard Haeupler, and Rustam Latypov
    In International Colloquium on Automata, Languages, and Programming (ICALP) 2025

    arXiv doi
  4. SOSA 25
    A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path
    Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, and Aurelio Sulser
    In SIAM Symposium on Simplicity in Algorithms (SOSA) 2025

    arXiv doi
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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 isbn doi journal
  11. 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 isbn doi
  12. CoRR
    Coloring Trees in Massively Parallel Computation
    Rustam Latypov, and Jara Uitto
    CoRR 2021

    arXiv