Scholar
Mika Göös
Google Scholar ID: E1U3GIcAAAAJ
EPFL
Theoretical Computer Science
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,107
H-index
18
i10-index
30
Publications
20
Co-authors
34
list available
Contact
No contact links provided.
Publications
7 items
No Constant-Cost Protocol for Point--Line Incidence
2026
Cited
0
Monotone Circuit Complexity of Matching
2025
Cited
0
Equality is Far Weaker than Constant-Cost Communication
2025
Cited
0
Sign-Rank of $k$-Hamming Distance is Constant
Electron. Colloquium Comput. Complex. · 2025
Cited
0
Direct Sums for Parity Decision Trees
Electron. Colloquium Comput. Complex. · 2024
Cited
0
Quantum Communication Advantage in TFNP
Electron. Colloquium Comput. Complex. · 2024
Cited
0
Constant-Cost Communication is not Reducible to k-Hamming Distance
arXiv.org · 2024
Cited
1
Resume (English only)
Co-authors
34 total
Co-author 1
Jukka Suomela
Aalto University
Dmitry Sokolov
École Polytechnique Fédérale de Lausanne
Pritish Kamath
Google Research
Co-author 5
Rahul Jain
Professor, Computer Science, NUS
Co-author 7
Shachar Lovett
Full Professor of Computer Science, University of California San Diego
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up