Deterministic communication vs. partition number M Goos, T Pitassi, T Watson SIAM Journal on Computing 47 (6), 2435-2450, 2018 | 163 | 2018 |
Locally checkable proofs in distributed computing M Göös, J Suomela Theory of Computing 12 (1), 1-33, 2016 | 151* | 2016 |
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016 | 130 | 2016 |
Query-to-communication lifting for BPP M Göös, T Pitassi, T Watson 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 114 | 2017 |
Communication lower bounds via critical block sensitivity M Göös, T Pitassi Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 100 | 2014 |
Lower bounds for clique vs. independent set M Göös 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1066-1076, 2015 | 66 | 2015 |
Monotone circuit lower bounds from resolution A Garg, M Göös, P Kamath, D Sokolov Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 65 | 2018 |
The landscape of communication complexity classes M Göös, T Pitassi, T Watson computational complexity 27 (2), 245-304, 2018 | 64 | 2018 |
Randomized communication versus partition number M Göös, TS Jayram, T Pitassi, T Watson ACM Transactions on Computation Theory (TOCT) 10 (1), 1-20, 2018 | 57* | 2018 |
Extension complexity of independent set polytopes M Goos, R Jain, T Watson SIAM Journal on Computing 47 (1), 241-269, 2018 | 57 | 2018 |
Randomized distributed decision P Fraigniaud, M Göös, A Korman, M Parter, D Peleg Distributed Computing 27 (6), 419-434, 2014 | 47 | 2014 |
Adventures in monotone complexity and TFNP M Göös, P Kamath, R Robere, D Sokolov 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019 | 46 | 2019 |
What can be decided locally without identifiers? P Fraigniaud, M Göös, A Korman, J Suomela Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 46 | 2013 |
Lower bounds for local approximation M Göös, J Hirvonen, J Suomela Journal of the ACM (JACM) 60 (5), 1-23, 2013 | 42 | 2013 |
Search methods for tile sets in patterned DNA self-assembly M Göös, T Lempiäinen, E Czeizler, P Orponen Journal of Computer and System Sciences 80 (1), 297-319, 2014 | 34* | 2014 |
Zero-information protocols and unambiguity in arthur-merlin communication M Göös, T Pitassi, T Watson Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 33 | 2015 |
Automating cutting planes is NP-hard M Göös, S Koroth, I Mertz, T Pitassi Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 31 | 2020 |
Linear-in-Delta lower bounds in the LOCAL model M Göös, J Hirvonen, J Suomela Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 31 | 2014 |
Near-optimal communication lower bounds for approximate nash equilibria M Goos, A Rubinstein SIAM Journal on Computing 52 (6), FOCS18-316-FOCS18-348, 2021 | 25 | 2021 |
Separations in communication complexity using cheat sheets and information complexity A Anshu, A Belovs, S Ben-David, M Göös, R Jain, R Kothari, T Lee, ... 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 25 | 2016 |