default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClément Maria
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Clément Maria, Hannah Schreiber
:
Discrete Morse Theory for Computing Zigzag Persistence. Discret. Comput. Geom. 71(2): 708-737 (2024)- [j7]Benjamin A. Burton, Hsien-Chih Chang, Maarten Löffler, Clément Maria, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Jonathan Spreer:
Hard Diagrams of the Unknot. Exp. Math. 33(3): 482-500 (2024) - 2023
- [i13]Colleen Delaney, Clément Maria, Eric Samperton:
An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number. CoRR abs/2311.08514 (2023) - 2022
- [c13]Clément Maria, Owen Rouillé:
Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds. ESA 2022: 78:1-78:13 - 2021
- [c12]Clément Maria, Owen Rouillé:
Computation of Large Asymptotics of 3-Manifold Quantum Invariants. ALENEX 2021: 193-206 - [c11]Clément Maria:
Parameterized Complexity of Quantum Knot Invariants. SoCG 2021: 53:1-53:17 - [i12]Clément Maria, Owen Rouillé:
Computing complete hyperbolic structures on cusped 3-manifolds. CoRR abs/2112.06360 (2021) - 2020
- [j6]Clément Maria, Jonathan Spreer:
A Polynomial-Time Algorithm to Compute Turaev-Viro Invariants $\mathrm {TV}_{4, q}$ of 3-Manifolds with Bounded First Betti Number. Found. Comput. Math. 20(5): 1013-1034 (2020) - [c10]Clément Maria, Steve Oudot, Elchanan Solomon:
Intrinsic Topological Transforms via the Distance Kernel Embedding. SoCG 2020: 56:1-56:15 - [i11]Jean-Daniel Boissonnat, Clément Maria:
The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes. CoRR abs/2001.02581 (2020) - [i10]Jean-Daniel Boissonnat, Clément Maria:
Computing Persistent Homology with Various Coefficient Fields in a Single Pass. CoRR abs/2001.02960 (2020) - [i9]Clément Maria, Owen Rouillé:
Computation of Large Asymptotics of 3-Manifold Quantum Invariants. CoRR abs/2010.14316 (2020)
2010 – 2019
- 2019
- [j5]Jean-Daniel Boissonnat, Clément Maria:
Computing persistent homology with various coefficient fields in a single pass. J. Appl. Comput. Topol. 3(1-2): 59-84 (2019) - [c9]Clément Maria, Hannah Schreiber:
Discrete Morse Theory for Computing Zigzag Persistence. WADS 2019: 538-552 - [i8]Clément Maria:
Parameterized complexity of quantum invariants. CoRR abs/1910.00477 (2019) - 2018
- [j4]Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and complexity for Turaev-Viro invariants. J. Appl. Comput. Topol. 2(1-2): 33-53 (2018) - [i7]Clément Maria, Hannah Schreiber:
Discrete Morse Theory for Computing Zigzag Persistence. CoRR abs/1807.05172 (2018) - 2017
- [c8]Clément Maria, Jonathan Spreer:
A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number. SODA 2017: 2721-2732 - 2016
- [c7]Clément Maria, Jonathan Spreer:
Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants. ESA 2016: 64:1-64:16 - [i6]Clément Maria, Jonathan Spreer:
A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number. CoRR abs/1607.02218 (2016) - [i5]Clément Maria, Steve Oudot:
Computing Zigzag Persistent Cohomology. CoRR abs/1608.06039 (2016) - 2015
- [j3]Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria:
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology. Algorithmica 73(3): 607-619 (2015) - [c6]Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and Complexity for Turaev-Viro Invariants. ICALP (1) 2015: 281-293 - [c5]Clément Maria, Steve Y. Oudot:
Zigzag Persistence via Reflections and Transpositions. SODA 2015: 181-199 - [i4]Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and complexity for Turaev-Viro invariants. CoRR abs/1503.04099 (2015) - [i3]Clément Maria, Jonathan Spreer:
Admissible colourings of 3-manifold triangulations for Turaev-Viro type invariants. CoRR abs/1512.04648 (2015) - 2014
- [b1]Clément Maria:
Algorithms and data structures in computational topology. (Algorithmes et structures de données en topologie algorithmique). University of Nice Sophia Antipolis, France, 2014 - [j2]Jean-Daniel Boissonnat, Clément Maria:
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. Algorithmica 70(3): 406-427 (2014) - [c4]Jean-Daniel Boissonnat, Clément Maria:
Computing Persistent Homology with Various Coefficient Fields in a Single Pass. ESA 2014: 185-196 - [c3]Clément Maria, Jean-Daniel Boissonnat, Marc Glisse, Mariette Yvinec:
The Gudhi Library: Simplicial Complexes and Persistent Homology. ICMS 2014: 167-174 - [i2]Brittany Terese Fasy, Jisu Kim, Fabrizio Lecci, Clément Maria:
Introduction to the R package TDA. CoRR abs/1411.1830 (2014) - 2013
- [c2]Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria:
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology. ESA 2013: 695-706 - [i1]Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria:
The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology. CoRR abs/1304.6813 (2013) - 2012
- [j1]Bernd Gärtner, Martin Jaggi, Clément Maria:
An Exponential Lower Bound on the Complexity of Regularization Paths. J. Comput. Geom. 3(1): 168-195 (2012) - [c1]Jean-Daniel Boissonnat, Clément Maria:
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. ESA 2012: 731-742
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-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
