| Qip= pspace R Jain, Z Ji, S Upadhyay, J Watrous Journal of the ACM (JACM) 58 (6), 30, 2011 | 151 | 2011 |
| The communication complexity of correlation P Harsha, R Jain, D McAllester, J Radhakrishnan Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 10-23, 2007 | 126 | 2007 |
| A direct sum theorem in communication complexity via message compression R Jain, J Radhakrishnan, P Sen International Colloquium on Automata, Languages, and Programming, 300-315, 2003 | 86 | 2003 |
| Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states R Jain, J Radhakrishnan, P Sen Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE …, 2002 | 78* | 2002 |
| The partition bound for classical communication complexity and query complexity R Jain, H Klauck 2010 IEEE 25th Annual Conference on Computational Complexity, 247-258, 2010 | 74 | 2010 |
| A lower bound for the bounded round quantum communication complexity of set disjointness R Jain, J Radhakrishnan, P Sen 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 71 | 2003 |
| Two-message quantum interactive proofs are in PSPACE R Jain, S Upadhyay, J Watrous arXiv preprint arXiv:0905.1300, 2009 | 61 | 2009 |
| Prior entanglement, message compression and privacy in quantum communication R Jain, J Radhakrishnan, P Sen 20th Annual IEEE Conference on Computational Complexity (CCC'05), 285-296, 2005 | 60 | 2005 |
| A direct product theorem for two-party bounded-round public-coin communication complexity R Jain, A Pereszlényi, P Yao Algorithmica 76 (3), 720-748, 2016 | 51 | 2016 |
| A property of quantum relative entropy with an application to privacy in quantum communication R Jain, J Radhakrishnan, P Sen Journal of the ACM (JACM) 56 (6), 33, 2009 | 48 | 2009 |
| Quantum communication using coherent rejection sampling A Anshu, VK Devabathini, R Jain Physical review letters 119 (12), 120506, 2017 | 47* | 2017 |
| Better lower bounds for locally decodable codes A Deshpande, R Jain, T Kavitha, SV Lokam, J Radhakrishnan Proceedings 17th IEEE Annual Conference on Computational Complexity, 184-193, 2002 | 46* | 2002 |
| Efficient protocols for generating bipartite classical distributions and quantum states R Jain, Y Shi, Z Wei, S Zhang IEEE Transactions on Information Theory 59 (8), 5171-5178, 2013 | 41 | 2013 |
| Direct product theorems for classical communication complexity via subdistribution bounds R Jain, H Klauck, A Nayak Proceedings of the fortieth annual ACM symposium on Theory of computing, 599-608, 2008 | 41 | 2008 |
| New strong direct product results in communication complexity R Jain Journal of the ACM (JACM) 62 (3), 20, 2015 | 39* | 2015 |
| Building blocks for communication over noisy quantum networks A Anshu, R Jain, NA Warsi IEEE Transactions on Information Theory 65 (2), 1287-1306, 2018 | 34* | 2018 |
| Conclusive exclusion of quantum states S Bandyopadhyay, R Jain, J Oppenheim, C Perry Physical Review A 89 (2), 022336, 2014 | 33 | 2014 |
| Parallel approximation of non-interactive zero-sum quantum games R Jain, J Watrous 2009 24th Annual IEEE Conference on Computational Complexity, 243-253, 2009 | 33 | 2009 |
| A parallel repetition theorem for entangled two-player one-round games under product distributions R Jain, A Pereszlényi, P Yao 2014 IEEE 29th Conference on Computational Complexity (CCC), 209-216, 2014 | 30 | 2014 |
| A parallel approximation algorithm for positive semidefinite programming R Jain, P Yao 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 463-471, 2011 | 29 | 2011 |
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
