default search action
Florent Capelli
Person information
- affiliation: University of Lille, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Database Queries. Log. Methods Comput. Sci. 20(1) (2024) - [j7]Antoine Amarilli, Florent Capelli:
Tractable Circuits in Database Theory. SIGMOD Rec. 53(2): 6-20 (2024) - [c14]Florent Capelli, Oliver Irwin
:
Direct Access for Conjunctive Queries with Negations. ICDT 2024: 13:1-13:20 - [c13]Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet:
Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT 2024: 25:1-25:18 - [c12]Florent Capelli, Jean-Marie Lagniez, Andreas Plank, Martina Seidl:
A Top-Down Tree Model Counter for Quantified Boolean Formulas. IJCAI 2024: 1853-1861 - [i21]Antoine Amarilli, Florent Capelli:
Tractable Circuits in Database Theory. CoRR abs/2407.01127 (2024) - [i20]Florent Capelli, Oliver Irwin, Sylvain Salvati:
A Simple Algorithm for Worst-Case Optimal Join and Sampling. CoRR abs/2409.14094 (2024) - [i19]Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros:
Dynamic direct access of MSO query evaluation over strings. CoRR abs/2409.17329 (2024) - 2023
- [c11]Florent Capelli, Yann Strozecki:
Geometric Amortization of Enumeration Algorithms. STACS 2023: 18:1-18:22 - [i18]Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet:
Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR abs/2310.00731 (2023) - [i17]Florent Capelli, Oliver Irwin:
Direct Access for Conjunctive Queries with Negation. CoRR abs/2310.15800 (2023) - [i16]Florent Capelli, Alberto Del Pia, Silvia Di Gregorio:
A Knowledge Compilation Take on Binary Polynomial Optimization. CoRR abs/2311.00149 (2023) - 2022
- [c10]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Queries. ICDT 2022: 5:1-5:19 - [i15]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Linear Programs with Conjunctive Database Queries. CoRR abs/2210.16694 (2022) - 2021
- [j6]Florent Capelli, Yann Strozecki
Enumerating models of DNF faster: Breaking the dependency on the formula size. Discret. Appl. Math. 303: 203-215 (2021) - [c9]Florent Capelli, Jean-Marie Lagniez, Pierre Marquis:
Certifying Top-Down Decision-DNNF Compilers. AAAI 2021: 6244-6253 - [i14]Florent Capelli, Yann Strozecki:
Geometric Amortization of Enumeration Algorithms. CoRR abs/2108.10208 (2021) - 2020
- [j5]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64(5): 861-914 (2020) - [j4]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Correction to: Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64(5): 915 (2020)
2010 – 2019
- 2019
- [j3]Florent Capelli
Incremental delay enumeration: Space and time. Discret. Appl. Math. 268: 179-190 (2019) - [j2]Benjamin Bergougnoux
Counting minimal transversals of β-acyclic hypergraphs. J. Comput. Syst. Sci. 101: 21-30 (2019) - [c8]Florent Capelli
Knowledge Compilation Languages as Proof Systems. SAT 2019: 90-99 - [c7]Florent Capelli, Stefan Mengel:
Tractable QBF by Knowledge Compilation. STACS 2019: 18:1-18:16 - [i13]Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon:
Dependency Weighted Aggregation on Factorized Databases. CoRR abs/1901.03633 (2019) - [i12]Florent Capelli:
Knowledge compilation languages as proof systems. CoRR abs/1903.04039 (2019) - 2018
- [i11]Florent Capelli, Stefan Mengel:
Knowledge Compilation, Width and Quantification. CoRR abs/1807.04263 (2018) - [i10]Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté:
Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR abs/1808.05017 (2018) - [i9]Florent Capelli, Yann Strozecki:
Enumerating models of DNF faster: breaking the dependency on the formula size. CoRR abs/1810.04006 (2018) - [i8]Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart:
Connecting Knowledge Compilation Classes and Width Parameters. CoRR abs/1811.02944 (2018) - 2017
- [c6]Florent Capelli
Understanding the complexity of #SAT using knowledge compilation. LICS 2017: 1-10 - [i7]Florent Capelli:
Understanding the complexity of #SAT using knowledge compilation. CoRR abs/1701.01461 (2017) - [i6]Florent Capelli, Yann Strozecki:
On The Complexity of Enumeration. CoRR abs/1703.01928 (2017) - [i5]Andrea Calì, Florent Capelli, Igor Razgon:
Non-FPT lower bounds for structural restrictions of decision DNNF. CoRR abs/1708.07767 (2017) - 2016
- [j1]Florent Capelli
The Arithmetic Complexity of Tensor Contraction. Theory Comput. Syst. 58(4): 506-527 (2016) - [c5]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
Knowledge Compilation Meets Communication Complexity. IJCAI 2016: 1008-1014 - 2015
- [c4]Simone Bova, Florent Capelli
On Compiling CNFs into Structured Deterministic DNNFs. SAT 2015: 199-214 - [c3]Johann Brault-Baron, Florent Capelli
Understanding Model Counting for beta-acyclic CNF-formulas. STACS 2015: 143-156 - 2014
- [c2]Florent Capelli
Hypergraph Acyclicity and Propositional Model Counting. SAT 2014: 399-414 - [i4]Florent Capelli, Arnaud Durand, Stefan Mengel:
Hypergraph Acyclicity and Propositional Model Counting. CoRR abs/1401.6307 (2014) - [i3]Johann Brault-Baron, Florent Capelli, Stefan Mengel:
Understanding model counting for $β$-acyclic CNF-formulas. CoRR abs/1405.6043 (2014) - [i2]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
Expander CNFs have Exponential DNNF Size. CoRR abs/1411.1995 (2014) - 2013
- [c1]Florent Capelli
The arithmetic complexity of tensor contractions. STACS 2013: 365-376 - 2012
- [i1]Florent Capelli, Arnaud Durand, Stefan Mengel:
The arithmetic complexity of tensor contractions. CoRR abs/1209.4865 (2012)
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-21 21:26 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: