The SCEAS System
| |||||||

## Search the dblp DataBase
Pranab Sen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Pranab Sen
**Lower bounds for predecessor searching in the cell probe model.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2003, pp:73-83 [Conf] - Pranab Sen
**Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:274-287 [Conf] - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
**Prior Entanglement, Message Compression and Privacy in Quantum Communication.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:285-296 [Conf] - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
**Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:429-438 [Conf] - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
**A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:220-229 [Conf] - Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
**The Quantum Complexity of Set Membership.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:554-562 [Conf] - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
**The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2002, pp:218-229 [Conf] - Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
**Depth-3 Arithmetic Circuits for S**[Citation Graph (0, 0)][DBLP]_{n}^{2}(X) and Extensions of the Graham-Pollack Theorem. FSTTCS, 2000, pp:176-187 [Conf] - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
**A Direct Sum Theorem in Communication Complexity via Message Compression.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:300-315 [Conf] - Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen
**On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1399-1411 [Conf] - Pranab Sen, Srinivasan Venkatesh
**Lower Bounds in the Quantum Cell Probe Model.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:358-369 [Conf] - Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
**Quantum Testers for Hidden Group Properties.**[Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:419-428 [Conf] - Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
**Hidden translation and orbit coset in quantum computing.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:1-9 [Conf] - Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen
**Limitations of quantum coset states for graph isomorphism.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:604-617 [Conf] - Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
**The Quantum Complexity of Set Membership.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:4, pp:462-479 [Journal] - Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
**A direct sum theorem in communication complexity via message compression**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Pranab Sen, Srinivasan Venkatesh
**Lower bounds for predecessor searching in the cell probe model**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
**Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem**[Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal] - Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
**The Quantum Complexity of Set Membership**[Citation Graph (0, 0)][DBLP] CoRR, 2000, v:0, n:, pp:- [Journal] - Pranab Sen, Srinivasan Venkatesh
**Lower bounds in the quantum cell probe model**[Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal] **Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.**[Citation Graph (, )][DBLP]**Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.**[Citation Graph (, )][DBLP]**Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |