( en | de | ru )

 

Disambiguation of "Laplante, Sophie"

Author of the publication

copydeleteadd this publication to your clipboard
The Quantum Adversary Method and Classical Formula Size Lower Bounds.

, , and . CCC, page 76-90. IEEE Computer Society, (2005)

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.

Sophie Schweizer

Sophie Illch

Sophie Buchholz

Sophie Wichers

Sophie Dohna

 

Other publications of authors with the same name

Relative Discrepancy Does Not Separate Information and Communication Complexity., , , , , and . TOCT, 9 (1): 4:1-4:15 (2016)Probabilistic abstraction for model checking: An approach based on property testing, , , , and . Electron. Colloquium Comput. Complex., (2001)Quantum Kolmogorov Complexity., , and . CCC, page 240-249. IEEE Computer Society, (2000)The communication complexity of non-signaling distributions., , , and . CoRR, (2008)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)Probabilistic abstraction for model checking: An approach based on property testing., , , , and . ACM Trans. Comput. Log., 8 (4): 20 (2007)Provably Secure Key Establishment Against Quantum Adversaries., , , , , and . TQC, volume 73 of LIPIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The communication complexity of non-signaling distributions., , , and . Quantum Inf. Comput., 11 (7&8): 649-676 (2011)Certificate games., , , , and . CoRR, (2022)Classical and quantum partition bound and detector inefficiency., , and . Electron. Colloquium Comput. Complex., (2012)