Rahul Jain - RankMe

159 papers A* 15A 10B 9C 2Misc 2Journal 112Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Quantum information advantage based on Bell inequalities. CoRR Rahul Jain, Srijita Kundu
2025	J	`jnl`	A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography. SIAM J. Comput. Rahul Jain, Srijita Kundu
2025	J	`jnl`	Quantum Secure Non-Malleable Randomness Encoder and Its Applications. IEEE Trans. Inf. Theory Rishabh Batra, Naresh Goud Boddu, Rahul Jain
2025	J	`jnl`	Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages. IEEE Trans. Inf. Theory Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro
2024	A*	`conf`	An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP. STOC Itai Arad, Raz Firanko, Rahul Jain
2024	A*	`conf`	Commitments are Equivalent to Statistically-Verifiable One-Way State Generators. FOCS Rishabh Batra, Rahul Jain
2024	J	`jnl`	Commitments are equivalent to one-way state generators. CoRR Rishabh Batra, Rahul Jain
2024	B	`conf`	Quantum Channel Simulation in Fidelity is No More Difficult than State Splitting. ISIT Michael X. Cao, Rahul Jain, Marco Tomamichel
2024	J	`jnl`	Quantum Channel Simulation under Purified Distance is no more difficult than State Splitting. CoRR Michael X. Cao, Rahul Jain, Marco Tomamichel
2024	J	`jnl`	Quantum Measurement Adversary. IEEE Trans. Inf. Theory Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski
2024	J	`jnl`	Quantum Secure Non-Malleable Codes in the Split-State Model. IEEE Trans. Inf. Theory Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain
2024	J	`jnl`	Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages. IACR Cryptol. ePrint Arch. Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro
2024	—	`conf`	Split-State Non-malleable Codes and Secret Sharing Schemes for Quantum Messages. TCC (2) Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro
2023	J	`jnl`	Area law for the maximally mixed ground state in degenerate 1D gapped systems. CoRR Itai Arad, Raz Firanko, Rahul Jain
2023	J	`jnl`	On relating one-way classical and quantum communication complexities. Quantum Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin
2023	—	`conf`	One-Shot Non-Catalytic Distributed Purity Distillation. Allerton Sayantan Chakraborty, Rahul Jain, Pranab Sen
2023	J	`jnl`	One-Shot Quantum State Redistribution and Quantum Markov Chains. IEEE Trans. Inf. Theory Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette
2023	J	`jnl`	Quantum secure non-malleable randomness encoder and its applications. CoRR Rishabh Batra, Naresh Goud Boddu, Rahul Jain
2023	J	`jnl`	Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages. CoRR Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro
2022	J	`jnl`	Quantum secure non-malleable-codes in the split-state model. CoRR Naresh Goud Boddu, Rahul Jain
2021	A	`conf`	A Direct Product Theorem for One-Way Quantum Communication. CCC Rahul Jain, Srijita Kundu
2021	A*	`conf`	A direct product theorem for quantum communication complexity with applications to device-independent QKD. FOCS Rahul Jain, Srijita Kundu
2021	J	`jnl`	A direct product theorem for quantum communication complexity with applications to device-independent QKD. CoRR Rahul Jain, Srijita Kundu
2021	J	`jnl`	A direct product theorem for quantum communication complexity with applications to device-independent QKD. Electron. Colloquium Comput. Complex. Rahul Jain, Srijita Kundu
2021	B	`conf`	Chain-Rules for Channel Capacity. ISIT Rahul Jain
2021	J	`jnl`	On relating one-way classical and quantum communication complexities. CoRR Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin
2021	B	`conf`	One-Shot Quantum State Redistribution and Quantum Markov Chains. ISIT Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette
2021	J	`jnl`	One-shot quantum state redistribution and quantum Markov chains. CoRR Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette
2021	J	`jnl`	Quantum Measurement Adversary. CoRR Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski
2021	J	`jnl`	Quantum secure non-malleable-extractors. CoRR Naresh Goud Boddu, Rahul Jain, Upendra Kapshikar
2020	J	`jnl`	A Direct Product Theorem for One-Way Quantum Communication. CoRR Rahul Jain, Srijita Kundu
2020	J	`jnl`	A Direct Product Theorem for One-Way Quantum Communication. Electron. Colloquium Comput. Complex. Rahul Jain, Srijita Kundu
2020	J	`jnl`	Noisy Quantum State Redistribution With Promise and the Alpha-Bit. IEEE Trans. Inf. Theory Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain
2020	J	`jnl`	One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information. IEEE Trans. Inf. Theory Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier Rodríguez Fonollosa
2020	J	`jnl`	Parallel Device-Independent Quantum Key Distribution. IEEE Trans. Inf. Theory Rahul Jain, Carl A. Miller, Yaoyun Shi
2020	J	`jnl`	Partially Smoothed Information Measures. IEEE Trans. Inf. Theory Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel
2020	J	`jnl`	Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2019	J	`jnl`	A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel. IEEE Trans. Inf. Theory Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2019	J	`jnl`	Building Blocks for Communication Over Noisy Quantum Networks. IEEE Trans. Inf. Theory Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2019	J	`jnl`	Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. IEEE Trans. Inf. Theory Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2019	B	`conf`	Second-Order Characterizations via Partial Smoothing. ISIT Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel
2018	J	`jnl`	A Generalized Quantum Slepian-Wolf. IEEE Trans. Inf. Theory Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2018	B	`conf`	A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel. ISIT Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2018	J	`jnl`	A One-Shot Achievability Result for Quantum State Redistribution. IEEE Trans. Inf. Theory Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2018	B	`conf`	Building Blocks for Communication Over Noisy Quantum Nerworks. ISIT Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2018	J	`jnl`	Extension Complexity of Independent Set Polytopes. SIAM J. Comput. Mika Göös, Rahul Jain, Thomas Watson
2018	B	`conf`	One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels. ISIT Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa
2018	J	`jnl`	One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information. CoRR Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa
2018	J	`jnl`	Partially smoothed information measures. CoRR Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel
2018	Misc	`conf`	Quadratically Tight Relations for Randomized Query Complexity. CSR Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2017	—	`conf`	A Composition Theorem for Randomized Query Complexity. FSTTCS Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
2017	J	`jnl`	A Composition Theorem for Randomized Query Complexity. CoRR Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
2017	J	`jnl`	A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
2017	J	`jnl`	A generalized quantum Slepian-Wolf. CoRR Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2017	J	`jnl`	A hypothesis testing approach for communication over entanglement assisted compound quantum channel. CoRR Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2017	J	`jnl`	A unified approach to source and message compression. CoRR Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2017	B	`conf`	Achievability bounds on quantum state redistribution using convex split and position based decoding. ITW Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2017	J	`jnl`	Information-theoretic approximations of the nonnegative rank. Comput. Complex. Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta
2017	J	`jnl`	Lifting randomized query complexity to randomized communication complexity. Electron. Colloquium Comput. Complex. Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay
2017	B	`conf`	Matching Multiplications in Bit-Vector Formulas. VMCAI Supratik Chakraborty, Ashutosh Gupta, Rahul Jain
2017	J	`jnl`	Measurement compression with quantum side information using shared randomness. CoRR Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2017	J	`jnl`	Multipartite Quantum Correlation and Communication Complexities. Comput. Complex. Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang
2017	J	`jnl`	One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach. CoRR Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2017	J	`jnl`	Quadratically Tight Relations for Randomized Query Complexity. CoRR Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2017	J	`jnl`	Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
2017	A	`conf`	Separating Quantum Communication and Approximate Rank. CCC Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee
2017	J	`jnl`	Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution. CoRR Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
2017	J	`jnl`	Special issue on the conference Theory and Applications of Models of Computation. Inf. Comput. Rahul Jain, Sanjay Jain, Frank Stephan
2016	J	`jnl`	A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica Rahul Jain, Attila Pereszlényi, Penghui Yao
2016	A*	`conf`	Extension Complexity of Independent Set Polytopes. FOCS Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Extension Complexity of Independent Set Polytopes. CoRR Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Extension Complexity of Independent Set Polytopes. Electron. Colloquium Comput. Complex. Mika Göös, Rahul Jain, Thomas Watson
2016	J	`jnl`	Matching Multiplications in Bit-Vector Formulas. CoRR Supratik Chakraborty, Ashutosh Gupta, Rahul Jain
2016	J	`jnl`	New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. Theory Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
2016	A*	`conf`	Partition Bound Is Quadratically Tight for Product Distributions. ICALP Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
2016	J	`jnl`	Relative Discrepancy Does Not Separate Information and Communication Complexity. ACM Trans. Comput. Theory Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
2016	J	`jnl`	Separating quantum communication and approximate rank. CoRR Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee
2016	A*	`conf`	Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	J	`jnl`	Separations in communication complexity using cheat sheets and information complexity. CoRR Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	J	`jnl`	Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha
2016	—	`ch.`	Teleportation of Quantum States. Encyclopedia of Algorithms Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain, Priyanka Mukhopadhyay
2015	J	`jnl`	New Strong Direct Product Results in Communication Complexity. J. ACM Rahul Jain
2015	—	`conf`	Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
2015	J	`jnl`	Relative Discrepancy does not separate Information and Communication Complexity. Electron. Colloquium Comput. Complex. Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
2015	J	`jnl`	Relaxed partition bound is quadratically tight for product distributions. CoRR Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
2015	J	`jnl`	Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
2015	C	`ed.`	Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings TAMC Rahul Jain, Sanjay Jain, Frank Stephan
2014	A	`conf`	A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. CCC Rahul Jain, Attila Pereszlényi, Penghui Yao
2014	J	`jnl`	A new operational interpretation of relative entropy and trace distance between quantum states. CoRR Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
2014	J	`jnl`	A quadratically tight partition bound for classical communication complexity and query complexity. CoRR Rahul Jain, Troy Lee, Nisheeth K. Vishnoi
2014	J	`jnl`	Approximate and Multipartite Quantum Correlation (Communication) Complexity. CoRR Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang
2014	J	`jnl`	Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution. CoRR Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain
2014	J	`jnl`	The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited. IEEE Trans. Inf. Theory Rahul Jain, Ashwin Nayak
2014	—	`conf`	Unidirectional Input/Output Streaming Complexity of Reversal and Sorting. APPROX-RANDOM Nathanaël François, Rahul Jain, Frédéric Magniez
2013	—	`conf`	A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. FSTTCS Prahladh Harsha, Rahul Jain
2013	J	`jnl`	A parallel repetition theorem for entangled two-player one-round games under product distributions. CoRR Rahul Jain, Attila Pereszlényi, Penghui Yao
2013	J	`jnl`	A strong direct product theorem for the tribes function via the smooth-rectangle bound CoRR Prahladh Harsha, Rahul Jain
2013	J	`jnl`	Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States. IEEE Trans. Inf. Theory Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang
2013	A*	`conf`	Efficient protocols of generating bipartite classical distributions and quantum states. SODA Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang
2013	J	`jnl`	Information-theoretic approximations of the nonnegative rank. Electron. Colloquium Comput. Complex. Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta
2012	A*	`conf`	A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. FOCS Rahul Jain, Attila Pereszlényi, Penghui Yao
2012	J	`jnl`	A direct product theorem for bounded-round public-coin randomized communication complexity CoRR Rahul Jain, Attila Pereszlényi, Penghui Yao
2012	J	`jnl`	A parallel approximation algorithm for mixed packing and covering semidefinite programs CoRR Rahul Jain, Penghui Yao
2012	J	`jnl`	A strong direct product theorem in terms of the smooth rectangle bound CoRR Rahul Jain, Penghui Yao
2012	J	`jnl`	Correlation/Communication complexity of generating bipartite states CoRR Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang
2012	J	`jnl`	On the Power of a Unique Quantum Witness. Theory Comput. Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
2012	J	`jnl`	Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation. J. Cryptol. Rahul Jain
2012	J	`jnl`	Short Proofs of the Quantum Substate Theorem. IEEE Trans. Inf. Theory Rahul Jain, Ashwin Nayak
2011	J	`jnl`	A Parallel Approximation Algorithm for Positive Semidefinite Programming CoRR Rahul Jain, Penghui Yao
2011	A*	`conf`	A Parallel Approximation Algorithm for Positive Semidefinite Programming. FOCS Rahul Jain, Penghui Yao
2011	J	`jnl`	A short proof of the Quantum Substate Theorem CoRR Rahul Jain, Ashwin Nayak
2011	J	`jnl`	New strong direct product results in communication complexity. Electron. Colloquium Comput. Complex. Rahul Jain
2011	J	`jnl`	QIP = PSPACE. J. ACM Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous
2011	J	`jnl`	The Influence Lower Bound Via Query Elimination. Theory Comput. Rahul Jain, Shengyu Zhang
2011	J	`jnl`	The influence lower bound via query elimination CoRR Rahul Jain, Shengyu Zhang
2011	J	`jnl`	The influence lower bound via query elimination. Electron. Colloquium Comput. Complex. Rahul Jain, Shengyu Zhang
2010	J	`jnl`	A separation between divergence and Holevo information for ensembles. Math. Struct. Comput. Sci. Rahul Jain, Ashwin Nayak, Yi Su
2010	J	`jnl`	A strong direct product theorem for two-way public coin communication complexity CoRR Rahul Jain
2010	Misc	`conf`	Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON Rahul Jain, Hartmut Klauck, Shengyu Zhang
2010	A	`conf`	On the Power of a Unique Quantum Witness. ICS Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
2010	J	`jnl`	Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity CoRR Rahul Jain, Hartmut Klauck, Miklos Santha
2010	J	`jnl`	Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. Rahul Jain, Hartmut Klauck, Miklos Santha
2010	A*	`conf`	QIP = PSPACE. STOC Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous
2010	J	`jnl`	QIP = PSPACE. Commun. ACM Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous
2010	J	`jnl`	Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity CoRR Rahul Jain
2010	A	`conf`	The Partition Bound for Classical Communication Complexity and Query Complexity. CCC Rahul Jain, Hartmut Klauck
2010	J	`jnl`	The communication complexity of correlation. IEEE Trans. Inf. Theory Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
2010	J	`jnl`	The space complexity of recognizing well-parenthesized expressions CoRR Rahul Jain, Ashwin Nayak
2010	J	`jnl`	The space complexity of recognizing well-parenthesized expressions. Electron. Colloquium Comput. Complex. Rahul Jain, Ashwin Nayak
2009	J	`jnl`	A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
2009	J	`jnl`	Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas CoRR Rahul Jain, Hartmut Klauck, Shengyu Zhang
2009	J	`jnl`	Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Inf. Comput. Richard Cleve, Dmitry Gavinsky, Rahul Jain
2009	J	`jnl`	New Results in the Simultaneous Message Passing Model CoRR Rahul Jain, Hartmut Klauck
2009	A	`conf`	New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. CCC Rahul Jain, Hartmut Klauck
2009	J	`jnl`	New bounds on classical and quantum one-way communication complexity. Theor. Comput. Sci. Rahul Jain, Shengyu Zhang
2009	J	`jnl`	On parallel composition of zero-knowledge proofs with black-box quantum simulators. Quantum Inf. Comput. Rahul Jain, Alexandra Kolla, Gatis Midrijanis, Ben W. Reichardt
2009	A	`conf`	Parallel Approximation of Non-interactive Zero-sum Quantum Games. CCC Rahul Jain, John Watrous
2009	J	`jnl`	The Partition Bound for Classical Communication Complexity and Query Complexity CoRR Rahul Jain, Hartmut Klauck
2009	A*	`conf`	Two-Message Quantum Interactive Proofs Are in PSPACE. FOCS Rahul Jain, Sarvagya Upadhyay, John Watrous
2009	J	`jnl`	Two-message quantum interactive proofs are in PSPACE CoRR Rahul Jain, Sarvagya Upadhyay, John Watrous
2008	C	`conf`	A Separation between Divergence and Holevo Information for Ensembles. TAMC Rahul Jain, Ashwin Nayak, Yi Su
2008	A*	`conf`	Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC Rahul Jain, Hartmut Klauck, Ashwin Nayak
2008	J	`jnl`	New Binding-Concealing Trade-Offs for Quantum String Commitment. J. Cryptol. Rahul Jain
2008	J	`jnl`	New bounds on classical and quantum one-way communication complexity CoRR Rahul Jain, Shengyu Zhang
2008	J	`jnl`	Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity CoRR Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan
2008	—	`ch.`	Teleportation of Quantum States. Encyclopedia of Algorithms Rahul Jain
2007	J	`jnl`	Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electron. Colloquium Comput. Complex. Rahul Jain, Hartmut Klauck, Ashwin Nayak
2007	A	`conf`	The Communication Complexity of Correlation. CCC Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
2006	J	`jnl`	Communication complexity of remote state preparation with entanglement. Quantum Inf. Comput. Rahul Jain
2006	J	`jnl`	The communication complexity of correlation. Electron. Colloquium Comput. Complex. Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
2006	J	`jnl`	Towards a classical proof of exponential lower bound for 2-probe smooth codes CoRR Rahul Jain
2005	J	`jnl`	Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan
2005	A	`conf`	Prior Entanglement, Message Compression and Privacy in Quantum Communication. CCC Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
2003	A*	`conf`	A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
2003	A*	`conf`	A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
2003	J	`jnl`	A direct sum theorem in communication complexity via message compression CoRR Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
2002	A	`conf`	Better Lower Bounds for Locally Decodable Codes. CCC Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam
2002	A*	`conf`	Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. FOCS Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
2002	—	`conf`	The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen