Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly. - Mika Göös; Pekka Orponen (DNA, 2010)

Locally checkable proofs. - Mika Göös; Jukka Suomela (PODC, 2011)

Review of DISC 2012. - Mika Göös (SIGACT News, 2012)

What can be decided locally without identifiers? - Pierre Fraigniaud; Mika Göös; Amos Korman; Jukka Suomela (PODC, 2013)

Lower bounds for local approximation. - Mika Göös; Juho Hirvonen; Jukka Suomela (J. ACM, 2013)

Linear-in-delta lower bounds in the LOCAL model. - Mika Göös; Juho Hirvonen; Jukka Suomela (PODC, 2014)

Randomized distributed decision. - Pierre Fraigniaud; Mika Göös; Amos Korman; Merav Parter; David Peleg (Distributed Comput., 2014)

No sublogarithmic-time approximation scheme for bipartite vertex cover. - Mika Göös; Jukka Suomela (Distributed Comput., 2014)

Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2014)

Communication Complexity of Set-Disjointness for All Probabilities. - Mika Göös; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2014)

Search methods for tile sets in patterned DNA self-assembly. - Mika Göös; Tuomo Lempiäinen; Eugen Czeizler; Pekka Orponen (J. Comput. Syst. Sci., 2014)

Non-Local Probes Do Not Help with Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (CoRR, 2015)

Lower Bounds for Clique vs. Independent Set. - Mika Göös (Electron. Colloquium Comput. Complex., 2015)

A Composition Theorem for Conical Juntas. - Mika Göös; T. S. Jayram (Electron. Colloquium Comput. Complex., 2015)

Randomized Communication vs. Partition Number. - Mika Göös; T. S. Jayram; Toniann Pitassi; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2015)

Non-local Probes Do Not Help with Many Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (DISC, 2016)

Separations in communication complexity using cheat sheets and information complexity. - Anurag Anshu; Aleksandrs Belovs; Shalev Ben-David; Mika Göös; Rahul Jain 001; Robin Kothari; Troy Lee; Miklos Santha (Electron. Colloquium Comput. Complex., 2016)

Separating OR, SUM, and XOR circuits. - Magnus Find; Mika Göös; Matti Järvisalo; Petteri Kaski; Mikko Koivisto; Janne H. Korhonen (J. Comput. Syst. Sci., 2016)

Rectangles Are Nonnegative Juntas. - Mika Göös; Shachar Lovett; Raghu Meka; Thomas Watson 001; David Zuckerman (SIAM J. Comput., 2016)

Locally Checkable Proofs in Distributed Computing. - Mika Göös; Jukka Suomela (Theory Comput., 2016)

Linear-in-Δ lower bounds in the LOCAL model. - Mika Göös; Juho Hirvonen; Jukka Suomela (Distributed Comput., 2017)

Monotone Circuit Lower Bounds from Resolution. - Ankit Garg; Mika Göös; Pritish Kamath; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2017)

Communication Lower Bounds via Query Complexity. - Mika Göös (2017)

The Landscape of Communication Complexity Classes. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (Comput. Complex., 2018)

A Tight Lower Bound for Entropy Flattening. - Yi-Hsiu Chen; Mika Göös; Salil P. Vadhan; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2018)

Adventures in Monotone Complexity and TFNP. - Mika Göös; Pritish Kamath; Robert Robere; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2018)

Extension Complexity of Independent Set Polytopes. - Mika Göös; Rahul Jain 001; Thomas Watson 001 (SIAM J. Comput., 2018)

Deterministic Communication vs. Partition Number. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (SIAM J. Comput., 2018)

Communication Lower Bounds via Critical Block Sensitivity. - Mika Göös; Toniann Pitassi (SIAM J. Comput., 2018)

Randomized Communication versus Partition Number. - Mika Göös; T. S. Jayram; Toniann Pitassi; Thomas Watson 001 (ACM Trans. Comput. Theory, 2018)

String Matching: Communication, Circuits, and Learning. - Alexander Golovnev; Mika Göös; Daniel Reichman 001; Igor Shinkar (APPROX-RANDOM, 2019)

Query-to-Communication Lifting for P NP. - Mika Göös; Pritish Kamath; Toniann Pitassi; Thomas Watson 001 (Comput. Complex., 2019)

Correction to: Query-to-Communication Lifting for P NP. - Mika Göös; Pritish Kamath; Toniann Pitassi; Thomas Watson 001 (Comput. Complex., 2019)

When Is Amplification Necessary for Composition in Randomized Query Complexity? - Shalev Ben-David; Mika Göös; Robin Kothari; Thomas Watson 001 (APPROX-RANDOM, 2020)

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem. - Mika Göös; Pritish Kamath; Katerina Sotiraki; Manolis Zampetakis (CCC, 2020)

The Power of Many Samples in Query Complexity. - Andrew Bassilakis; Andrew Drucker; Mika Göös; Lunjia Hu; Weiyun Ma; Li-Yang Tan (Electron. Colloquium Comput. Complex., 2020)

Automating Cutting Planes is NP-Hard. - Mika Göös; Sajin Koroth; Ian Mertz; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2020)

Automating Algebraic Proof Systems is NP-Hard. - Mika Göös; Jakob Nordström; Toniann Pitassi; Robert Robere; Dmitry Sokolov 001; Susanna F. de Rezende (Electron. Colloquium Comput. Complex., 2020)

Query-to-Communication Lifting for BPP. - Mika Göös; Toniann Pitassi; Thomas Watson 001 (SIAM J. Comput., 2020)

A Lower Bound for Sampling Disjoint Sets. - Mika Göös; Thomas Watson 001 (ACM Trans. Comput. Theory, 2020)

Unambiguous DNFs and Alon-Saks-Seymour. - Kaspars Balodis; Shalev Ben-David; Mika Göös; Siddhartha Jain 002; Robin Kothari (FOCS, 2021)

Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity. - Mika Göös; Stefan Kiefer (CoRR, 2021)

Unambiguous DNFs from Hex. - Shalev Ben-David; Mika Göös; Siddhartha Jain 002; Robin Kothari (Electron. Colloquium Comput. Complex., 2021)

On the Power and Limitations of Branch and Cut. - Noah Fleming; Mika Göös; Russell Impagliazzo; Toniann Pitassi; Robert Robere; Li-Yang Tan; Avi Wigderson (Electron. Colloquium Comput. Complex., 2021)

A Majority Lemma for Randomised Query Complexity. - Mika Göös; Gilbert Maystre (Electron. Colloquium Comput. Complex., 2021)

Proofs, Circuits, and Communication. - Susanna F. de Rezende; Mika Göös; Robert Robere (CoRR, 2022)

Randomised Composition and Small-Bias Minimax. - Shalev Ben-David; Eric Blais; Mika Göös; Gilbert Maystre (Electron. Colloquium Comput. Complex., 2022)

On Semi-Algebraic Proofs and Algorithms. - Noah Fleming; Stefan Grosser; Mika Göös; Robert Robere (Electron. Colloquium Comput. Complex., 2022)

Communication Complexity of Collision. - Mika Göös; Siddhartha Jain 002 (Electron. Colloquium Comput. Complex., 2022)

Further Collapses in TFNP. - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (Electron. Colloquium Comput. Complex., 2022)

Separations in Proof Complexity and TFNP. - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (Electron. Colloquium Comput. Complex., 2022)

Lower Bounds for Unambiguous Automata via Communication Complexity. - Mika Göös; Stefan Kiefer; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2022)

Guest Column: Proofs, Circuits, and Communication. - Susanna F. de Rezende; Mika Göös; Robert Robere (SIGACT News, 2022)

Depth-3 Circuits for Inner Product. - Mika Göös; Ziyi Guan; Tiberiu Mosnoi (Electron. Colloquium Comput. Complex., 2023)

Hardness Condensation by Restriction. - Mika Göös; Ilan Newman; Artur Riazanov; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

Top-Down Lower Bounds for Depth-Four Circuits. - Mika Göös; Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

One-Way Functions vs. TFNP: Simpler and Improved. - Lukás Folwarczný; Mika Göös; Pavel Hubácek; Gilbert Maystre; Weiqiang Yuan 002 (IACR Cryptol. ePrint Arch., 2023)

Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. - Mika Göös; Aviad Rubinstein (SIAM J. Comput., 2023)

Direct Sums for Parity Decision Trees. - Tyler Besselman; Mika Göös; Siyao Guo; Gilbert Maystre; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2024)

Quantum Communication Advantage in TFNP. - Mika Göös; Tom Gur; Siddhartha Jain 002; Jiawei Li 014 (Electron. Colloquium Comput. Complex., 2024)

Supercritical Tradeoffs for Monotone Circuits. - Mika Göös; Gilbert Maystre; Kilian Risse; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2024)

Further Collapses in ( boldsymbol{ mathsf{TFNP}} ). - Mika Göös; Alexandros Hollender; Siddhartha Jain 002; Gilbert Maystre; William Pires; Robert Robere; Ran Tao 013 (SIAM J. Comput., 2024)

Constant-Cost Communication Is Not Reducible to k-Hamming Distance. - Yuting Fang; Mika Göös; Nathaniel Harms; Pooya Hatami (STOC, 2025)

Generalised Linial-Nisan Conjecture is False for DNFs. - Yaroslav Alekseev; Mika Göös; Ziyi Guan; Gilbert Maystre; Artur Riazanov; Dmitry Sokolov 001; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2025)

Monotone Circuit Complexity of Matching. - Bruno Pasqualotto Cavalar; Mika Göös; Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Sign-Rank of $k$-Hamming Distance is Constant. - Mika Göös; Nathaniel Harms; Valentin Imbach; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Equality is Far Weaker Than Constant-Cost Communication. - Mika Göös; Nathaniel Harms; Artur Riazanov (Electron. Colloquium Comput. Complex., 2025)

Sign-Rank of k-Hamming Distance is Constant. - Mika Göös; Nathaniel Harms; Valentin Imbach; Dmitry Sokolov 001 (CoRR, 2025)