Regular biography
Mika Göös is a Tenure Track Assistant Professor in the Department of Computer Science at École Polytechnique Fédérale de Lausanne. His research focuses on computational complexity, where he explores the resources required to solve problems and the relationships between different computational models. He teaches the course 'Computational Complexity' (CS-524), which provides an in-depth understanding of computational complexity and addresses fundamental open questions in the field. His office is located in Building INJ, Station 14, 1015 Lausanne.
Scholar-generated biography
Mika Göös is a researcher in Theoretical Computer Science, focusing on distributed computing, communication complexity, and proof complexity. His work explores locally checkable proofs, randomized communication protocols, and the complexity of distributed decision problems. Göös investigates the relationship between communication complexity and partition number, as well as the limitations of local approximation algorithms. His research also addresses the extension complexity of polytopes and the complexity of monotone circuits. By analyzing the landscape of communication complexity classes, he contributes to understanding the separation of complexity classes and the hardness of automating proof systems. His publications highlight the interplay between computational complexity, distributed algorithms, and proof complexity.