| Publication | Date of Publication | Type |
|---|
Counting the solutions to a query (invited talk)
| 2024-04-25 | Paper |
A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
When is approximate counting for conjunctive queries tractable?
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards.
| 2023-02-07 | Paper |
The Complexity of Counting Problems Over Incomplete Databases
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
Journal of the ACM | 2022-12-08 | Paper |
Discovering XSD Keys from XML Data
ACM Transactions on Database Systems | 2021-11-25 | Paper |
The Exact Complexity of the First-Order Logic Definability Problem
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Descriptive complexity for counting complexity classes
| 2021-01-19 | Paper |
Descriptive complexity for counting complexity classes
| 2020-02-17 | Paper |
Knowledge base exchange: the case of OWL 2 QL
Artificial Intelligence | 2016-09-07 | Paper |
The language of plain SO-tgds: composition, inversion and structural properties
Journal of Computer and System Sciences | 2014-01-20 | Paper |
Solutions and query rewriting in data exchange
Information and Computation | 2013-12-19 | Paper |
Composition with target constraints
Logical Methods in Computer Science | 2012-04-02 | Paper |
Regular languages of nested words: fixed points, automata, and synchronization
Theory of Computing Systems | 2011-11-30 | Paper |
Query languages for data exchange: beyond unions of conjunctive queries
Theory of Computing Systems | 2011-10-11 | Paper |
Relational and XML Data Exchange
Synthesis Lectures on Data Management | 2010-11-19 | Paper |
On the Complexity of Verifying Consistency of XML Specifications
SIAM Journal on Computing | 2009-06-22 | Paper |
First-Order and Temporal Logics for Nested Words
Logical Methods in Computer Science | 2009-04-29 | Paper |
XML data exchange
Journal of the ACM | 2008-12-21 | Paper |
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM | 2008-12-21 | Paper |
Game-based notions of locality over finite models
Annals of Pure and Applied Logic | 2008-03-28 | Paper |
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Automata, Languages and Programming | 2007-11-28 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Inconsistency Tolerance
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2080463 (Why is no real title available?)
| 2004-08-04 | Paper |
Scalar aggregation in inconsistent databases.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1945841 (Why is no real title available?)
| 2003-07-03 | Paper |
scientific article; zbMATH DE number 1696845 (Why is no real title available?)
| 2002-01-28 | Paper |
