Juho Hirvonen

Orcid: 0000-0001-8268-1070

According to our database1, Juho Hirvonen authored at least 34 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast, Fair and Truthful Distributed Stable Matching for Common Preferences.
CoRR, 2024

2023
On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022
Sparse Matrix Multiplication in the Low-Bandwidth Model.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Local Mending.
Proceedings of the Structural Information and Communication Complexity, 2022

On the Price of Locality in Static Fast Rerouting.
Proceedings of the 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2022

2021
A hierarchy of local decision.
Theor. Comput. Sci., 2021

Lower Bounds for Maximal Matchings and Maximal Independent Sets.
J. ACM, 2021

Improved distributed Δ-coloring.
Distributed Comput., 2021

Redundancy in distributed proofs.
Distributed Comput., 2021

Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory.
CoRR, 2021

On the Feasibility of Perfect Resilience with Local Fast Failover.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2020
Improved distributed degree splitting and edge coloring.
Distributed Comput., 2020

Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Classification of Distributed Binary Labeling Problems.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Classification of Distributed Binary Labeling Problems.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Locality of Not-so-Weak Coloring.
Proceedings of the Structural Information and Communication Complexity, 2019

Hardness of Minimal Symmetry Breaking in Distributed Computing.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Power of Preprocessing in Decentralized Network Optimization.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

2018
Node labels in local decision.
Theor. Comput. Sci., 2018

Local Verification of Global Proofs.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

New classes of distributed time complexity.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Improved Distributed Delta-Coloring.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Linear-in-Δ lower bounds in the LOCAL model.
Distributed Comput., 2017

Large Cuts with Local Algorithms on Triangle-Free Graphs.
Electron. J. Comb., 2017

LCL Problems on Grids.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Lower bounds in distributed computing.
PhD thesis, 2016

Deterministic local algorithms, unique identifiers, and fractional graph colouring.
Theor. Comput. Sci., 2016

Non-local Probes Do Not Help with Many Graph Problems.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

A lower bound for the distributed Lovász local lemma.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015
Non-Local Probes Do Not Help with Graph Problems.
CoRR, 2015

Locally Optimal Load Balancing.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014
Linear-in-delta lower bounds in the LOCAL model.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Lower bounds for local approximation.
J. ACM, 2013

2012
Distributed maximal matching: greedy is optimal.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012


  Loading...