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