We stand with Ukraine  

Hossein Vahidi

Orcid: 0000-0002-0040-1213

Affiliations:
  • Aalto University, Finland
  • Max Planck Institute for Informatics (MPII), Saarbrücken, Germany (former)


According to our database1, Hossein Vahidi authored at least 6 papers between 2018 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Complexity of computing the anti-Ramsey numbers for paths.
[BibTeX]
[DOI]
Saeed Akhoondian Amiri
,
Alexandru Popa
,
Mohammad Roghani
,
Golnoosh Shahkarami
,
Reza Soltani
,
Hossein Vahidi
Theor. Comput. Sci., 2025

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
[BibTeX]
[DOI]
Chetan Gupta
,
Janne H. Korhonen
,
Jan Studený
,
Jukka Suomela
,
Hossein Vahidi
Proceedings of the Structural Information and Communication Complexity, 2025

2024
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.
[BibTeX]
[DOI]
Chetan Gupta
,
Janne H. Korhonen
,
Jan Studený
,
Jukka Suomela
,
Hossein Vahidi
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023
Fast Dynamic Programming in Trees in the MPC Model.
[BibTeX]
[DOI]
Chetan Gupta
,
Rustam Latypov
,
Yannic Maus
,
Shreyas Pai
,
Simo Särkkä
,
Jan Studený
,
Jukka Suomela
,
Jara Uitto
,
Hossein Vahidi
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2021
Approximate Minimum Directed Spanning Trees Under Congestion.
[BibTeX]
[DOI]
Christoph Lenzen
,
Hossein Vahidi
Proceedings of the Structural Information and Communication Complexity, 2021

2018
Complexity of computing the anti-Ramsey numbers.
[BibTeX]
[DOI]
Saeed Akhoondian Amiri
,
Alexandru Popa
,
Golnoosh Shahkarami
,
Hossein Vahidi
CoRR, 2018


  Loading...