( en | de | ru )

 

Disambiguation of "Laplante, Sophie"

Author of the publication

copydeleteadd this publication to your clipboard
Relative Discrepancy Does Not Separate Information and Communication Complexity.

, , , , , and . TOCT, 9 (1): 4:1-4:15 (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.

Sophie Schetke

Sophie Schäfer

Sophie Romberg

Sophie Winterfeld

Sophie Wolfrum

 

Other publications of authors with the same name

Kolmogorov Complexity and Combinatorial Methods in Communication Complexity., and . TAMC, volume 5532 of Lecture Notes in Computer Science, page 261-270. Springer, (2009)Nearly Optimal Language Compression Using Extractors., and . STACS, volume 1373 of Lecture Notes in Computer Science, page 84-93. Springer, (1998)The Communication Complexity of Functions with Large Outputs., , , and . SIROCCO, volume 13892 of Lecture Notes in Computer Science, page 427-458. Springer, (2023)On Coherence, Random-self-reducibility, and Self-correction., , , and . CCC, page 59-67. IEEE Computer Society, (1996)Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing., , , , and . LICS, page 30-39. IEEE Computer Society, (2002)Sensitivity Lower Bounds from Linear Dependencies., , and . MFCS, volume 170 of LIPIcs, page 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)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)Relative Discrepancy Does Not Separate Information and Communication Complexity., , , , , and . TOCT, 9 (1): 4:1-4:15 (2016)Quantum Kolmogorov Complexity., , and . CCC, page 240-249. IEEE Computer Society, (2000)The communication complexity of non-signaling distributions., , , and . Quantum Inf. Comput., 11 (7&8): 649-676 (2011)