B315, CS Building
Konemiehentie 2, 02150
A second-year PhD student, advised by Prof. Jara Uitto. Funded by the Computer Science department’s competitive funding grant.
Interested in 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
|Jul 6, 2022||My advisee Hannes Sederholm has completed his Master’s thesis titled “Distributed Drawing of Planar Graphs in the CONGEST model”.|
|Jun 23, 2021||The CS department has accepted my application and grants me funding for 24 months towards my doctoral studies. [link]|
- Exponential Speedup Over Locality in MPC with Optimal MemoryIn 36th International Symposium on Distributed Computing (DISC) 2022
- Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on TreesIn 35th International Symposium on Distributed Computing (DISC) 2021
- Deterministic 3-Coloring of Trees in the Sublinear MPC modelCoRR 2021