معرفی
Jan Studeny is a Visiting Professor at the Department of Computer Science, Aalto University. He holds a Doctor of Technology (Tekn. toht.) in Computer Science from Aalto University, awarded in November 2024. His research focuses on distributed algorithms, graph theory, automata theory, and parallel computing, with contributions to distributed systems and algorithm design. Recent work includes studies on localized problems in trees, MPC model optimizations, and automata-theoretic approaches to distributed graph problems.
Education:
- Doctor of Technology (Tekn. toht.), Computer Science, Aalto University (2024)
Research Interests: Jan's work emphasizes distributed computing challenges, graph algorithms, and automata theory. He explores efficient distributed algorithms for bounded-degree graphs, dynamic programming in trees, and locally checkable problems in rooted trees. His methodologies often integrate computational models and asymptotic analysis to solve complex algorithmic problems.
Collaborations: Active in international conferences such as OPODIS and SPAA, with collaborations on distributed systems and theoretical computer science. Notable contributions include presentations at the Swedish Summer School in Computer Science (2022) and conference talks on locally checkable problems (2021).
Labs & Teams: Engaged in collaborative research groups focused on distributed algorithms and graph theory, though specific lab affiliations are not detailed in the provided text.
