Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Pranab Sen
2010 – today
- 2012
[j8]Omar Fawzi, Patrick Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde: Classical Communication Over a Quantum Interference Channel. IEEE Transactions on Information Theory 58(6): 3670-3691 (2012)- [c17]Pranab Sen: Achieving the Han-Kobayashi inner bound for the quantum interference channel. ISIT 2012: 736-740
- 2011
- [c16]Omar Fawzi, Patrick Hayden, Pranab Sen: From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking. STOC 2011: 773-782
- [i9]Omar Fawzi, Patrick Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde: Classical communication over a quantum interference channel. CoRR abs/1102.2624 (2011)
- [i8]Pranab Sen: Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding. CoRR abs/1109.0802 (2011)
- 2010
- [j7]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen: Limitations of quantum coset states for graph isomorphism. J. ACM 57(6): 34 (2010)
- [i7]Omar Fawzi, Patrick Hayden, Pranab Sen: From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking. CoRR abs/1010.3007 (2010)
2000 – 2009
- 2009
- [j6]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)
- [j5]Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen: Quantum Testers for Hidden Group Properties. Fundam. Inform. 91(2): 325-340 (2009)
- [j4]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
- [j3]Pranab Sen, Srinivasan Venkatesh: Lower bounds for predecessor searching in the cell probe model. J. Comput. Syst. Sci. 74(3): 364-385 (2008)
- [c15]Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang: Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. ICALP (2) 2008: 592-603
- [r1]
- [i6]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)
- 2007
- [j2]Ashwin Nayak, Pranab Sen: Invertible quantum operations and perfect encryption of quantum states. Quantum Information & Computation 7(1): 103-110 (2007)
- 2006
- [c14]Pranab Sen: Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. IEEE Conference on Computational Complexity 2006: 274-287
- [c13]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen: Limitations of quantum coset states for graph isomorphism. STOC 2006: 604-617
- 2005
- [c12]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: Prior Entanglement, Message Compression and Privacy in Quantum Communication. IEEE Conference on Computational Complexity 2005: 285-296
- [c11]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
- 2003
- [c10]Pranab Sen: Lower bounds for predecessor searching in the cell probe model. IEEE Conference on Computational Complexity 2003: 73-83
- [c9]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS 2003: 220-229
- [c8]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP 2003: 300-315
- [c7]Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen: Quantum Testers for Hidden Group Properties. MFCS 2003: 419-428
- [c6]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
- [i5]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: A direct sum theorem in communication complexity via message compression. CoRR cs.CC/0304020 (2003)
- [i4]Pranab Sen, Srinivasan Venkatesh: Lower bounds for predecessor searching in the cell probe model. CoRR cs.CC/0309033 (2003)
- 2002
- [j1]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. Algorithmica 34(4): 462-479 (2002)
- [c5]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
- [c4]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen: The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229
- 2001
- [c3]
- [i3]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)
- [i2]Pranab Sen, Srinivasan Venkatesh: Lower bounds in the quantum cell probe model. CoRR quant-ph/0104100 (2001)
- 2000
- [c2]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. FOCS 2000: 554-562
- [c1]Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan: Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. FSTTCS 2000: 176-187
- [i1]Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh: The Quantum Complexity of Set Membership. CoRR quant-ph/0007021 (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:38 CET by the dblp team