default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Clément
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]François Clément, Carola Doerr, Luís Paquete:
Heuristic approaches to obtain low-discrepancy point sets via subset selection. J. Complex. 83: 101852 (2024)- [j7]François Clément
, Nathan Kirk, Florian Pausinger:
Partitions for stratified sampling. Monte Carlo Methods Appl. 30(2): 163-181 (2024) - [i16]Sylvie Boldo, François Clément, David Hamelin, Micaela Mayero, Pierre Rousselin:
Teaching Divisibility and Binomials with Coq. CoRR abs/2404.12676 (2024) - [i15]François Clément:
Outperforming the Best 1D Low-Discrepancy Constructions with a Greedy Algorithm. CoRR abs/2406.18132 (2024) - [i14]François Clément, Carola Doerr, Kathrin Klamroth, Luís Paquete:
Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem. CoRR abs/2407.11533 (2024) - [i13]François Clément, Vincent Martin:
Finite element method. Detailed proofs to be formalized in Coq. CoRR abs/2410.01538 (2024) - 2023
- [c6]Sylvie Boldo, François Clément, Vincent Martin, Micaela Mayero, Houda Mouhcine:
A Coq Formalization of Lebesgue Induction Principle and Tonelli's Theorem. FM 2023: 39-55 - [c5]François Clément, Diederick Vermetten, Jacob de Nobel, Alexandre D. Jesus, Luís Paquete, Carola Doerr:
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms. GECCO 2023: 1330-1338 - [d1]François Clément, Diederick Vermetten, Jacob de Nobel, Alexandre D. Jesus, Luís Paquete, Carola Doerr:
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms - Code and Data. Zenodo, 2023
- [i12]François Clément, Carola Doerr, Luís Paquete:
Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection. CoRR abs/2306.15276 (2023) - [i11]François Clément, Diederick Vermetten, Jacob de Nobel, Alexandre D. Jesus, Luís Paquete, Carola Doerr:
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms. CoRR abs/2306.16998 (2023) - [i10]François Clément, Carola Doerr, Kathrin Klamroth, Luís Paquete:
Constructing Optimal L∞ Star Discrepancy Sets. CoRR abs/2311.17463 (2023) - 2022
- [j6]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq Formalization of Lebesgue Integration of Nonnegative Functions. J. Autom. Reason. 66(2): 175-213 (2022) - [j5]François Clément, Carola Doerr, Luís Paquete:
Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions. J. Complex. 70: 101645 (2022) - [j4]François Clément, Thang Pham:
Distribution of Distances in Five Dimensions and Related Problems. SIAM J. Discret. Math. 36(3): 2271-2281 (2022) - [i9]Sylvie Boldo, François Clément, Louise Leclerc:
A Coq Formalization of the Bochner integral. CoRR abs/2201.03242 (2022) - [i8]Sylvie Boldo, François Clément, Vincent Martin, Micaela Mayero, Houda Mouhcine:
Lebesgue Induction and Tonelli's Theorem in Coq. CoRR abs/2202.05040 (2022) - 2021
- [i7]François Clément, Vincent Martin:
Lebesgue integration. Detailed proofs to be formalized in Coq. CoRR abs/2101.05678 (2021) - [i6]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq Formalization of Lebesgue Integration of Nonnegative Functions. CoRR abs/2104.05256 (2021)
2010 – 2019
- 2017
- [c4]Sylvie Boldo, François Clément, Florian Faissole, Vincent Martin, Micaela Mayero:
A Coq formal proof of the LaxMilgram theorem. CPP 2017: 79-89 - 2016
- [i5]François Clément, Vincent Martin:
The Lax-Milgram Theorem. A detailed proof to be formalized in Coq. CoRR abs/1607.03618 (2016) - 2014
- [j3]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Trusting computations: A mechanized proof from partial differential equations to actual program. Comput. Math. Appl. 68(3): 325-352 (2014) - 2013
- [j2]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Wave Equation Numerical Resolution: A Comprehensive Mechanized Proof of a C Program. J. Autom. Reason. 50(4): 423-456 (2013) - 2012
- [i4]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Trusting Computations: a Mechanized Proof from Partial Differential Equations to Actual Program. CoRR abs/1212.6641 (2012) - 2011
- [i3]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Wave Equation Numerical Resolution: Mathematics and Program. CoRR abs/1112.1795 (2011) - 2010
- [c3]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Formal Proof of a Wave Equation Resolution Scheme: The Method Error. ITP 2010: 147-162 - [i2]Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, Pierre Weis:
Formal Proof of a Wave Equation Resolution Scheme: the Method Error. CoRR abs/1005.0824 (2010) - [i1]François Clément, Hend Ben Ameur, Guy Chavent, Pierre Weis:
Image Segmentation with Optimal Control Techniques. CoRR abs/1011.2292 (2010)
2000 – 2009
- 2006
- [j1]François Clément, Vincent Martin, A. Vodicka, Roberto Di Cosmo, Pierre Weis:
Domain decomposition and skeleton programming with OCamlP3l. Parallel Comput. 32(7-8): 539-550 (2006) - [c2]Olivier Caelen, Gianluca Bontempi, Eddy Coussaert, Luc Barvais, François Clément:
Machine Learning Techniques to Enable Closed-Loop Control in Anesthesia. CBMS 2006: 696-701 - 2005
- [c1]François Clément, Vincent Martin, A. Vodicka, Roberto Di Cosmo, Pierre Weis:
Domain Decomposition and Skeleton Programming with OCamlP3l. PARCO 2005: 811-818
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-11-11 21:32 CET 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:
