Sophie Laplante, Mathieu Lauriere, Alexandre Nolin, Jérémie Roland, Gabriel Senno,
Robust Bell inequalities from communication complexity.
Proceedings of TQC 2016, LIPIcs Vol. 61, 5:1-5:24.
quant-ph Technical Report number 1606.09514, 2016.
Gilles Brassard, Peter Hoyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail.
Merkle Puzzles in a Quantum World,
quant-ph Report Number 1108.2316. Proceedings of Crypto 2011, pp. 385-404.
Journal of Cryptology, to appear.
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jeremie Roland,
Non-local box complexity and secure function evaluation
quant-ph Technical Report number 0903.2179.
Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, pages 239-250, 2009. Quantum Information and Computation, 11(1&2):40-69, 2011.
Marc Kaplan, Sophie Laplante,
Kolmogorov complexity and combinatorial methods in communication complexity,
ECCC Report number TR-08-109. Proceedings of the Conference on Theory and Applications of Models of Computation 2009, pp. 261-270.
Special Issue on TAMC, Theor. Comput. Sci. 412(23): 2524-2535 (2011)
Julien Degorre, Marc Kaplan,
Sophie Laplante, Jérémie Roland,
The communication complexity of non-signaling distributions
quant-ph Technical Report number 0804.4859. Proceedings 34th International Symposium of the Mathematical Foundations of Computer Science MFCS 2009, pp. 270-281. Quantum Information and Computation, 11(8): 0649-0676, 2011.
Luis Antunes, Sophie Laplante, Alexandre Pinto, Liliana Salvador,
Cryptographic security of individual instances,
Proceedings of International Conference on
Information Theoretic Security 2007, pp. 195-210.
Harry Buhrman, Lance Fortnow, Sophie Laplante.
Resource-bounded Kolmogorov complexity revisited,
SIAM Journal on Computing, 2001.
Includes results from the paper: Nearly Optimal Language Compression
using Extractors, STACS 98.
2000
André Berthiaume, Wim van Dam, Sophie Laplante,
Quantum Kolmogorov Complexity,
Complexity 2000, 240-249. JCSS,
Special Issue on Complexity 2000,
Volume 63, No. 2, September 2001, 201-221.