Me

Mika Göös

Sup. I am currently a post-doctoral fellow in the ToC group at Harvard.

I completed my PhD at University of Toronto under the watchful eye of Toniann Pitassi. Before Toronto I worked in the New Paradigms in Computing group at the University of Helsinki. I obtained my BSc from Aalto University, and my MSc from the University of Oxford.

E-mail:    mika@seas.harvard.edu

Publications

  1. Query-to-Communication Lifting for BPP
    with Toniann Pitassi and Thomas Watson
    Manuscript, March 2017
  2. Query-to-Communication Lifting for PNP
    with Pritish Kamath, Toniann Pitassi, and Thomas Watson
    Manuscript, February 2017
  3. Extension Complexity of Independent Set Polytopes
    with Rahul Jain and Thomas Watson
  4. 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
  5. Non-local Probes Do Not Help with Many Graph Problems
    with Juho Hirvonen, Reut Levi, Moti Medina, and Jukka Suomela
  6. A Composition Theorem for Conical Juntas
    with T.S. Jayram
  7. Randomized Communication vs. Partition Number
    with T.S. Jayram, Toniann Pitassi, and Thomas Watson
    Manuscript, October 2015
  8. Deterministic Communication vs. Partition Number
    with Toniann Pitassi and Thomas Watson
  9. The Landscape of Communication Complexity Classes
    with Toniann Pitassi and Thomas Watson
  10. Lower Bounds for Clique vs. Independent Set
  11. Rectangles Are Nonnegative Juntas
    with Shachar Lovett, Raghu Meka, Thomas Watson, and David Zuckerman
  12. Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication
    with Toniann Pitassi and Thomas Watson
  13. Communication Complexity of Set-Disjointness for All Probabilities
    with Thomas Watson
  14. Communication Lower Bounds via Critical Block Sensitivity
    with Toniann Pitassi
  15. Linear-in-Δ Lower Bounds in the LOCAL Model
    with Juho Hirvonen and Jukka Suomela
  16. Separating OR, SUM, and XOR Circuits
    with Magnus Find, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen
  17. What Can Be Decided Locally Without Identifiers?
    with Pierre Fraigniaud, Amos Korman, and Jukka Suomela
  18. Randomized Distributed Decision
    with Pierre Fraigniaud, Amos Korman, Merav Parter, and David Peleg
  19. No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover
    with Jukka Suomela
  20. Lower Bounds for Local Approximation
    with Juho Hirvonen and Jukka Suomela
  21. Locally Checkable Proofs in Distributed Computing
    with Jukka Suomela
  22. Search Methods for Tile Sets in Patterned DNA Self-Assembly
    with Tuomo Lempiäinen, Eugen Czeizler, and Pekka Orponen

Theses

For a laugh/nostalgic purposes:

Teaching

Misc