×
Author ID: amarilli.antoine Recent zbMATH articles by "Amarilli, Antoine"
Published as: Amarilli, Antoine

Publications by Year

Citations contained in zbMATH Open

12 Publications have been cited 46 times in 30 Documents Cited by Year
A circuit-based approach to efficient enumeration. Zbl 1442.68052
Amarilli, Antoine; Bourhis, Pierre; Jachiet, Louis; Mengel, Stefan
9
2017
Provenance circuits for trees and treelike instances. Zbl 1440.68053
Amarilli, Antoine; Bourhis, Pierre; Senellart, Pierre
8
2015
Constant-delay enumeration for nondeterministic document spanners. Zbl 07561482
Amarilli, Antoine; Bourhis, Pierre; Mengel, Stefan; Niewerth, Matthias
6
2019
Enumeration on trees under relabelings. Zbl 1489.68054
Amarilli, Antoine; Bourhis, Pierre; Mengel, Stefan
5
2018
Topological sorting with regular constraints. Zbl 1499.68166
Amarilli, Antoine; Paperman, Charles
5
2018
Combined tractability of query evaluation via tree automata and cycluits. Zbl 1402.68039
Amarilli, Antoine; Bourhis, Pierre; Monet, Mikaël; Senellart, Pierre
5
2017
The dichotomy of evaluating homomorphism-closed queries on probabilistic graphs. Zbl 1547.68152
Amarilli, Antoine; Ceylan, İsmail İlkan
2
2022
Connecting knowledge compilation classes and width parameters. (Connecting knowledge compilation classes width parameters.) Zbl 1446.68149
Amarilli, Antoine; Capelli, Florent; Monet, Mikaël; Senellart, Pierre
2
2020
Connecting width and structure in knowledge compilation. Zbl 1489.68067
Amarilli, Antoine; Monet, Mikaël; Senellart, Pierre
1
2018
A dichotomy for homomorphism-closed queries on probabilistic graphs. Zbl 07650983
Amarilli, Antoine; Ceylan, İsmail İlkan
1
2020
Possible and certain answers for queries over order-incomplete data. Zbl 1515.68106
Amarilli, Antoine; Ba, Mouhamadou Lamine; Deutch, Daniel; Senellart, Pierre
1
2017
Enumerating regular languages with bounded delay. Zbl 07922877
Amarilli, Antoine; Monet, Mikaël
1
2023
Enumerating regular languages with bounded delay. Zbl 07922877
Amarilli, Antoine; Monet, Mikaël
1
2023
The dichotomy of evaluating homomorphism-closed queries on probabilistic graphs. Zbl 1547.68152
Amarilli, Antoine; Ceylan, İsmail İlkan
2
2022
Connecting knowledge compilation classes and width parameters. (Connecting knowledge compilation classes width parameters.) Zbl 1446.68149
Amarilli, Antoine; Capelli, Florent; Monet, Mikaël; Senellart, Pierre
2
2020
A dichotomy for homomorphism-closed queries on probabilistic graphs. Zbl 07650983
Amarilli, Antoine; Ceylan, İsmail İlkan
1
2020
Constant-delay enumeration for nondeterministic document spanners. Zbl 07561482
Amarilli, Antoine; Bourhis, Pierre; Mengel, Stefan; Niewerth, Matthias
6
2019
Enumeration on trees under relabelings. Zbl 1489.68054
Amarilli, Antoine; Bourhis, Pierre; Mengel, Stefan
5
2018
Topological sorting with regular constraints. Zbl 1499.68166
Amarilli, Antoine; Paperman, Charles
5
2018
Connecting width and structure in knowledge compilation. Zbl 1489.68067
Amarilli, Antoine; Monet, Mikaël; Senellart, Pierre
1
2018
A circuit-based approach to efficient enumeration. Zbl 1442.68052
Amarilli, Antoine; Bourhis, Pierre; Jachiet, Louis; Mengel, Stefan
9
2017
Combined tractability of query evaluation via tree automata and cycluits. Zbl 1402.68039
Amarilli, Antoine; Bourhis, Pierre; Monet, Mikaël; Senellart, Pierre
5
2017
Possible and certain answers for queries over order-incomplete data. Zbl 1515.68106
Amarilli, Antoine; Ba, Mouhamadou Lamine; Deutch, Daniel; Senellart, Pierre
1
2017
Provenance circuits for trees and treelike instances. Zbl 1440.68053
Amarilli, Antoine; Bourhis, Pierre; Senellart, Pierre
8
2015

Citations by Year