Mika Göös

Sup. I am an assistant professor at EPFL in the Theory Group.

Previously, I was a post-doc at Stanford, Princeton IAS, and Harvard. I completed my PhD at University of Toronto under the scrutiny of Toniann Pitassi. I obtained my MSc from the University of Oxford and my BSc from Aalto University.

[ Google scholar ]



Current team:


  1. One-Way Functions vs. TFNP: Simpler and Improved
    with Lukáš Folwarczný, Pavel Hubáček, Gilbert Maystre, and Weiqiang Yuan
    Manuscript, 2023
  2. Top-Down Lower Bounds for Depth-Four Circuits
    with Artur Riazanov, Anastasia Sofronova, and Dmitry Sokolov
  3. Depth-3 Circuits for Inner Product
    with Ziyi Guan and Tiberiu Mosnoi
  4. Communication Complexity of Collision
    with Siddhartha Jain
  5. Randomised Composition and Small-Bias Minimax
    with Shalev Ben-David, Eric Blais, and Gilbert Maystre
  6. Separations in Proof Complexity and TFNP
    with Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, and Ran Tao
  7. Further Collapses in TFNP
    with Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, and Ran Tao
  8. Lower Bounds for Unambiguous Automata via Communication Complexity
    with Stefan Kiefer, and Weiqiang Yuan
  9. Proofs, Circuits, and Communication
    with Susanna de Rezende and Robert Robere
  10. On Semi-Algebraic Proofs and Algorithms
    with Noah Fleming, Stefan Grosser, and Robert Robere
  11. Unambiguous DNFs and Alon–Saks–Seymour
    with Kaspars Balodis, Shalev Ben-David, Siddhartha Jain, and Robin Kothari
  12. A Majority Lemma for Randomised Query Complexity
    with Gilbert Maystre
  13. On the Power and Limitations of Branch and Cut
    with Noah Fleming, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
  14. Automating Algebraic Proof Systems is NP-Hard
    with Susanna de Rezende, Jakob Nordström, Toniann Pitassi, Robert Robere, and Dmitry Sokolov
  15. Automating Cutting Planes is NP-Hard
    with Sajin Koroth, Ian Mertz, and Toniann Pitassi
  16. When Is Amplification Necessary for Composition in Randomized Query Complexity?
    with Shalev Ben-David, Robin Kothari, and Thomas Watson
  17. The Power of Many Samples in Query Complexity
    with Andrew Bassilakis, Andrew Drucker, Lunjia Hu, Weiyun Ma, and Li-Yang Tan
  18. On the Complexity of Modulo-q Arguments and the Chevalley–Warning Theorem
    with Pritish Kamath, Katerina Sotiraki, and Manolis Zampetakis
  19. A Lower Bound for Sampling Disjoint Sets
    with Thomas Watson
  20. String Matching: Communication, Circuits, and Learning
    with Alexander Golovnev, Daniel Reichman, and Igor Shinkar
  21. Adventures in Monotone Complexity and TFNP
    with Pritish Kamath, Robert Robere, and Dmitry Sokolov
  22. Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
    with Aviad Rubinstein
  23. A Tight Lower Bound for Entropy Flattening
    with Yi-Hsiu Chen, Salil Vadhan, and Jiapeng Zhang
  24. Monotone Circuit Lower Bounds from Resolution
    with Ankit Garg, Pritish Kamath, and Dmitry Sokolov
  25. Query-to-Communication Lifting for BPP
    with Toniann Pitassi and Thomas Watson
  26. Query-to-Communication Lifting for PNP
    with Pritish Kamath, Toniann Pitassi, and Thomas Watson
  27. Extension Complexity of Independent Set Polytopes
    with Rahul Jain and Thomas Watson
  28. Separations in Communication Complexity Using Cheat Sheets and Information Complexity
    with Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Rahul Jain, Robin Kothari, Troy Lee, and Miklos Santha
  29. Non-local Probes Do Not Help with Many Graph Problems
    with Juho Hirvonen, Reut Levi, Moti Medina, and Jukka Suomela
  30. A Composition Theorem for Conical Juntas
    with T.S. Jayram
  31. Randomized Communication vs. Partition Number
    with T.S. Jayram, Toniann Pitassi, and Thomas Watson
  32. Deterministic Communication vs. Partition Number
    with Toniann Pitassi and Thomas Watson
  33. The Landscape of Communication Complexity Classes
    with Toniann Pitassi and Thomas Watson
  34. Lower Bounds for Clique vs. Independent Set
  35. Rectangles Are Nonnegative Juntas
    with Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman
  36. Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication
    with Toniann Pitassi and Thomas Watson
  37. Communication Complexity of Set-Disjointness for All Probabilities
    with Thomas Watson
  38. Communication Lower Bounds via Critical Block Sensitivity
    with Toniann Pitassi
  39. Linear-in-Delta Lower Bounds in the LOCAL Model
    with Juho Hirvonen and Jukka Suomela
  40. Separating OR, SUM, and XOR Circuits
    with Magnus Find, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen
  41. What Can Be Decided Locally Without Identifiers?
    with Pierre Fraigniaud, Amos Korman, and Jukka Suomela
  42. Randomized Distributed Decision
    with Pierre Fraigniaud, Amos Korman, Merav Parter, and David Peleg
  43. No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover
    with Jukka Suomela
  44. Lower Bounds for Local Approximation
    with Juho Hirvonen and Jukka Suomela
  45. Locally Checkable Proofs in Distributed Computing
    with Jukka Suomela
  46. Search Methods for Tile Sets in Patterned DNA Self-Assembly
    with Tuomo Lempiäinen, Eugen Czeizler, and Pekka Orponen


For a laugh/nostalgic purposes:

Past advising