| 2023 | SIROCCO | The Communication Complexity of Functions with Large Outputs. | Lila Fontes, Sophie Laplante, Mathieu Laurire, Alexandre Nolin |
| 2020 | MFCS | Sensitivity Lower Bounds from Linear Dependencies. | Sophie Laplante, Reza Naserasr, Anupa Sunny |
| 2015 | ICALP | Relative Discrepancy Does not Separate Information and Communication Complexity. | Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurire, Jrmie Roland |
| 2012 | FOCS | Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jrmie Roland, David Xiao |
| 2012 | ICALP | Classical and Quantum Partition Bound and Detector Inefficiency. | Sophie Laplante, Virginie Lerays, Jrmie Roland |
| 2011 | CRYPTO | Merkle Puzzles in a Quantum World. | Gilles Brassard, Peter Hyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail |
| 2009 | MFCS | The Communication Complexity of Non-signaling Distributions. | Julien Degorre, Marc Kaplan, Sophie Laplante, Jrmie Roland |
| 2009 | TAMC | Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. | Marc Kaplan, Sophie Laplante |
| 2006 | CiE | Lower Bounds Using Kolmogorov Complexity. | Sophie Laplante |
| 2002 | LICS | Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. | Sophie Laplante, Richard Lassaigne, Frdric Magniez, Sylvain Peyronnet, Michel de Rougemont |
| 1998 | STACS | Nearly Optimal Language Compression Using Extractors. | Lance Fortnow, Sophie Laplante |
| 1991 | STACS | Computationally Convincing Proofs of Knowledge. | Gilles Brassard, Claude Crpeau, Sophie Laplante, Christian Lger |