J
Juho Hirvonen
Researcher at Aalto University
Publications - 58
Citations - 985
Juho Hirvonen is an academic researcher from Aalto University. The author has contributed to research in topics: Distributed algorithm & Upper and lower bounds. The author has an hindex of 18, co-authored 55 publications receiving 801 citations. Previous affiliations of Juho Hirvonen include Centre national de la recherche scientifique & Helsinki University of Technology.
Papers
More filters
Proceedings ArticleDOI
A lower bound for the distributed Lovász local lemma
Sebastian Brandt,Orr Fischer,Juho Hirvonen,Barbara Keller,Tuomo Lempiäinen,Joel Rybicki,Jukka Suomela,Jara Uitto +7 more
TL;DR: In this paper, it was shown that any randomised Monte Carlo distributed algorithm for the Lovasz local lemma requires O(log log n) communication rounds, assuming that it finds a correct assignment with high probability.
Proceedings ArticleDOI
Lower Bounds for Maximal Matchings and Maximal Independent Sets
TL;DR: In this paper, it was shown that maximal matchings and maximal independent sets cannot be found in O(Δ + log log n/ log log log N) rounds with any randomized algorithm in the LOCAL model of distributed computing.
Posted Content
A Lower Bound for the Distributed Lov\'asz Local Lemma
Sebastian Brandt,Orr Fischer,Juho Hirvonen,Barbara Keller,Tuomo Lempiäinen,Joel Rybicki,Jukka Suomela,Jara Uitto +7 more
TL;DR: It is shown that any randomised Monte Carlo distributed algorithm for the Lovász local lemma requires Omega(log log n) communication rounds, assuming that it finds a correct assignment with high probability.
Journal ArticleDOI
Lower bounds for local approximation
TL;DR: It is shown that if a local algorithm finds a constant-factor approximation of a simple PO-checkable graph problem with the help of unique identifiers, then the same approximation ratio can be achieved on anonymous networks.
Proceedings ArticleDOI
New classes of distributed time complexity
Alkida Balliu,Juho Hirvonen,Janne H. Korhonen,Tuomo Lempiäinen,Dennis Olivetti,Jukka Suomela +5 more
TL;DR: This work presents a general technique for engineering LCL problems with numerous different deterministic time complexities, including Θ(log α n) for any α ≥ 1, 2Θ( logα n)For any α ≤ 1 in the high end of the complexity spectrum, and