Mika Göös

Cited by

	All	Since 2016
Citations	942	799
h-index	17	15
i10-index	24	23

220

110

165

201120122013201420152016201720182019202020213 12 30 33 53 106 116 168 202 201 4

Co-authors

Thomas WatsonAssistant Professor of Computer Science, University of MemphisVerified email at memphis.edu
Jukka SuomelaAalto UniversityVerified email at aalto.fi
Pritish KamathToyota Technological Institute at ChicagoVerified email at ttic.edu
Juho HirvonenPostdoctoral researcher, Aalto UniversityVerified email at aalto.fi
Dmitry SokolovSt. Petersburg State UniversityVerified email at spbu.ru
T.S. JayramIBM Almaden ResearchVerified email at us.ibm.com
Amos KormanCNRSVerified email at irif.fr
Pierre FraigniaudCNRS and University Paris DiderotVerified email at liafa.univ-paris-diderot.fr
Rahul JainProfessor, Computer Science, NUSVerified email at comp.nus.edu.sg
Shachar LovettAssociate Professor of Computer Science, University of California San DiegoVerified email at eng.ucsd.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Pekka OrponenProfessor of Computer Science, Aalto UniversityVerified email at aalto.fi
Robin KothariSenior Researcher, Microsoft Quantum and Microsoft ResearchVerified email at robinkothari.com
David PelegProfessor of Computer Science, Weizmann InstituteVerified email at weizmann.ac.il
Merav ParterWeizmann InstituteVerified email at weizmann.ac.il
Moti MedinaECE, Ben-Gurion University of the NegevVerified email at bgu.ac.il
Reut LeviWeizmann Institute of ScienceVerified email at weizmann.ac.il
Ankit GargMicrosoft ResearchVerified email at microsoft.com
Troy LeeUniversity of Technology SydneyVerified email at uts.edu.au
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT SingaporeVerified email at liafa.univ-paris-diderot.fr

Mika Göös

EPFL

Verified email at epfl.ch - Homepage

Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Deterministic communication vs. partition number M Goos, T Pitassi, T Watson SIAM Journal on Computing 47 (6), 2435-2450, 2018	111	2018
Locally checkable proofs in distributed computing M Göös, J Suomela Theory of Computing 12 (1), 1-33, 2016	99*	2016
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016	96	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	69	2017
Communication lower bounds via critical block sensitivity M Göös, T Pitassi SIAM Journal on Computing 47 (5), 1778-1806, 2018	62*	2018
The landscape of communication complexity classes M Göös, T Pitassi, T Watson computational complexity 27 (2), 245-304, 2018	48	2018
Lower bounds for clique vs. independent set M Göös 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1066-1076, 2015	44	2015
Randomized distributed decision P Fraigniaud, M Göös, A Korman, M Parter, D Peleg Distributed Computing 27 (6), 419-434, 2014	39	2014
Lower bounds for local approximation M Göös, J Hirvonen, J Suomela Journal of the ACM (JACM) 60 (5), 1-23, 2013	35	2013
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	35	2013
Extension complexity of independent set polytopes M Goos, R Jain, T Watson SIAM Journal on Computing 47 (1), 241-269, 2018	33	2018
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
Zero-information protocols and unambiguity in Arthur–Merlin communication M Göös, T Pitassi, T Watson Algorithmica 76 (3), 684-719, 2016	29	2016
Randomized communication vs. partition number M Göös, TS Jayram, T Pitassi, T Watson 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017	28	2017
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	24	2018
Linear-in- lower bounds in the LOCAL model M Göös, J Hirvonen, J Suomela Distributed Computing 30 (5), 325-338, 2017	22	2017
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	22	2016
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	15	2018
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	14	2018
Non-local probes do not help with many graph problems M Göös, J Hirvonen, R Levi, M Medina, J Suomela International Symposium on Distributed Computing, 201-214, 2016	14*	2016

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors