Rahul Jain

	2009
34		Rahul Jain, Hartmut Klauck: New Results in the Simultaneous Message Passing Model CoRR abs/0902.3056: (2009)
33		Rahul Jain, Sarvagya Upadhyay, John Watrous: Two-message quantum interactive proofs are in PSPACE CoRR abs/0905.1300: (2009)
32		Rahul Jain, Hartmut Klauck, Shengyu Zhang: Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas CoRR abs/0908.4453: (2009)
31		Rahul Jain, Hartmut Klauck: The Partition Bound for Classical Communication Complexity and Query Complexity CoRR abs/0910.4266: (2009)
30		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56(6): (2009)
29		Rahul Jain, Shengyu Zhang: New bounds on classical and quantum one-way communication complexity. Theor. Comput. Sci. 410(26): 2463-2477 (2009)
	2008
28		Ankit Agrawal, Ankush Mittal, Rahul Jain, Raghav Takkar: An adaptive fuzzy thresholding algorithm for exon prediction. EIT 2008: 211-214
27		Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC 2008: 599-608
26		Rahul Jain, Ashwin Nayak, Yi Su: A Separation between Divergence and Holevo Information for Ensembles. TAMC 2008: 526-541
25		Rahul Jain: Teleportation of Quantum States. Encyclopedia of Algorithms 2008
24		Rahul Jain, Shengyu Zhang: New bounds on classical and quantum one-way communication complexity CoRR abs/0802.4101: (2008)
23		Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan: Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity CoRR abs/0807.1267: (2008)
22		Rahul Jain: New Binding-Concealing Trade-Offs for Quantum String Commitment. J. Cryptology 21(4): 579-592 (2008)
	2007
21		Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The Communication Complexity of Correlation. IEEE Conference on Computational Complexity 2007: 10-23
20		Rahul Jain, Preeti Ranjan Panda: An Efficient Pipelined VLSI Architecture for Lifting-Based 2D-Discrete Wavelet Transform. ISCAS 2007: 1377-1380
19		Rahul Jain, Preeti Ranjan Panda: Memory Architecture Exploration for Power-Efficient 2D-Discrete Wavelet Transform. VLSI Design 2007: 813-818
18		Rahul Jain, Hartmut Klauck, Ashwin Nayak: Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electronic Colloquium on Computational Complexity (ECCC) 14(064): (2007)
	2006
17		Rahul Jain, Teunis J. Ott: Design and Implementation of Split TCP in the Linux Kernel. GLOBECOM 2006
16		Rahul Jain, Anindita Mukherjee, Kolin Paul: Defect-Aware Design Paradigm for Reconfigurable Architectures. ISVLSI 2006: 91-96
15		Rahul Jain: Towards a classical proof of exponential lower bound for 2-probe smooth codes CoRR abs/cs/0607042: (2006)
14		Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The communication complexity of correlation. Electronic Colloquium on Computational Complexity (ECCC) 13(151): (2006)
	2005
13		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: Prior Entanglement, Message Compression and Privacy in Quantum Communication. IEEE Conference on Computational Complexity 2005: 285-296
12		Rahul Jain: Improved direct sum theorem in classical communication complexity CoRR abs/cs/0504087: (2005)
11		Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan: Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005)
	2004
10		Rahul Jain, Sanjeev Kumar Aggarwal, Pankaj Jalote, Shiladitya Biswas: An interactive method for extracting grammar from programs. Softw., Pract. Exper. 34(5): 433-447 (2004)
	2003
9		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS 2003: 220-229
8		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP 2003: 300-315
7		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A direct sum theorem in communication complexity via message compression CoRR cs.CC/0304020: (2003)
	2002
6		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. FOCS 2002: 429-438
5		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229
4		Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam: Better Lower Bounds for Locally Decodable Codes. IEEE Conference on Computational Complexity 2002: 184-193
	1999
3		Rahul Jain, Edward W. Knightly: A Framework for Design & Evaluation of Admission Control Algorithms in Multi-Service Mobile Networks. INFOCOM 1999: 1027-1035
2		Rahul Jain, Bahareh Sadeghi, Edward W. Knightly: Towards Coarse-Grained Mobile QoS. WOWMOM 1999: 109-116
	1994
1		Sudhakar M. Reddy, Irith Pomeranz, Rahul Jain: On Codeword Testing of Two-Rail and Parity TSC Checkers. FTCS 1994: 116-125

Coauthor Index

1	Sanjeev Kumar Aggarwal	[10]
2	Ankit Agrawal	[28]
3	Shiladitya Biswas	[10]
4	Amit Deshpande	[4] [11]
5	Prahladh Harsha	[14] [21]
6	Pankaj Jalote	[10]
7	Telikepalli Kavitha	[4] [11]
8	Hartmut Klauck	[18] [27] [31] [32] [34]
9	Edward W. Knightly	[2] [3]
10	Satyanarayana V. Lokam	[4] [11]
11	David A. McAllester	[14] [21]
12	Ankush Mittal	[28]
13	Anindita Mukherjee	[16]
14	Ashwin Nayak	[18] [26] [27]
15	Teunis J. Ott	[17]
16	Preeti Ranjan Panda	[19] [20]
17	Kolin Paul	[16]
18	Irith Pomeranz	[1]
19	Jaikumar Radhakrishnan	[4] [5] [6] [7] [8] [9] [11] [13] [14] [21] [23] [30]
20	Sudhakar M. Reddy	[1]
21	Bahareh Sadeghi	[2]
22	Pranab Sen	[5] [6] [7] [8] [9] [13] [23] [30]
23	Yi Su	[26]
24	Raghav Takkar	[28]
25	Sarvagya Upadhyay	[33]
26	John Watrous	[33]
27	Shengyu Zhang	[24] [29] [32]

Colors in the list of coauthors