| 2008 |
|---|
| 24 | EE | 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 | EE | Pranab Sen:
Quantum Algorithm for the Discrete Logarithm Problem.
Encyclopedia of Algorithms 2008 |
| 22 | EE | 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 | EE | 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 | EE | Pranab Sen:
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.
IEEE Conference on Computational Complexity 2006: 274-287 |
| 19 | EE | 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 | EE | 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 | EE | 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 | EE | Rahul Jain,
Jaikumar Radhakrishnan,
Pranab Sen:
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.
FOCS 2003: 220-229 |
| 15 | EE | Rahul Jain,
Jaikumar Radhakrishnan,
Pranab Sen:
A Direct Sum Theorem in Communication Complexity via Message Compression.
ICALP 2003: 300-315 |
| 14 | EE | Pranab Sen:
Lower bounds for predecessor searching in the cell probe model.
IEEE Conference on Computational Complexity 2003: 73-83 |
| 13 | EE | Katalin Friedl,
Frédéric Magniez,
Miklos Santha,
Pranab Sen:
Quantum Testers for Hidden Group Properties.
MFCS 2003: 419-428 |
| 12 | EE | 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 | EE | Rahul Jain,
Jaikumar Radhakrishnan,
Pranab Sen:
A direct sum theorem in communication complexity via message compression
CoRR cs.CC/0304020: (2003) |
| 10 | EE | Pranab Sen,
Srinivasan Venkatesh:
Lower bounds for predecessor searching in the cell probe model
CoRR cs.CC/0309033: (2003) |
| 2002 |
|---|
| 9 | EE | 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 | EE | Rahul Jain,
Jaikumar Radhakrishnan,
Pranab Sen:
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.
FSTTCS 2002: 218-229 |
| 7 | EE | Jaikumar Radhakrishnan,
Pranab Sen,
Srinivasan Venkatesh:
The Quantum Complexity of Set Membership.
Algorithmica 34(4): 462-479 (2002) |
| 2001 |
|---|
| 6 | EE | Pranab Sen,
Srinivasan Venkatesh:
Lower Bounds in the Quantum Cell Probe Model.
ICALP 2001: 358-369 |
| 5 | EE | 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 | EE | 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 | EE | 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 | EE | Jaikumar Radhakrishnan,
Pranab Sen,
Srinivasan Venkatesh:
The Quantum Complexity of Set Membership
CoRR quant-ph/0007021: (2000) |
