Mika Göös

Dikutip oleh

	Semua	Sejak 2020
Kutipan	1728	995
indeks-h	25	17
indeks-i10	33	29

260

130

195

2012201320142015201620172018201920202021202220232024202516 33 35 62 117 123 155 163 190 185 177 152 252 36

Akses publik

Lihat semua

20 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Thomas WatsonAssociate Professor of Computer Science, University of MemphisEmail yang diverifikasi di memphis.edu
Jukka SuomelaAalto UniversityEmail yang diverifikasi di aalto.fi
Dmitry SokolovÉcole Polytechnique Fédérale de LausanneEmail yang diverifikasi di epfl.ch
Pritish KamathGoogle ResearchEmail yang diverifikasi di google.com
Juho HirvonenHIIT Research Fellow, Aalto UniversityEmail yang diverifikasi di aalto.fi
Rahul JainProfessor, Computer Science, NUSEmail yang diverifikasi di comp.nus.edu.sg
Shachar LovettFull Professor of Computer Science, University of California San DiegoEmail yang diverifikasi di eng.ucsd.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinEmail yang diverifikasi di cs.utexas.edu
Robin KothariStaff Research Scientist, Google Quantum AIEmail yang diverifikasi di robinkothari.com
Amos KormanComputer Science Department, University of HaifaEmail yang diverifikasi di cs.haifa.ac.il
Pierre FraigniaudCNRS and Université Paris CitéEmail yang diverifikasi di irif.fr
T.S. JayramLawrence Livermore National LaboratoryEmail yang diverifikasi di llnl.gov
Pekka OrponenProfessor of Computer Science, Aalto UniversityEmail yang diverifikasi di aalto.fi
Ankit GargMicrosoft ResearchEmail yang diverifikasi di microsoft.com
Moti MedinaEngineering Faculty at Bar-Ilan UniversityEmail yang diverifikasi di biu.ac.il
Reut LeviThe Interdisciplinary Center, HerzliyaEmail yang diverifikasi di idc.ac.il
David PelegProfessor of Computer Science, Weizmann InstituteEmail yang diverifikasi di weizmann.ac.il
Merav ParterAssociate Professor, Weizmann InstituteEmail yang diverifikasi di weizmann.ac.il
Troy LeeUniversity of Technology SydneyEmail yang diverifikasi di uts.edu.au
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT SingaporeEmail yang diverifikasi di liafa.univ-paris-diderot.fr

Ikuti

Mika Göös

EPFL

Email yang diverifikasi di epfl.ch - Beranda

Theoretical Computer Science


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Deterministic communication vs. partition number M Goos, T Pitassi, T Watson SIAM Journal on Computing 47 (6), 2435-2450, 2018	172	2018
Locally checkable proofs in distributed computing M Göös, J Suomela Theory of Computing 12, 1-33, 2016	166*	2016
Rectangles are nonnegative juntas M Goos, S Lovett, R Meka, T Watson, D Zuckerman SIAM Journal on Computing 45 (5), 1835-1869, 2016	136	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	106	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	74	2018
Lower bounds for clique vs. independent set M Göös 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1066-1076, 2015	69	2015
The landscape of communication complexity classes M Göös, T Pitassi, T Watson computational complexity 27 (2), 245-304, 2018	67	2018
Extension complexity of independent set polytopes M Goos, R Jain, T Watson SIAM Journal on Computing 47 (1), 241-269, 2018	65	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	59*	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), 38 …, 2019	51	2019
Randomized distributed decision P Fraigniaud, M Göös, A Korman, M Parter, D Peleg Distributed Computing 27 (6), 419-434, 2014	50	2014
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	48	2013
Lower bounds for local approximation M Göös, J Hirvonen, J Suomela Journal of the ACM (JACM) 60 (5), 1-23, 2013	47	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	36*	2014
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	35	2020
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
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	33	2014
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	28*	2020
Separations in proof complexity and TFNP M Göös, A Hollender, S Jain, G Maystre, W Pires, R Robere, R Tao Journal of the ACM 71 (4), 1-45, 2024	27	2024

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama