( en | de | ru )

 

Disambiguation of "Roland, Jérémie"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications.

, , , , and . SIAM J. Comput., 44 (5): 1550-1572 (2015)

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.

Jérémie Decock

Jérémie Guiochet

Jérémie Allard

Jérémie Gaidamour

Jérémie Segouat

 

Other publications of authors with the same name

Quantum Walks Can Find a Marked Element on Any Graph., , , and . Algorithmica, 74 (2): 851-907 (2016)Finding Is as Easy as Detecting for Quantum Walks., , , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 540-551. Springer, (2010)Amortized Communication Complexity of Distributions., and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 738-749. Springer, (2009)The communication complexity of non-signaling distributions., , , and . Quantum Inf. Comput., 11 (7&8): 649-676 (2011)Exploring scalar quantum walks on Cayley graphs., , and . Quantum Inf. Comput., 8 (1): 68-81 (2008)Classical and quantum partition bound and detector inefficiency., , and . Electron. Colloquium Comput. Complex., (2012)Quadratic speedup for spatial search by continuous-time quantum walk., , , and . CoRR, (2021)Quantum rejection sampling., , and . ACM Trans. Comput. Theory, 5 (3): 11:1-11:33 (2013)A Strong Direct Product Theorem for Quantum Query Complexity., and . CCC, page 236-246. IEEE Computer Society, (2012)Non-Local Box Complexity and Secure Function Evaluation., , , and . FSTTCS, volume 4 of LIPIcs, page 239-250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)