The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pranab Sen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
    The Quantum Complexity of Set Membership. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:554-562 [Conf]
  7. 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]
  8. Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
    Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:176-187 [Conf]
  9. 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]
  10. 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]
  11. Pranab Sen, Srinivasan Venkatesh
    Lower Bounds in the Quantum Cell Probe Model. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:358-369 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
    The Quantum Complexity of Set Membership [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  20. Pranab Sen, Srinivasan Venkatesh
    Lower bounds in the quantum cell probe model [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]

  21. Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. [Citation Graph (, )][DBLP]


  22. Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. [Citation Graph (, )][DBLP]


  23. Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity [Citation Graph (, )][DBLP]


Search in 0.441secs, Finished in 0.443secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002