دنبال کردن
Rahul Jain
Rahul Jain
Professor, Computer Science, NUS
ایمیل تأیید شده در comp.nus.edu.sg - صفحهٔ اصلی
عنوان
نقل شده توسط
نقل شده توسط
سال
Qip= pspace‏
R Jain, Z Ji, S Upadhyay, J Watrous‏
Journal of the ACM (JACM) 58 (6), 30, 2011‏
2282011
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‏
2242007
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‏
139*2009
A direct sum theorem in communication complexity via message compression‏
R Jain, J Radhakrishnan, P Sen‏
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003‏
1262003
Quantum communication using coherent rejection sampling‏
A Anshu, VK Devabathini, R Jain‏
Physical review letters 119 (12), 120506, 2017‏
105*2017
Building blocks for communication over noisy quantum networks‏
A Anshu, R Jain, NA Warsi‏
IEEE Transactions on Information Theory 65 (2), 1287-1306, 2018‏
101*2018
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‏
952010
Conclusive exclusion of quantum states‏
S Bandyopadhyay, R Jain, J Oppenheim, C Perry‏
Physical Review A 89 (2), 022336, 2014‏
862014
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‏
862003
A direct product theorem for two-party bounded-round public-coin communication complexity‏
R Jain, A Pereszlényi, P Yao‏
Algorithmica 76, 720-748, 2016‏
792016
Quantifying resources in general resource theory with catalysts‏
A Anshu, MH Hsieh, R Jain‏
Physical review letters 121 (19), 190504, 2018‏
762018
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‏
762005
Two-message quantum interactive proofs are in PSPACE‏
R Jain, S Upadhyay, J Watrous‏
arXiv preprint arXiv:0905.1300, 2009‏
732009
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‏
712013
Extension complexity of independent set polytopes‏
M Goos, R Jain, T Watson‏
SIAM Journal on Computing 47 (1), 241-269, 2018‏
652018
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‏
562011
Parallel approximation of non-interactive zero-sum quantum games‏
R Jain, J Watrous‏
2009 24th Annual IEEE Conference on Computational Complexity, 243-253, 2009‏
532009
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‏
522008
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‏
52*2002
New strong direct product results in communication complexity‏
R Jain‏
Journal of the ACM (JACM) 62 (3), 1-27, 2015‏
51*2015
سیستم در حال حاضر قادر به انجام عملکرد نیست. بعداً دوباره امتحان کنید.
مقاله‌ها 1–20