( en | de | ru )

 

Disambiguation of "Sen, Pranab"

Author of the publication

copydeleteadd this publication to your clipboard
Quantum Algorithm for the Discrete Logarithm Problem.

. Encyclopedia of Algorithms, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nikhilranjan Sen

Ramen Sen

Sen Ye

Pranab Kumar Banerjee

Parimal Sen

 

Other publications of authors with the same name

The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version., , and . FSTTCS, volume 2556 of Lecture Notes in Computer Science, page 218-229. Springer, (2002)Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem., , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 176-187. Springer, (2000)Lower Bounds in the Quantum Cell Probe Model., and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 358-369. Springer, (2001)Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks., , , and . ICALP (2), volume 5126 of Lecture Notes in Computer Science, page 592-603. Springer, (2008)Quantum Algorithm for the Discrete Logarithm Problem.. Encyclopedia of Algorithms, Springer, (2008)Approximate Unitary Designs Give Rise to Quantum Channels With Super Additive Classical Holevo Capacity., and . IEEE Trans. Inf. Theory, 68 (9): 5937-5954 (2022)Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States., , and . FOCS, page 429-438. IEEE Computer Society, (2002)Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem, , and . CoRR, (2001)Approximate Unitary n2/3-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity., and . TQC, volume 135 of LIPIcs, page 9:1-9:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)SPEARMAN'S FOOTRULE UNDER PROGRESSIVE CENSORING, , and . Journal of Nonparametric Statistics, 15 (1): 53--60 (2003)