Pranab Sen

	2009
27		Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen: Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Algorithmica 55(3): 490-516 (2009)
26		Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen: Quantum Testers for Hidden Group Properties. Fundam. Inform. 91(2): 325-340 (2009)
25		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)
	2008
24		Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang: Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. ICALP (2) 2008: 592-603
23		Pranab Sen: Quantum Algorithm for the Discrete Logarithm Problem. Encyclopedia of Algorithms 2008
22		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)
21		Pranab Sen, Srinivasan Venkatesh: Lower bounds for predecessor searching in the cell probe model. J. Comput. Syst. Sci. 74(3): 364-385 (2008)
	2006
20		Pranab Sen: Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. IEEE Conference on Computational Complexity 2006: 274-287
19		Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen: Limitations of quantum coset states for graph isomorphism. STOC 2006: 604-617
	2005
18		Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen: On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. ICALP 2005: 1399-1411
17		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: Prior Entanglement, Message Compression and Privacy in Quantum Communication. IEEE Conference on Computational Complexity 2005: 285-296
	2003
16		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS 2003: 220-229
15		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP 2003: 300-315
14		Pranab Sen: Lower bounds for predecessor searching in the cell probe model. IEEE Conference on Computational Complexity 2003: 73-83
13		Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen: Quantum Testers for Hidden Group Properties. MFCS 2003: 419-428
12		Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen: Hidden translation and orbit coset in quantum computing. STOC 2003: 1-9
11		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A direct sum theorem in communication complexity via message compression CoRR cs.CC/0304020: (2003)
10		Pranab Sen, Srinivasan Venkatesh: Lower bounds for predecessor searching in the cell probe model CoRR cs.CC/0309033: (2003)
	2002
9		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
8		Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229
7		Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. Algorithmica 34(4): 462-479 (2002)
	2001
6		Pranab Sen, Srinivasan Venkatesh: Lower Bounds in the Quantum Cell Probe Model. ICALP 2001: 358-369
5		Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan: Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem CoRR cs.DM/0110031: (2001)
4		Pranab Sen, Srinivasan Venkatesh: Lower bounds in the quantum cell probe model CoRR quant-ph/0104100: (2001)
	2000
3		Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. FOCS 2000: 554-562
2		Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan: Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. FSTTCS 2000: 176-187
1		Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership CoRR quant-ph/0007021: (2000)

Coauthor Index

1	Katalin Friedl	[12] [13] [26]
2	Sean Hallgren	[19] [24]
3	Gábor Ivanyos	[12]
4	Rahul Jain	[8] [9] [11] [15] [16] [17] [22] [25]
5	Alexandra Kolla	[24]
6	Frédéric Magniez	[12] [13] [26]
7	Cristopher Moore	[19]
8	Jaikumar Radhakrishnan	[1] [2] [3] [5] [7] [8] [9] [11] [15] [16] [17] [18] [22] [25] [27]
9	Martin Rötteler	[18] [19] [27]
10	Alexander Russell	[19]
11	Miklos Santha	[12] [13] [26]
12	Srinivasan Venkatesh	[1] [3] [4] [6] [7] [10] [21]
13	Sundar Vishwanathan	[2] [5]
14	Shengyu Zhang	[24]

Colors in the list of coauthors