Hossein Vahidi

Doctoral Researcher
Department of Computer Science
Aalto University

Office: B335 · Computer Science building

Email: hossein.vahidi@aalto.fi

Portrait of Hossein Vahidi
Photo by: Avinandan Das
LinkedIn Google Scholar DBLP arXiv ORCID ResearcherID GitHub

I am a doctoral researcher in the Distributed Algorithms Group headed by Prof. Jukka Suomela. I am broadly interested in the theoretical foundations of distributed and parallel computing, computational complexity, and algorithm design, particularly for graph problems. Recently, I have been studying primitives such as matrix multiplication in parallel computing models, including MPC, Congested Clique, NCC, and low-bandwidth models.

Publications

Read more · All publications (PDF)

2026

  1. Rectangular Matrix Multiplication in the Low-Bandwidth Model

    Chetan Gupta, Jukka Suomela, and Hossein Vahidi

    Preprint · 2026

    arXiv

2025

  1. Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity

    Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, and Hossein Vahidi

    Conference paper · SIROCCO 2025

    arXiv Conference version

  2. Complexity of computing the anti-Ramsey numbers for paths

    Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, and Hossein Vahidi

    Journal article · Theoretical Computer Science 2025

    arXiv Journal version Conference version

2024

  1. Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity

    Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, and Hossein Vahidi

    Brief announcement · SPAA 2024

    arXiv [full paper] Conference version

2023

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

    Conference paper · SPAA 2023

    arXiv Conference version

2021

  1. Approximate Minimum Directed Spanning Trees Under Congestion

    Christoph Lenzen and Hossein Vahidi

    Conference paper · SIROCCO 2021

    Conference version

2020

  1. Complexity of Computing the Anti-Ramsey Numbers for Paths

    Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, and Hossein Vahidi

    Conference paper · MFCS 2020

    arXiv Conference version Journal version

Teaching and advising

Thesis advising

Academic service

Reviewer
DISC 2026 OPODIS 2026 DISC 2023 PODC 2023 SIROCCO 2021
Local organizing team member
ALGO 2018

Education

  • Doctoral studies in Computer ScienceAalto University, Finland · 2022–present
  • M.Sc. in Computer ScienceSaarland University, Germany · 2018–2021
  • B.Sc. in Computer EngineeringShahid Bahonar University, Iran · 2014–2018