The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Pranab Sen" ( http://dblp.L3S.de/Authors/Pranab_Sen )

  Author page on DBLP  Author page in RDF  Community of Pranab Sen in ASPL-2

Publication years (Num. hits)
2000-2003 (16) 2005-2011 (17) 2012 (1)
Publication types (Num. hits)
article(17) incollection(1) inproceedings(16)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 14 keywords

Results
Found 34 publication records. Showing 34 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Omar Fawzi, Patrick Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde Classical Communication Over a Quantum Interference Channel. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pranab Sen Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Omar Fawzi, Patrick Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde Classical communication over a quantum interference channel Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Omar Fawzi, Patrick Hayden, Pranab Sen From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen Limitations of quantum coset states for graph isomorphism. Search on Bibsonomy J. ACM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Omar Fawzi, Patrick Hayden, Pranab Sen From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Random orthonormal measurement bases, Ensemble quantum state distinction, Hidden subgroup problem, Frobenius distance, Quantum Fourier transforms, Gel’fand pairs, Quantum algorithms
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A property of quantum relative entropy with an application to privacy in quantum communication. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF quantum communication complexity, Privacy, quantum information theory
1Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen Quantum Testers for Hidden Group Properties. Search on Bibsonomy Fundam. Inform. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Pranab Sen, Srinivasan Venkatesh Lower bounds for predecessor searching in the cell probe model. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Pranab Sen Quantum Algorithm for the Discrete Logarithm Problem. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ashwin Nayak, Pranab Sen Invertible quantum operations and perfect encryption of quantum states. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2007 DBLP  BibTeX  RDF
1Pranab Sen Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen Limitations of quantum coset states for graph isomorphism. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF hidden subgroup problem, graph isomorphism, quantum algorithms
1Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen Prior Entanglement, Message Compression and Privacy in Quantum Communication. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A direct sum theorem in communication complexity via message compression Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Pranab Sen, Srinivasan Venkatesh Lower bounds for predecessor searching in the cell probe model Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A Direct Sum Theorem in Communication Complexity via Message Compression. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen Quantum Testers for Hidden Group Properties. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Pranab Sen Lower bounds for predecessor searching in the cell probe model. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen Hidden translation and orbit coset in quantum computing. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh The Quantum Complexity of Set Membership. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. Search on Bibsonomy FSTTCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Pranab Sen, Srinivasan Venkatesh Lower bounds in the quantum cell probe model Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Pranab Sen, Srinivasan Venkatesh Lower Bounds in the Quantum Cell Probe Model. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh The Quantum Complexity of Set Membership Search on Bibsonomy CoRR The full citation details ... 2000 DBLP  BibTeX  RDF
1Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh The Quantum Complexity of Set Membership. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF quantum complexity, static set membership problem, bit table, quantum bit-probe model, black-box unitary transform, oracle calls, basis state superposition, space-probe tradeoff, computational complexity, query processing, lower bounds, quantum computing, upper bounds, linear algebra, linear algebra, set theory, probes, query answering, query algorithm
1Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #34 of 34 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.