Mika Göös

Mika Göös is a Tenure Track Assistant Professor at EPFL in the School of Computer and Communication Sciences, Department of Computer Science. Previously, he held postdoctoral positions at Stanford, Princeton IAS, and Harvard. He earned his PhD from the University of Toronto under Toniann Pitassi, an MSc from the University of Oxford, and a BSc from Aalto University.

• Education
  • PhD: University of Toronto
  • MSc: University of Oxford
  • BSc: Aalto University

His research focuses on computational and communication complexity, exploring fundamental limits of algorithms and their applications in cryptography, circuit design, and distributed computing. He co-developed lifting theorems connecting query complexity to communication complexity and investigates lower bounds in randomized algorithms, TFNP problems, and monotone circuits.

Recent work emphasizes quantum communication advantages, direct sum theorems, and hardness condensation. His 15 most recent publications span topics like k-Hamming distance, parity decision trees, depth-3 circuits, and separations in TFNP classes.

Scientific awards include the Machtey Award (2015), Best Paper at DISC (2012), EATCS Distinguished Dissertation Award (2017), and Best Paper at FOCS (2020). He has advised numerous PhD and MSc students, including Weiqiang Yuan, Ziyi Guan, and Alexandros Hollender.

Currently, he leads a team comprising PhD students (Guan, Imbach, Riazanov, Sofronova, Yuan), postdocs (Nathaniel Harms), and scientists (Dmitry Sokolov). His work has appeared in top venues like STOC, FOCS, CCC, and ITCS, often with recorded talks and published in journals such as JACM and SICOMP.