Sophie Laplante

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 13

Top Topics

Provably Secure

Space Complexity

Simulation Game

Top Venues

Electron. Colloquium Comput. Complex.

ACM Trans. Comput. Theory

Publications

Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin
The Communication Complexity of Functions with Large Outputs. SIROCCO (2023)
Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny
Certificate Games. ITCS (2023)
Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin
The communication complexity of functions with large outputs. CoRR (2023)
Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin
The communication complexity of functions with large outputs. Electron. Colloquium Comput. Complex. (2023)
Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny
Certificate games. CoRR (2022)
Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny
Certificate games. Electron. Colloquium Comput. Complex. (2022)
Sophie Laplante, Reza Naserasr, Anupa Sunny
Sensitivity lower bounds from linear dependencies. Electron. Colloquium Comput. Complex. 27 (2020)
Sophie Laplante, Reza Naserasr, Anupa Sunny
Sensitivity Lower Bounds from Linear Dependencies. MFCS (2020)
Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
Key Establishment à la Merkle in a Quantum World. J. Cryptol. 32 (3) (2019)
Aleksandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, Louis Salvail
Provably Secure Key Establishment Against Quantum Adversaries. TQC (2017)
Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno
Robust Bell Inequalities from Communication Complexity. TQC (2016)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy Does Not Separate Information and Communication Complexity. ACM Trans. Comput. Theory 9 (1) (2016)
Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno
Robust Bell inequalities from communication complexity. CoRR (2016)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM J. Comput. 44 (5) (2015)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) (2015)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy does not separate Information and Communication Complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Sophie Laplante, Virginie Lerays, Jérémie Roland
Classical and quantum partition bound and detector inefficiency CoRR (2012)
Sophie Laplante, Virginie Lerays, Jérémie Roland
Classical and quantum partition bound and detector inefficiency. Electron. Colloquium Comput. Complex. 19 (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications CoRR (2012)
Sophie Laplante, Virginie Lerays, Jérémie Roland
Classical and Quantum Partition Bound and Detector Inefficiency. ICALP (1) (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications. Electron. Colloquium Comput. Complex. 19 (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS (2012)
Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland
Non-local box complexity and secure function evaluation. Quantum Inf. Comput. 11 (1&2) (2011)
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
The communication complexity of non-signaling distributions. Quantum Inf. Comput. 11 (7&8) (2011)
Marc Kaplan, Sophie Laplante
Kolmogorov complexity and combinatorial methods in communication complexity. Theor. Comput. Sci. 412 (23) (2011)
Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
Merkle Puzzles in a Quantum World. CRYPTO (2011)
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
The Communication Complexity of Non-signaling Distributions. MFCS (2009)
Marc Kaplan, Sophie Laplante
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. TAMC (2009)
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland
Non-Local Box Complexity and Secure Function Evaluation. FSTTCS (2009)
Sophie Laplante, Frédéric Magniez
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. SIAM J. Comput. 38 (1) (2008)
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
The communication complexity of non-signaling distributions. CoRR (2008)
Marc Kaplan, Sophie Laplante
Kolmogorov complexity and combinatorial methods in communication complexity. Electron. Colloquium Comput. Complex. 15 (109) (2008)
Luis Antunes, Sophie Laplante, Alexandre Pinto, Liliana C. M. Salvador
Cryptographic Security of Individual Instances. ICITS (2007)
Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont
Probabilistic abstraction for model checking: An approach based on property testing. ACM Trans. Comput. Log. 8 (4) (2007)
Sophie Laplante, Troy Lee, Mario Szegedy
The Quantum Adversary Method and Classical Formula Size Lower Bounds. Comput. Complex. 15 (2) (2006)
Sophie Laplante
Lower Bounds Using Kolmogorov Complexity. CiE (2006)
Sophie Laplante, Troy Lee, Mario Szegedy
The Quantum Adversary Method and Classical Formula Size Lower Bounds. Computational Complexity Conference (2005)
Sophie Laplante, Frédéric Magniez
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. Computational Complexity Conference (2004)
Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. LICS (2002)
Harry Buhrman, Lance Fortnow, Sophie Laplante
Resource-Bounded Kolmogorov Complexity Revisited. SIAM J. Comput. 31 (3) (2001)
André Berthiaume, Wim van Dam, Sophie Laplante
Quantum Kolmogorov Complexity. J. Comput. Syst. Sci. 63 (2) (2001)
Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont
Probabilistic abstraction for model checking: An approach based on property testing Electron. Colloquium Comput. Complex. 8 (51) (2001)
André Berthiaume, Wim van Dam, Sophie Laplante
Quantum Kolmogorov Complexity. Computational Complexity Conference (2000)
Harry Buhrman, Sophie Laplante, Peter Bro Miltersen
New Bounds for the Language Compression Problem. Computational Complexity Conference (2000)
László Babai, Sophie Laplante
Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. Computational Complexity Conference (1999)
Lance Fortnow, Sophie Laplante
Nearly Optimal Language Compression Using Extractors. STACS (1998)
Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
On Coherence, Random-Self-Reducibility, and Self-Correction. Comput. Complex. 7 (2) (1998)
Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
On Coherence, Random-self-reducibility, and Self-correction. Computational Complexity Conference (1996)
Lance Fortnow, Sophie Laplante
Circuit Lower Bounds à la Kolmogorov. Inf. Comput. 123 (1) (1995)
Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger
Computationally Convincing Proofs of Knowledge. STACS (1991)