Computationally Convincing Proofs of Knowledge. - Gilles Brassard; Claude Crépeau; Sophie Laplante; Christian Léger (STACS, 1991)

Circuit Lower Bounds à la Kolmogorov. - Lance Fortnow; Sophie Laplante (Inf. Comput., 1995)

Nearly Optimal Language Compression Using Extractors. - Lance Fortnow; Sophie Laplante (STACS, 1998)

On Coherence, Random-Self-Reducibility, and Self-Correction. - Joan Feigenbaum; Lance Fortnow; Sophie Laplante; Ashish V. Naik (Comput. Complex., 1998)

Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. - László Babai; Sophie Laplante (CCC, 1999)

New Bounds for the Language Compression Problem. - Harry Buhrman; Sophie Laplante; Peter Bro Miltersen (CCC, 2000)

Probabilistic abstraction for model checking: An approach based on property testing - Sophie Laplante; Richard Lassaigne; Frédéric Magniez; Sylvain Peyronnet; Michel de Rougemont (Electron. Colloquium Comput. Complex., 2001)

Quantum Kolmogorov Complexity. - André Berthiaume; Wim van Dam; Sophie Laplante (J. Comput. Syst. Sci., 2001)

Resource-Bounded Kolmogorov Complexity Revisited. - Harry Buhrman; Lance Fortnow; Sophie Laplante (SIAM J. Comput., 2001)

Lower Bounds Using Kolmogorov Complexity. - Sophie Laplante (CiE, 2006)

The Quantum Adversary Method and Classical Formula Size Lower Bounds. - Sophie Laplante; Troy Lee; Mario Szegedy (Comput. Complex., 2006)

Cryptographic Security of Individual Instances. - Luis Antunes 002; Sophie Laplante; Alexandre Pinto; Liliana C. M. Salvador (ICITS, 2007)

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. - Sophie Laplante; Frédéric Magniez (SIAM J. Comput., 2008)

Merkle Puzzles in a Quantum World. - Gilles Brassard; Peter Høyer; Kassem Kalach; Marc Kaplan; Sophie Laplante; Louis Salvail (CRYPTO, 2011)

The communication complexity of non-signaling distributions. - Julien Degorre; Marc Kaplan; Sophie Laplante; Jérémie Roland (Quantum Inf. Comput., 2011)

Non-local box complexity and secure function evaluation. - Marc Kaplan; Sophie Laplante; Iordanis Kerenidis; Jérémie Roland (Quantum Inf. Comput., 2011)

Kolmogorov complexity and combinatorial methods in communication complexity. - Marc Kaplan; Sophie Laplante (Theor. Comput. Sci., 2011)

Classical and quantum partition bound and detector inefficiency. - Sophie Laplante; Virginie Lerays; Jérémie Roland (Electron. Colloquium Comput. Complex., 2012)

Relative Discrepancy does not separate Information and Communication Complexity. - Lila Fontes; Rahul Jain 001; Iordanis Kerenidis; Sophie Laplante; Mathieu Laurière; Jérémie Roland (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. - Iordanis Kerenidis; Sophie Laplante; Virginie Lerays; Jérémie Roland; David Xiao (SIAM J. Comput., 2015)

Provably Secure Key Establishment Against Quantum Adversaries. - Aleksandrs Belovs; Gilles Brassard; Peter Høyer; Marc Kaplan; Sophie Laplante; Louis Salvail (TQC, 2017)

Robust Bell inequalities from communication complexity. - Sophie Laplante; Mathieu Laurière; Alexandre Nolin; Jérémie Roland; Gabriel Senno (Quantum, 2018)

Key Establishment à la Merkle in a Quantum World. - Gilles Brassard; Peter Høyer; Kassem Kalach; Marc Kaplan; Sophie Laplante; Louis Salvail (J. Cryptol., 2019)

Sensitivity lower bounds from linear dependencies. - Sophie Laplante; Reza Naserasr; Anupa Sunny (Electron. Colloquium Comput. Complex., 2020)

Certificate games. - Sourav Chakraborty 001; Anna Gál; Sophie Laplante; Rajat Mittal 001; Anupa Sunny (Electron. Colloquium Comput. Complex., 2022)

The communication complexity of functions with large outputs. - Lila Fontes; Sophie Laplante; Mathieu Laurière; Alexandre Nolin (Electron. Colloquium Comput. Complex., 2023)

QuBobs Teaching Kits to Explain Quantum Computing. - Sophie Laplante; Loris Perez; Sylvie Tissot; Lou Vettier (CMSC, 2024)