default search action
Sophie Laplante
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c23]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate Games. ITCS 2023: 32:1-32:24 - [c22]Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin:
The Communication Complexity of Functions with Large Outputs. SIROCCO 2023: 427-458 - [i14]Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin:
The communication complexity of functions with large outputs. CoRR abs/2304.00391 (2023) - [i13]Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin:
The communication complexity of functions with large outputs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i12]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. CoRR abs/2211.03396 (2022) - [i11]Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. Electron. Colloquium Comput. Complex. TR22 (2022) - 2020
- [c21]Sophie Laplante, Reza Naserasr, Anupa Sunny:
Sensitivity Lower Bounds from Linear Dependencies. MFCS 2020: 62:1-62:14 - [i10]Sophie Laplante, Reza Naserasr, Anupa Sunny:
Sensitivity lower bounds from linear dependencies. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j13]Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Key Establishment à la Merkle in a Quantum World. J. Cryptol. 32(3): 601-634 (2019) - 2017
- [c20]Aleksandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, Louis Salvail:
Provably Secure Key Establishment Against Quantum Adversaries. TQC 2017: 3:1-3:17 - 2016
- [j12]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does Not Separate Information and Communication Complexity. ACM Trans. Comput. Theory 9(1): 4:1-4:15 (2016) - [c19]Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno:
Robust Bell Inequalities from Communication Complexity. TQC 2016: 5:1-5:24 - [i9]Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno:
Robust Bell inequalities from communication complexity. CoRR abs/1606.09514 (2016) - 2015
- [j11]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM J. Comput. 44(5): 1550-1572 (2015) - [c18]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) 2015: 506-516 - [i8]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy does not separate Information and Communication Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2012
- [c17]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS 2012: 500-509 - [c16]Sophie Laplante, Virginie Lerays, Jérémie Roland:
Classical and Quantum Partition Bound and Detector Inefficiency. ICALP (1) 2012: 617-628 - [i7]Sophie Laplante, Virginie Lerays, Jérémie Roland:
Classical and quantum partition bound and detector inefficiency. CoRR abs/1203.4155 (2012) - [i6]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower bounds on information complexity via zero-communication protocols and applications. CoRR abs/1204.1505 (2012) - [i5]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower bounds on information complexity via zero-communication protocols and applications. Electron. Colloquium Comput. Complex. TR12 (2012) - [i4]Sophie Laplante, Virginie Lerays, Jérémie Roland:
Classical and quantum partition bound and detector inefficiency. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j10]Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland:
Non-local box complexity and secure function evaluation. Quantum Inf. Comput. 11(1&2): 40-69 (2011) - [j9]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The communication complexity of non-signaling distributions. Quantum Inf. Comput. 11(7&8): 649-676 (2011) - [j8]Marc Kaplan, Sophie Laplante:
Kolmogorov complexity and combinatorial methods in communication complexity. Theor. Comput. Sci. 412(23): 2524-2535 (2011) - [c15]Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Merkle Puzzles in a Quantum World. CRYPTO 2011: 391-410
2000 – 2009
- 2009
- [c14]Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland:
Non-Local Box Complexity and Secure Function Evaluation. FSTTCS 2009: 239-250 - [c13]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The Communication Complexity of Non-signaling Distributions. MFCS 2009: 270-281 - [c12]Marc Kaplan, Sophie Laplante:
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. TAMC 2009: 261-270 - 2008
- [j7]Sophie Laplante, Frédéric Magniez:
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. SIAM J. Comput. 38(1): 46-62 (2008) - [i3]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The communication complexity of non-signaling distributions. CoRR abs/0804.4859 (2008) - [i2]Marc Kaplan, Sophie Laplante:
Kolmogorov complexity and combinatorial methods in communication complexity. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j6]Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic abstraction for model checking: An approach based on property testing. ACM Trans. Comput. Log. 8(4): 20 (2007) - [c11]Luis Antunes, Sophie Laplante, Alexandre Pinto, Liliana C. M. Salvador:
Cryptographic Security of Individual Instances. ICITS 2007: 195-210 - 2006
- [j5]Sophie Laplante, Troy Lee, Mario Szegedy:
The Quantum Adversary Method and Classical Formula Size Lower Bounds. Comput. Complex. 15(2): 163-196 (2006) - [c10]Sophie Laplante:
Lower Bounds Using Kolmogorov Complexity. CiE 2006: 297-306 - 2005
- [c9]Sophie Laplante, Troy Lee, Mario Szegedy:
The Quantum Adversary Method and Classical Formula Size Lower Bounds. CCC 2005: 76-90 - 2004
- [c8]Sophie Laplante, Frédéric Magniez:
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. CCC 2004: 294-304 - 2002
- [c7]Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. LICS 2002: 30-39 - 2001
- [j4]André Berthiaume, Wim van Dam, Sophie Laplante:
Quantum Kolmogorov Complexity. J. Comput. Syst. Sci. 63(2): 201-221 (2001) - [j3]Harry Buhrman, Lance Fortnow, Sophie Laplante:
Resource-Bounded Kolmogorov Complexity Revisited. SIAM J. Comput. 31(3): 887-905 (2001) - [i1]Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic abstraction for model checking: An approach based on property testing. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c6]Harry Buhrman, Sophie Laplante, Peter Bro Miltersen:
New Bounds for the Language Compression Problem. CCC 2000: 126-130 - [c5]André Berthiaume, Wim van Dam, Sophie Laplante:
Quantum Kolmogorov Complexity. CCC 2000: 240-249
1990 – 1999
- 1999
- [c4]László Babai, Sophie Laplante:
Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. CCC 1999: 98-104 - 1998
- [j2]Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik:
On Coherence, Random-Self-Reducibility, and Self-Correction. Comput. Complex. 7(2): 174-191 (1998) - [c3]Lance Fortnow, Sophie Laplante:
Nearly Optimal Language Compression Using Extractors. STACS 1998: 84-93 - 1996
- [c2]Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik:
On Coherence, Random-self-reducibility, and Self-correction. CCC 1996: 59-67 - 1995
- [j1]Lance Fortnow, Sophie Laplante:
Circuit Lower Bounds à la Kolmogorov. Inf. Comput. 123(1): 121-126 (1995) - 1991
- [c1]Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger:
Computationally Convincing Proofs of Knowledge. STACS 1991: 251-262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-16 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint