جست‌وجوی استاد و پژوهشگر

Jara Uittoمشاهده پروفایل

استادیار

• Massively Parallel Computation
• Distributed Computing
• Sublinear Computing
• +۳ مورد دیگر

Jara Uitto is an Assistant Professor in the Department of Computer Science. His research focuses on Massively Parallel Computation, Distributed Computing, and Sublinear Computing, with a particular emphasis on graph algorithms and distributed systems. Research Interests: Massively Parallel Computation (MPC) Distributed Algorithms and Symmetry Breaking Graph Theory and Edge Processing Algorithm Design for Sparse Graphs Approximation and Optimization in Streaming Models Key Project: Massively Parallel Algorithms for Large-Scale Graph Problems (2020-2024) , where he led research on optimizing algorithms for distributed and parallel computing environments. Publications highlight contributions to symmetry breaking, parallel coloring, and approximation algorithms in dynamic streams. His work bridges theoretical foundations with practical distributed computing challenges.

Jara Joel Olavi Uittoمشاهده پروفایل

استادیار

• Massively Parallel Computation
• Distributed Computing
• Sublinear Computing
• +۱ مورد دیگر

Jara Joel Olavi Uitto is an Assistant Professor at Aalto University, affiliated with the Department of Computer Science. His research focuses on cutting-edge computational paradigms. Massively Parallel Computation Distributed Computing Sublinear Computing Computer and Information Sciences For a comprehensive profile, visit his researcher profile .

• Distributed Computing
• Quantum Computing
• Cellular Automata
• +۳ مورد دیگر

Augusto Modanese is a Postdoctoral Researcher in the Department of Computer Science at Aalto University. His research focuses on distributed computing, quantum computing, and computational models like cellular automata and fungal automata. He investigates local problems in tree networks, quantum advantage limitations, and sublinear-time algorithms. Research Trends: Recent publications emphasize distributed quantum computing, algorithmic equivalence between quantum and classical models, and computational complexity in constrained topologies. Key themes include probabilistic cellular automata, graph coloring, and bio-inspired computing frameworks.