Full Name
Rahul Jain
Variants
Jain, R.
 
 
 
Email
dcsrahul@nus.edu.sg
 

Publications

Refined By:
Department:  COMPUTER SCIENCE

Results 1-20 of 20 (Search time: 0.005 seconds).

Issue DateTitleAuthor(s)
12012A direct product theorem for the two-party bounded-round public-coin communication complexityJain, R. ; Pereszlenyi, A.; Yao, P.
22011A parallel approximation algorithm for positive semidefinite programmingJain, R. ; Yao, P.
32009A property of quantum relative entropy with an application to privacy in quantum communicationJain, R. ; Radhakrishnan, J.; Sen, P.
42010A separation between divergence and Holevo information for ensemblesJain, R. ; Nayak, A.; Su, Y.
52010Depth-independent lower bounds on the communication complexity of read-once Boolean formulasJain, R. ; Klauck, H.; Zhang, S.
62013Efficient protocols for generating bipartite classical distributions and quantum statesJain, R. ; Shi, Y.; Wei, Z. ; Zhang, S.
72013Efficient protocols for generating bipartite classical distributions and quantum statesJain, R. ; Shi, Y.; Wei, Z. ; Zhang, S.
82009Entanglement-resistant two-prover interactive proof systems and non-adaptive pir'sCleve, R.; Gavinsky, D.; Jain, R. 
92009New bounds on classical and quantum one-way communication complexityJain, R. ; Zhang, S.
102009New results in the simultaneous message passing model via information theoretic techniquesJain, R. ; Klauck, H.
112010Optimal direct sum results for deterministic and randomized decision tree complexityJain, R. ; Klauck, H.; Santha, M. 
122009Parallel approximation of non-interactive zero-sum quantum gamesJain, R. ; Watrous, J.
132011QIP = PSPACEJain, R. ; Ji, Z.; Upadhyay, S.; Watrous, J.
142010QIP = PSPACEJain, R. ; Ji, Z.; Upadhyay, S.; Watrous, J.
152010QIP = PSPACEJain, R. ; Ji, Z.; Upadhyay, S.; Watrous, J.
162012Resource requirements of private quantum channels and consequences for oblivious remote state preparationJain, R. 
172012Short proofs of the quantum substate theoremJain, R. ; Nayak, A.
182010The Communication complexity of correlationHarsha, P.; Jain, R. ; McAllester, D.; Radhakrishnan, J.
192010The partition bound for classical communication complexity and query complexityJain, R. ; Klauck, H.
202009Two-message quantum interactive proofs are in PSPACEJain, R. ; Upadhyay, S.; Watrous, J.