Sophie Laplante

According to our database, Sophie Laplante authored at least 27 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

QuBobs Teaching Kits to Explain Quantum Computing.

Sophie Laplante, Loris Perez, Sylvie Tissot, Lou Vettier

Proceedings of the Creative Mathematical Sciences Communication: 7th International Conference, 2024

2023

The Communication Complexity of Functions with Large Outputs.

Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin

Proceedings of the Structural Information and Communication Complexity, 2023

Certificate Games.

Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2020

Sensitivity Lower Bounds from Linear Dependencies.

Sophie Laplante, Reza Naserasr, Anupa Sunny

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Key Establishment à la Merkle in a Quantum World.

Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail

J. Cryptol., 2019

2017

Provably Secure Key Establishment Against Quantum Adversaries.

Aleksandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, Louis Salvail

Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

2016

Robust Bell Inequalities from Communication Complexity.

Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno

Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

2015

Relative Discrepancy Does not Separate Information and Communication Complexity.

Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2012

Classical and Quantum Partition Bound and Detector Inefficiency.

Sophie Laplante, Virginie Lerays, Jérémie Roland

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications.

Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Merkle Puzzles in a Quantum World.

Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2009

Kolmogorov Complexity and Combinatorial Methods in Communication Complexity.

Marc Kaplan, Sophie Laplante

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

The Communication Complexity of Non-signaling Distributions.

Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Non-Local Box Complexity and Secure Function Evaluation.

Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2007

Cryptographic Security of Individual Instances.

Luis Antunes, Sophie Laplante, Alexandre Pinto, Liliana C. M. Salvador

Proceedings of the Information Theoretic Security - Second International Conference, 2007

2006

Lower Bounds Using Kolmogorov Complexity.

Sophie Laplante

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

The Quantum Adversary Method and Classical Formula Size Lower Bounds.

Sophie Laplante, Troy Lee, Mario Szegedy

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.

Sophie Laplante, Frédéric Magniez

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2002

Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing.

Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001

Resource-Bounded Kolmogorov Complexity Revisited.

Harry Buhrman, Lance Fortnow, Sophie Laplante

SIAM J. Comput., 2001

2000

New Bounds for the Language Compression Problem.

Harry Buhrman, Sophie Laplante, Peter Bro Miltersen

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

Quantum Kolmogorov Complexity.

André Berthiaume, Wim van Dam, Sophie Laplante

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999

Stronger Separations for Random-Self-Reducibility, Rounds, and Advice.

László Babai, Sophie Laplante

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Nearly Optimal Language Compression Using Extractors.

Lance Fortnow, Sophie Laplante

Proceedings of the STACS 98, 1998

1996

On Coherence, Random-self-reducibility, and Self-correction.

Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995

Circuit Lower Bounds à la Kolmogorov.

Lance Fortnow, Sophie Laplante

Inf. Comput., 1995

1991

Computationally Convincing Proofs of Knowledge.

Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger

Proceedings of the STACS 91, 1991