Mika Göös
École Polytechnique Fédérale de Lausanne
H-index: 22
Europe-Switzerland
Top articles of Mika Göös
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Further Collapses in | SIAM Journal on Computing | Mika Göös Alexandros Hollender Siddhartha Jain Gilbert Maystre William Pires | 2024/6/30 |
One-Way Functions vs. TFNP: Simpler and Improved | Cryptology ePrint Archive | Lukáš Folwarczný Mika Göös Pavel Hubáček Gilbert Maystre Weiqiang Yuan | 2023 |
Top-Down Lower Bounds for Depth-Four Circuits | Mika Göös Artur Riazanov Anastasia Sofronova Dmitry Sokolov | 2023/11/6 | |
Unambiguous DNFs and Alon–Saks–Seymour | SIAM Journal on Computing | Kaspars Balodis Shalev Ben-David Mika Göös Siddhartha Jain Robin Kothari | 2023/10/20 |
Depth-3 circuits for inner product | Mika Göös Ziyi Guan Tiberiu Mosnoi | 2023 | |
Communication Complexity of Collision | Mika Göös Siddhartha Jain | 2022 | |
On semi-algebraic proofs and algorithms | [Proceedings of ITCS 2022] | Noah Fleming Mika Göös Stefan Grosser Robert Robere | 2022 |
Randomised composition and small-bias minimax | Shalev Ben-David Eric Blais Mika Göös Gilbert Maystre | 2022/8/12 | |
Separations in proof complexity and TFNP | Mika Göös Alexandros Hollender Siddhartha Jain Gilbert Maystre William Pires | 2022/10/31 | |
Guest column: Proofs, circuits, and communication | ACM SIGACT News | SF de Rezende M Göös R Robere | 2022/4/18 |
Further collapses in TFNP | Mika Göös Alexandros Hollender Siddhartha Jain Gilbert Maystre William Pires | 2022/7 | |
Near-optimal communication lower bounds for approximate nash equilibria | SIAM Journal on Computing | Mika Goos Aviad Rubinstein | 2021 |
Lower bounds for unambiguous automata via communication complexity | arXiv preprint arXiv:2109.09155 | Mika Göös Stefan Kiefer Weiqiang Yuan | 2021/9/19 |
On the power and limitations of branch and cut | arXiv preprint arXiv:2102.05019 | Noah Fleming Mika Göös Russell Impagliazzo Toniann Pitassi Robert Robere | 2021/2/9 |
A majority lemma for randomised query complexity | Mika Göös Gilbert Maystre | 2021 | |
A lower bound for sampling disjoint sets | ACM Transactions on Computation Theory (TOCT) | Mika Göös Thomas Watson | 2020/7/20 |
Automating cutting planes is NP-hard | Mika Göös Sajin Koroth Ian Mertz Toniann Pitassi | 2020/6/22 | |
When is amplification necessary for composition in randomized query complexity? | arXiv preprint arXiv:2006.10957 | Shalev Ben-David Mika Göös Robin Kothari Thomas Watson | 2020/6/19 |
Automating algebraic proof systems is np-hard | Susanna F De Rezende Mika Göös Jakob Nordström Toniann Pitassi Robert Robere | 2021/6/15 | |
The power of many samples in query complexity | Andrew Bassilakis Andrew Drucker Mika Göös Lunjia Hu Weiyun Ma | 2020/7 |
Co-Authors
