No. Title Author Year
1 Weighted Counting of Matchings in Unbounded-Treewidth Graph Families Amarilli, Antoine et al. 2022
2 Dynamic Membership for Regular Languages Amarilli, Antoine et al. 2021
3 Uniform Reliability of Self-Join-Free Conjunctive Queries Amarilli, Antoine et al. 2021
4 A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs Amarilli, Antoine et al. 2020
5 Constant-Delay Enumeration for Nondeterministic Document Spanners Amarilli, Antoine et al. 2019
6 Connecting Width and Structure in Knowledge Compilation Amarilli, Antoine et al. 2018
7 Enumeration on Trees under Relabelings Amarilli, Antoine et al. 2018
8 Topological Sorting with Regular Constraints Amarilli, Antoine et al. 2018
9 A Circuit-Based Approach to Efficient Enumeration Amarilli, Antoine et al. 2017
10 Combined Tractability of Query Evaluation via Tree Automata and Cycluits Amarilli, Antoine et al. 2017
11 Possible and Certain Answers for Queries over Order-Incomplete Data Amarilli, Antoine et al. 2017
12 Top-k Querying of Unknown Values under Order Constraints Amarilli, Antoine et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI