Volgen
Mika Göös
Mika Göös
EPFL
Geverifieerd e-mailadres voor epfl.ch - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Deterministic communication vs. partition number
M Goos, T Pitassi, T Watson
SIAM Journal on Computing 47 (6), 2435-2450, 2018
1702018
Locally checkable proofs in distributed computing
M Göös, J Suomela
Theory of Computing 12, 1-33, 2016
159*2016
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
1362016
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
1122017
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
1062014
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
702018
Lower bounds for clique vs. independent set
M Göös
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1066-1076, 2015
682015
The landscape of communication complexity classes
M Göös, T Pitassi, T Watson
computational complexity 27 (2), 245-304, 2018
652018
Extension complexity of independent set polytopes
M Goos, R Jain, T Watson
SIAM Journal on Computing 47 (1), 241-269, 2018
632018
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
58*2018
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
482019
Randomized distributed decision
P Fraigniaud, M Göös, A Korman, M Parter, D Peleg
Distributed Computing 27 (6), 419-434, 2014
472014
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
472013
Lower bounds for local approximation
M Göös, J Hirvonen, J Suomela
Journal of the ACM (JACM) 60 (5), 1-23, 2013
442013
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
362020
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
332015
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
322014
Automating algebraic proof systems is np-hard
M Göös, J Nordström, T Pitassi, R Robere, SF de Rezende, D Sokolov
Electronic colloquium on computational complexity 27 (64), 2020
29*2020
Near-optimal communication lower bounds for approximate nash equilibria
M Goos, A Rubinstein
SIAM Journal on Computing 52 (6), FOCS18-316-FOCS18-348, 2021
272021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20