Sophie Laplante
机构: IRIF, Université Paris Cité
每年引用次数
引用次数
引用: 960
H-指数: 16
I10-指数 : 19
出版物: 44
Extractors for Kolmogorov Complexity
Sophie Laplante , Lance Fortnow
1996
A note on adaptiveness and advice in coherence
Sophie Laplante , Lance Fortnow
University of Chicago
1994
Classical and quantum partition bound and detector inefficiency.
Virginie Lerays , Sophie Laplante , Jérémie Roland
Electronic Colloquium on Computational Complexity 19 23
2012
Quantum Kolmogorov Complexity
Sophie Laplante , Wim van Dam , André Berthiaume
Journal of Computer and System Sciences 63 ( 2) 201 -221
54
2001
Provably secure key establishment against quantum adversaries
Aleksandrs Belovs , Sophie Laplante , Gilles Brassard , Louis Salvail
conference on theory of quantum computation, communication and cryptography
8
2017
Sensitivity Lower Bounds from Linear Dependencies.
Sophie Laplante , Anupa Sunny , Reza Naserasr
mathematical foundations of computer science
2020
Robust Bell inequalities from communication complexity
Sophie Laplante , Gabriel Senno , Jérémie Roland , Alexandre Nolin
Quantum 2 72
2018
Simulating quantum correlations as a distributed sampling problem
Julien Degorre , Sophie Laplante , Jérémie Roland
Physical Review A 72 ( 6) 062314
57
2005
Classical simulation of traceless binary observables on any bipartite quantum state
Julien Degorre , Sophie Laplante , Jérémie Roland
Physical Review A 75 ( 1) 012309
19
2007
Merkle puzzles in a quantum world
Gilles Brassard , Peter Høyer , Kassem Kalach , Marc Kaplan
international cryptology conference 391 -410
34
2011
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
Sophie Laplante , Troy Lee , Mario Szegedy
Computational Complexity 15 ( 2) 163 -196
56
2006
Relative Discrepancy Does Not Separate Information and Communication Complexity
Lila Fontes , Rahul Jain , Iordanis Kerenidis , Sophie Laplante
ACM Transactions on Computation Theory 9 ( 1) 1 -15
2
2016
Probabilistic abstraction for model checking: An approach based on property testing
Sophie Laplante , Richard Lassaigne , Frédéric Magniez , Sylvain Peyronnet
ACM Transactions on Computational Logic 8 ( 4) 20
24
2007
Lower Bounds Using Kolmogorov Complexity
Sophie Laplante
Logical Approaches to Computational Barriers 297 -306
2006
Kolmogorov complexity and combinatorial methods in communication complexity
Marc Kaplan , Sophie Laplante
Theoretical Computer Science 412 ( 23) 2524 -2535
2
2011
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
Iordanis Kerenidis , Sophie Laplante , Virginie Lerays , Jérémie Roland
SIAM Journal on Computing 44 ( 5) 1550 -1572
14
2015
Key Establishment à la Merkle in a Quantum World
Gilles Brassard , Peter Høyer , Kassem Kalach , Marc Kaplan
Journal of Cryptology 32 ( 3) 601 -634
1
2019
Computationally convincing proofs of knowledge
Gilles Brassard , Sophie Laplante , Claude Crépeau , Christian Léger
symposium on theoretical aspects of computer science 251 -262
15
1991
Nearly Optimal Language Compression Using Extractors
Lance Fortnow , Sophie Laplante
symposium on theoretical aspects of computer science 1373 84 -93
5
1998
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
Sophie Laplante , Frédéric Magniez
SIAM Journal on Computing 38 ( 1) 46 -62
25
2008