Fontes, Lila; Laplante, Sophie; Laurière, Mathieu; Nolin, Alexandre The communication complexity of functions with large outputs. (English) Zbl 07786530 Rajsbaum, Sergio (ed.) et al., Structural information and communication complexity. 30th international colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13892, 427-458 (2023). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{L. Fontes} et al., Lect. Notes Comput. Sci. 13892, 427--458 (2023; Zbl 07786530) Full Text: DOI arXiv
Delcroix-Oger, Bérénice; Laplante-Anfossi, Guillaume; Pilaud, Vincent; Stoeckl, Kurt Cellular diagonals of permutahedra. arXiv:2308.12119 Preprint, arXiv:2308.12119 [math.CO] (2023). MSC: 05A15 05C05 18M70 52B11 52C35 BibTeX Cite \textit{B. Delcroix-Oger} et al., ``Cellular diagonals of permutahedra'', Preprint, arXiv:2308.12119 [math.CO] (2023) Full Text: arXiv OA License
Laplante, Sophie; Naserasr, Reza; Sunny, Anupa Sensitivity lower bounds from linear dependencies. (English) Zbl 07559433 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 62, 14 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Laplante} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 62, 14 p. (2020; Zbl 07559433) Full Text: DOI
Brassard, Gilles; Høyer, Peter; Kalach, Kassem; Kaplan, Marc; Laplante, Sophie; Salvail, Louis Key establishment à la Merkle in a quantum world. (English) Zbl 1466.94020 J. Cryptology 32, No. 3, 601-634 (2019). MSC: 94A60 81P94 PDFBibTeX XMLCite \textit{G. Brassard} et al., J. Cryptology 32, No. 3, 601--634 (2019; Zbl 1466.94020) Full Text: DOI arXiv
Belovs, Aleksandrs; Brassard, Gilles; Høyer, Peter; Kaplan, Marc; Laplante, Sophie; Salvail, Louis Provably secure key establishment against quantum adversaries. (English) Zbl 1427.81024 Wilde, Mark M. (ed.), 12th conference on the theory of quantum computation, communication and cryptography, TQC 2017, June 14–16, 2017, Paris, France. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 73, Article 3, 17 p. (2018). MSC: 81P94 94A60 PDFBibTeX XMLCite \textit{A. Belovs} et al., LIPIcs -- Leibniz Int. Proc. Inform. 73, Article 3, 17 p. (2018; Zbl 1427.81024) Full Text: DOI arXiv
Fontes, Lila; Jain, Rahul; Kerenidis, Iordanis; Laplante, Sophie; Laurière, Mathieu; Roland, Jérémie Relative discrepancy does not separate information and communication complexity. (English) Zbl 1427.68082 ACM Trans. Comput. Theory 9, No. 1, Article No. 4, 15 p. (2016). MSC: 68Q11 68Q15 PDFBibTeX XMLCite \textit{L. Fontes} et al., ACM Trans. Comput. Theory 9, No. 1, Article No. 4, 15 p. (2016; Zbl 1427.68082) Full Text: DOI Link
Laplante, Sophie; Laurière, Mathieu; Nolin, Alexandre; Roland, Jérémie; Senno, Gabriel Robust Bell inequalities from communication complexity. (English) Zbl 1370.81042 Broadbent, Anne (ed.), 11th conference on the theory of quantum computation, communication and cryptography, TQC 2016, Berlin, Germany, September 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-019-4). LIPIcs – Leibniz International Proceedings in Informatics 61, Article 5, 24 p. (2016). MSC: 81P45 68Q05 68Q17 81P15 81P68 PDFBibTeX XMLCite \textit{S. Laplante} et al., LIPIcs -- Leibniz Int. Proc. Inform. 61, Article 5, 24~p. (2016; Zbl 1370.81042) Full Text: DOI arXiv
Kerenidis, Iordanis; Laplante, Sophie; Lerays, Virginie; Roland, Jérémie; Xiao, David Lower bounds on information complexity via zero-communication protocols and applications. (English) Zbl 1330.68096 SIAM J. Comput. 44, No. 5, 1550-1572 (2015). MSC: 68Q17 68P30 68Q05 PDFBibTeX XMLCite \textit{I. Kerenidis} et al., SIAM J. Comput. 44, No. 5, 1550--1572 (2015; Zbl 1330.68096) Full Text: DOI arXiv Link
Fontes, Lila; Jain, Rahul; Kerenidis, Iordanis; Laplante, Sophie; Laurière, Mathieu; Roland, Jérémie Relative discrepancy does not separate information and communication complexity. (English) Zbl 1440.68090 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 506-516 (2015). MSC: 68Q11 PDFBibTeX XMLCite \textit{L. Fontes} et al., Lect. Notes Comput. Sci. 9134, 506--516 (2015; Zbl 1440.68090) Full Text: DOI Link
Laplante, Sophie; Lerays, Virginie; Roland, Jérémie Classical and quantum partition bound and detector inefficiency. (English) Zbl 1272.68145 Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 617-628 (2012). MSC: 68Q17 68Q05 68Q12 PDFBibTeX XMLCite \textit{S. Laplante} et al., Lect. Notes Comput. Sci. 7391, 617--628 (2012; Zbl 1272.68145) Full Text: DOI arXiv
Degorre, Julien; Kaplan, Marc; Laplante, Sophie; Roland, Jérémie The communication complexity of non-signaling distributions. (English) Zbl 1243.81048 Quantum Inf. Comput. 11, No. 7-8, 649-676 (2011). Reviewer: Vladimir V. Kisil (Leeds) MSC: 81P45 68Q12 92C55 91A25 94A12 81P40 PDFBibTeX XMLCite \textit{J. Degorre} et al., Quantum Inf. Comput. 11, No. 7--8, 649--676 (2011; Zbl 1243.81048)
Kaplan, Marc; Kerenidis, Iordanis; Laplante, Sophie; Roland, Jérémie Non-local box complexity and secure function evaluation. (English) Zbl 1234.81050 Quantum Inf. Comput. 11, No. 1-2, 40-69 (2011). MSC: 81P45 68Q12 PDFBibTeX XMLCite \textit{M. Kaplan} et al., Quantum Inf. Comput. 11, No. 1--2, 40--69 (2011; Zbl 1234.81050) Full Text: arXiv
Brassard, Gilles; Høyer, Peter; Kalach, Kassem; Kaplan, Marc; Laplante, Sophie; Salvail, Louis Merkle puzzles in a quantum world. (English) Zbl 1287.94057 Rogaway, Phillip (ed.), Advances in cryptology – CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 391-410 (2011). MSC: 94A60 PDFBibTeX XMLCite \textit{G. Brassard} et al., Lect. Notes Comput. Sci. 6841, 391--410 (2011; Zbl 1287.94057) Full Text: DOI
Kaplan, Marc; Laplante, Sophie Kolmogorov complexity and combinatorial methods in communication complexity. (English) Zbl 1216.68134 Theor. Comput. Sci. 412, No. 23, 2524-2535 (2011). MSC: 68Q30 68Q17 81P45 PDFBibTeX XMLCite \textit{M. Kaplan} and \textit{S. Laplante}, Theor. Comput. Sci. 412, No. 23, 2524--2535 (2011; Zbl 1216.68134) Full Text: DOI
Kaplan, Marc; Kerenidis, Iordanis; Laplante, Sophie; Roland, Jérémie Non-local box complexity and secure function evaluation. (English) Zbl 1248.68218 Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15–17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPIcs – Leibniz International Proceedings in Informatics 4, 239-250, electronic only (2009). MSC: 68Q17 68Q12 68Q30 68Q05 94A60 94A05 PDFBibTeX XMLCite \textit{M. Kaplan} et al., LIPIcs -- Leibniz Int. Proc. Inform. 4, 239--250 (2009; Zbl 1248.68218) Full Text: DOI Link
Antunes, L.; Laplante, S.; Pinto, A.; Salvador, L. Cryptographic security of individual instances. (English) Zbl 1263.94019 Desmedt, Yvo (ed.), Information theoretic security. Second international conference, ICITS 2007, Madrid, Spain, May 25–29, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10229-5/pbk). Lecture Notes in Computer Science 4883, 195-210 (2009). MSC: 94A60 68Q30 94A15 PDFBibTeX XMLCite \textit{L. Antunes} et al., Lect. Notes Comput. Sci. 4883, 195--210 (2009; Zbl 1263.94019) Full Text: DOI
Degorre, Julien; Kaplan, Marc; Laplante, Sophie; Roland, Jérémie The communication complexity of non-signaling distributions. (English) Zbl 1250.68107 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 270-281 (2009). MSC: 68Q05 68Q12 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Degorre} et al., Lect. Notes Comput. Sci. 5734, 270--281 (2009; Zbl 1250.68107) Full Text: DOI arXiv
Kaplan, Marc; Laplante, Sophie Kolmogorov complexity and combinatorial methods in communication complexity. (English) Zbl 1241.68074 Chen, Jianer (ed.) et al., Theory and applications of models of computation. 6th annual conference, TAMC 2009, Changsha, China, May 18–22, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02016-2/pbk). Lecture Notes in Computer Science 5532, 261-270 (2009). MSC: 68Q30 68Q17 81P45 PDFBibTeX XMLCite \textit{M. Kaplan} and \textit{S. Laplante}, Lect. Notes Comput. Sci. 5532, 261--270 (2009; Zbl 1241.68074) Full Text: DOI
Laplante, Sophie; Magniez, Frédéric Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. (English) Zbl 1158.81319 SIAM J. Comput. 38, No. 1, 46-62 (2008). MSC: 81P68 68Q30 PDFBibTeX XMLCite \textit{S. Laplante} and \textit{F. Magniez}, SIAM J. Comput. 38, No. 1, 46--62 (2008; Zbl 1158.81319) Full Text: DOI arXiv
Laplante, Sophie; Lassaigne, Richard; Magniez, Frédéric; Peyronnet, Sylvain; de Rougemont, Michel Probabilistic abstraction for model checking: an approach based on property testing. (English) Zbl 1367.68197 ACM Trans. Comput. Log. 8, No. 4, Article No. 20, 24 p. (2007). MSC: 68Q60 68W20 PDFBibTeX XMLCite \textit{S. Laplante} et al., ACM Trans. Comput. Log. 8, No. 4, Article No. 20, 24 p. (2007; Zbl 1367.68197) Full Text: DOI
Laplante, Sophie; Lee, Troy; Szegedy, Mario The quantum adversary method and classical formula size power bounds. (English) Zbl 1132.68032 Comput. Complexity 15, No. 2, 163-196 (2006). MSC: 68Q17 68Q30 81P68 PDFBibTeX XMLCite \textit{S. Laplante} et al., Comput. Complexity 15, No. 2, 163--196 (2006; Zbl 1132.68032) Full Text: DOI arXiv
Laplante, Sophie Lower bounds using Kolmogorov complexity. (English) Zbl 1145.68429 Beckmann, Arnold (ed.) et al., Logical approaches to computational barriers. Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30–July 5, 2006. Proceedings. Berlin: Springer (ISBN 3-540-35466-2/pbk). Lecture Notes in Computer Science 3988, 297-306 (2006). MSC: 68Q17 68Q30 PDFBibTeX XMLCite \textit{S. Laplante}, Lect. Notes Comput. Sci. 3988, 297--306 (2006; Zbl 1145.68429) Full Text: DOI
Laplante, W.; Chen, T.; Baz, A.; Sheilds, W. Active control of vibration and noise radiation from fluid-loaded cylinder using active constrained layer damping. (English) Zbl 1062.74573 J. Vib. Control 8, No. 6, 877-902 (2002). MSC: 74M05 74F10 74H45 74S05 74-05 76Q05 PDFBibTeX XMLCite \textit{W. Laplante} et al., J. Vib. Control 8, No. 6, 877--902 (2002; Zbl 1062.74573) Full Text: DOI
Sinha, D.; Laplante, P. Handling spatial uncertainty in binary images: A rough set based approach. (English) Zbl 1013.68583 Alpigini, James J. (ed.) et al., Rough sets and current trends in computing. 3rd international conference, RSCTC 2002, Malvern, PA, USA, October 14-16, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2475, 610-620 (2002). MSC: 68T37 03E72 68U10 68T45 PDFBibTeX XMLCite \textit{D. Sinha} and \textit{P. Laplante}, Lect. Notes Comput. Sci. 2475, 610--620 (2002; Zbl 1013.68583) Full Text: Link
Buhrman, Harry; Fortnow, Lance; Laplante, Sophie Resource-bounded Kolmogorov complexity revisited. (English) Zbl 1017.68061 SIAM J. Comput. 31, No. 3, 887-905 (2002). MSC: 68Q30 68Q15 PDFBibTeX XMLCite \textit{H. Buhrman} et al., SIAM J. Comput. 31, No. 3, 887--905 (2002; Zbl 1017.68061) Full Text: DOI
Dasgupta, Susmita; Laplante, Benoit; Mamingi, Nlandu Pollution and capital markets in developing countries. (English) Zbl 1012.91038 J. Environ. Econ. Manage. 42, No. 3, 310-335 (2001). MSC: 91B76 91B28 91B74 PDFBibTeX XMLCite \textit{S. Dasgupta} et al., J. Environ. Econ. Manage. 42, No. 3, 310--335 (2001; Zbl 1012.91038) Full Text: DOI
Berthiaume, André; van Dam, Wim; Laplante, Sophie Quantum Kolmogorov complexity. (English) Zbl 0992.68086 J. Comput. Syst. Sci. 63, No. 2, 201-221 (2001). MSC: 68Q30 PDFBibTeX XMLCite \textit{A. Berthiaume} et al., J. Comput. Syst. Sci. 63, No. 2, 201--221 (2001; Zbl 0992.68086) Full Text: DOI arXiv Link
Feigenbaum, Joan; Fortnow, Lance; Laplante, Sophie; Naik, Ashish On coherence, random-self-reducibility, and self-correction. (English) Zbl 0917.68074 Comput. Complexity 7, No. 2, 174-191 (1998). MSC: 68Q10 68Q15 68Q60 PDFBibTeX XMLCite \textit{J. Feigenbaum} et al., Comput. Complexity 7, No. 2, 174--191 (1998; Zbl 0917.68074) Full Text: DOI
Fortnow, Lance; Laplante, Sophie Nearly optimal language compression using extractors. (English) Zbl 0894.68080 Morvan, Michel (ed.) et al., STACS 98. 15th annual symposium on Theoretical aspects of computer science. Paris, France, February 25–27, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1373, 84-93 (1998). MSC: 68Q30 PDFBibTeX XMLCite \textit{L. Fortnow} and \textit{S. Laplante}, Lect. Notes Comput. Sci. 1373, 84--93 (1998; Zbl 0894.68080)
Fortnow, Lance; Laplante, Sophie Circuit lower bounds à la Kolmogorov. (English) Zbl 1096.68632 Inf. Comput. 123, No. 1, 121-126 (1995). MSC: 68Q30 PDFBibTeX XMLCite \textit{L. Fortnow} and \textit{S. Laplante}, Inf. Comput. 123, No. 1, 121--126 (1995; Zbl 1096.68632) Full Text: DOI Link
Brassard, Gilles; Crépeau, Claude; Laplante, Sophie; Léger, Christian Computationally convincing proofs of knowledge. (English) Zbl 0773.68024 Theoretical aspects of computer science, Proc. 8th Annu. Symp., STACS ’91, Hamburg/Ger. 1991, Lect. Notes Comput. Sci. 480, 251-262 (1991). MSC: 68P25 94A60 PDFBibTeX XMLCite \textit{G. Brassard} et al., Lect. Notes Comput. Sci. 480, 251--262 (1991; Zbl 0773.68024)