Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Andrew Aukerman, Mathieu Carrière, Chao Chen, Kevin Gardner, Raúl Rabadán, and Rami Vanguri. Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility Study. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aukerman_et_al:LIPIcs.SoCG.2020.11, author = {Aukerman, Andrew and Carri\`{e}re, Mathieu and Chen, Chao and Gardner, Kevin and Rabad\'{a}n, Ra\'{u}l and Vanguri, Rami}, title = {{Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility Study}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {11:1--11:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.11}, URN = {urn:nbn:de:0030-drops-121695}, doi = {10.4230/LIPIcs.SoCG.2020.11}, annote = {Keywords: Topological data analysis, persistence diagrams} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Mathieu Carrière and Ulrich Bauer. On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{carriere_et_al:LIPIcs.SoCG.2019.21, author = {Carri\`{e}re, Mathieu and Bauer, Ulrich}, title = {{On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.21}, URN = {urn:nbn:de:0030-drops-104259}, doi = {10.4230/LIPIcs.SoCG.2019.21}, annote = {Keywords: Topological Data Analysis, Persistence Diagrams, Hilbert space embedding} }
Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
Mathieu Laurière and Dave Touchette. The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, p. 47:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{lauriere_et_al:LIPIcs.ITCS.2017.47, author = {Lauri\`{e}re, Mathieu and Touchette, Dave}, title = {{The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting}}, booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)}, pages = {47:1--47:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-029-3}, ISSN = {1868-8969}, year = {2017}, volume = {67}, editor = {Papadimitriou, Christos H.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.47}, URN = {urn:nbn:de:0030-drops-81898}, doi = {10.4230/LIPIcs.ITCS.2017.47}, annote = {Keywords: Communication Complexity, Information Complexity, Quantum Computation and Information} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Mathieu Carrière and Steve Oudot. Local Equivalence and Intrinsic Metrics between Reeb Graphs. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{carriere_et_al:LIPIcs.SoCG.2017.25, author = {Carri\`{e}re, Mathieu and Oudot, Steve}, title = {{Local Equivalence and Intrinsic Metrics between Reeb Graphs}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {25:1--25:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.25}, URN = {urn:nbn:de:0030-drops-71794}, doi = {10.4230/LIPIcs.SoCG.2017.25}, annote = {Keywords: Reeb Graphs, Extended Persistence, Induced Metrics, Topological Data Analysis} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Titouan Carette, Mathieu Laurière, and Frédéric Magniez. Extended Learning Graphs for Triangle Finding. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{carette_et_al:LIPIcs.STACS.2017.20, author = {Carette, Titouan and Lauri\`{e}re, Mathieu and Magniez, Fr\'{e}d\'{e}ric}, title = {{Extended Learning Graphs for Triangle Finding}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.20}, URN = {urn:nbn:de:0030-drops-70132}, doi = {10.4230/LIPIcs.STACS.2017.20}, annote = {Keywords: Quantum query complexity, learning graphs, triangle finding} }
Published in: LIPIcs, Volume 61, 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)
Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, and Gabriel Senno. Robust Bell Inequalities from Communication Complexity. In 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 61, pp. 5:1-5:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{laplante_et_al:LIPIcs.TQC.2016.5, author = {Laplante, Sophie and Lauri\`{e}re, Mathieu and Nolin, Alexandre and Roland, J\'{e}r\'{e}mie and Senno, Gabriel}, title = {{Robust Bell Inequalities from Communication Complexity}}, booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)}, pages = {5:1--5:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-019-4}, ISSN = {1868-8969}, year = {2016}, volume = {61}, editor = {Broadbent, Anne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.5}, URN = {urn:nbn:de:0030-drops-66867}, doi = {10.4230/LIPIcs.TQC.2016.5}, annote = {Keywords: Communication complexity, Bell inequalities, nonlocality, detector efficiency} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Mathieu Carrière and Steve Oudot. Structure and Stability of the 1-Dimensional Mapper. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{carriere_et_al:LIPIcs.SoCG.2016.25, author = {Carri\`{e}re, Mathieu and Oudot, Steve}, title = {{Structure and Stability of the 1-Dimensional Mapper}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.25}, URN = {urn:nbn:de:0030-drops-59175}, doi = {10.4230/LIPIcs.SoCG.2016.25}, annote = {Keywords: Mapper, Reeb Graph, Extended Persistence, Topological Data Analysis} }
Feedback for Dagstuhl Publishing