Mohammad Bavarian
Mohammad Bavarian
OpenAI
Verified email at openai.com - Homepage
Title
Cited by
Cited by
Year
Tighter relations between sensitivity and other complexity measures
A Ambainis, M Bavarian, Y Gao, J Mao, X Sun, S Zuo
International Colloquium on Automata, Languages, and Programming, 101-113, 2014
292014
Information causality, Szemerédi-Trotter and algebraic variants of CHSH
M Bavarian, PW Shor
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
262015
Hardness amplification for entangled games via anchoring
M Bavarian, T Vidick, H Yuen
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
24*2017
On the role of shared randomness in simultaneous communication
M Bavarian, D Gavinsky, T Ito
International Colloquium on Automata, Languages, and Programming, 150-162, 2014
132014
The optimality of correlated sampling
M Bavarian, B Ghazi, E Haramaty, P Kamath, RL Rivest, M Sudan
arXiv preprint arXiv:1612.01041, 2016
102016
On the sum of L1 influences
A Backurs, M Bavarian
2014 IEEE 29th Conference on Computational Complexity (CCC), 132-143, 2014
9*2014
Parallel repetition via fortification: analytic view and the quantum case
M Bavarian, T Vidick, H Yuen
arXiv preprint arXiv:1603.05349, 2016
72016
Computability theory of closed timelike curves
S Aaronson, M Bavarian, G Gueltrini
arXiv preprint arXiv:1609.05507, 2016
62016
Weak parity
S Aaronson, A Ambainis, K Balodis, M Bavarian
International Colloquium on Automata, Languages, and Programming, 26-38, 2014
42014
Optimality of Correlated Sampling Strategies
M Bavarian, B Ghazi, E Haramaty, P Kamath, RL Rivest, M Sudan
Theory of Computing 16 (1), 1-18, 2020
2020
Parallel repetition of multi-party and quantum games via anchoring and fortification
M Bavarian
Massachusetts Institute of Technology, 2017
2017
Anchoring games for parallel repetition
H Yuen, M Bavarian, T Vidick
Quantum Weak Parity Problem
M Bavarian
The system can't perform the operation now. Try again later.
Articles 1–13