Mika Göös
Mika Göös
Bestätigte E-Mail-Adresse bei epfl.ch - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Deterministic communication vs. partition number
M Goos, T Pitassi, T Watson
SIAM Journal on Computing 47 (6), 2435-2450, 2018
1152018
Locally checkable proofs in distributed computing
M Göös, J Suomela
Theory of Computing 12 (1), 1-33, 2016
104*2016
Rectangles are nonnegative juntas
M Goos, S Lovett, R Meka, T Watson, D Zuckerman
SIAM Journal on Computing 45 (5), 1835-1869, 2016
1012016
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
702017
Communication lower bounds via critical block sensitivity
M Göös, T Pitassi
SIAM Journal on Computing 47 (5), 1778-1806, 2018
662018
The landscape of communication complexity classes
M Göös, T Pitassi, T Watson
computational complexity 27 (2), 245-304, 2018
532018
Lower bounds for clique vs. independent set
M Göös
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1066-1076, 2015
452015
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
42*2018
Randomized distributed decision
P Fraigniaud, M Göös, A Korman, M Parter, D Peleg
Distributed Computing 27 (6), 419-434, 2014
402014
Extension complexity of independent set polytopes
M Goos, R Jain, T Watson
SIAM Journal on Computing 47 (1), 241-269, 2018
362018
Lower bounds for local approximation
M Göös, J Hirvonen, J Suomela
Journal of the ACM (JACM) 60 (5), 1-23, 2013
362013
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
352013
Zero-information protocols and unambiguity in Arthur–Merlin communication
M Göös, T Pitassi, T Watson
Algorithmica 76 (3), 684-719, 2016
312016
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
30*2014
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
272018
Linear-in- Δ lower bounds in the LOCAL model
M Göös, J Hirvonen, J Suomela
Distributed Computing 30 (5), 325-338, 2017
222017
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
212016
Adventures in monotone complexity and TFNP
M Göös, P Kamath, R Robere, D Sokolov
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
172018
Near-optimal communication lower bounds for approximate nash equilibria
M Göös, A Rubinstein
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
152018
Query-tocommunication lifting for PNP
M Göös, P Kamath, T Pitassi, T Watson
Proceedings of the 32nd CCC 10, 2017
152017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20