Articles by Mika Göös
|
Vol 22, Article 2 (pp 1-38)
[CCC21 Spec Issue]
On The Power and Limitations of Branch and Cut by Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, and Avi Wigderson |
|
Vol 16, Article 13 (pp 1-30)
Monotone Circuit Lower Bounds from Resolution by Ankit Garg, Mika Göös, Pritish Kamath, and Dmitry Sokolov |
|
Vol 12, Article 19 (pp 1-33)
Locally Checkable Proofs in Distributed Computing by Mika Göös and Jukka Suomela |
|
Vol 12, Article 9 (pp 1-23)
[APRX-RND14 Spec Issue]
Communication Complexity of Set-Disjointness for All Probabilities by Mika Göös and Thomas Watson |