Sophie Laplante

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