Rustam Latypov

CS Theory Group, Aalto University

prof_pic.jpg

B315, CS Building

Konemiehentie 2, 02150

Espoo, Finland

A second-year PhD student, advised by Prof. Jara Uitto. Funded by the Computer Science department’s competitive funding grant.

Interested in the mathematical foundations of distributed systems and parallel computing, with an emphasis on the Massively Parallel Computation (MPC) model. Current research revolves around charting the complexity landscape of fundamental graph problems (locally checkable labeling problems), and exploring the algorithmic applications of powerful probabilistic tools (e.g., Lovász local lemma) in the context of MPC. Other interests include graph algorithms, graph theory and optimization.

Always up for new topics and collaboration.
firstname.lastname [at] aalto.fi

news

Nov 8, 2022 Attending the 2023 Swiss Winter School on Theoretical Computer Science. [link]
Jul 6, 2022 My advisee Hannes Sederholm has completed his Master’s thesis titled “Distributed Drawing of Planar Graphs in the CONGEST model”. [link]
Jun 23, 2021 The CS department has accepted my application and grants me funding for 24 months towards my doctoral studies. [link]

publications

  1. 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
  2. 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
  3. 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
  4. 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
  5. 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
  6. CoRR
    Deterministic 3-Coloring of Trees in the Sublinear MPC model
    Rustam Latypov, and Jara Uitto
    CoRR 2021

    arXiv