| Publication | Date of Publication | Type |
|---|
| Robustness against Read committed for transaction templates with functional constraints | 2024-04-25 | Paper |
| Robustness against Read committed for transaction templates with functional constraints | 2024-04-23 | Paper |
Robustness against Read Committed for Transaction Templates with Functional Constraints
Logical Methods in Computer Science | 2024-01-16 | Paper |
Distribution Constraints: The Chase for Distributed Data
(available as arXiv preprint) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7561474 (Why is no real title available?) | 2022-07-21 | Paper |
Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Discovering XSD Keys from XML Data
ACM Transactions on Database Systems | 2021-11-25 | Paper |
| Satisfiability for SCULPT-schemas for CSV-like data | 2020-08-06 | Paper |
| Parallel-correctness and transferability for conjunctive queries under bag semantics | 2020-08-06 | Paper |
Parallel-correctness and containment for conjunctive queries with union and negation
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Finite-State Map-Reduce Computation and Relational Algebra Queries
ACM Transactions on Computational Logic | 2018-08-20 | Paper |
Parallel-correctness and transferability for conjunctive queries
Journal of the ACM | 2018-05-17 | Paper |
Optimal broadcasting strategies for conjunctive queries over distributed data
Theory of Computing Systems | 2017-09-20 | Paper |
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
(available as arXiv preprint) | 2017-07-14 | Paper |
Datalog queries distributing over components
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Typechecking XML views of relational databases
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
| Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data | 2017-06-13 | Paper |
| Datalog queries distributing over components | 2017-06-13 | Paper |
| Distributed streaming with finite memory | 2017-06-13 | Paper |
Deciding twig-definability of node selecting tree automata
Theory of Computing Systems | 2016-04-18 | Paper |
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM | 2015-10-30 | Paper |
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Relational transducers for declarative networking
Journal of the ACM | 2014-02-17 | Paper |
Simplifying XML schema: single-type approximations of regular tree languages
Journal of Computer and System Sciences | 2014-01-20 | Paper |
Generating, sampling and counting subclasses of regular tree languages
Theory of Computing Systems | 2013-08-23 | Paper |
| Succinctness of the complement and intersection of regular expressions | 2013-03-19 | Paper |
Optimizing the region algebra is PSPACE-complete
Information Processing Letters | 2012-03-19 | Paper |
Succinctness of pattern-based schema languages for XML
Journal of Computer and System Sciences | 2011-05-04 | Paper |
| Deterministic top-down tree automata: past, present, and future | 2011-03-30 | Paper |
Complexity of decision problems for XML schemas and chain regular expressions
SIAM Journal on Computing | 2010-09-06 | Paper |
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
SIAM Journal on Computing | 2009-11-06 | Paper |
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation | 2008-08-14 | Paper |
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
Logical Methods in Computer Science | 2007-10-11 | Paper |
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences | 2007-04-26 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science | 2005-06-10 | Paper |
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences | 2005-05-12 | Paper |
| scientific article; zbMATH DE number 2080402 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080403 (Why is no real title available?) | 2004-08-04 | Paper |
XML with data values: Typechecking revisited.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
On the power of tree-walking automata.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1953140 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1953124 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1950751 (Why is no real title available?) | 2003-07-20 | Paper |
| scientific article; zbMATH DE number 1948151 (Why is no real title available?) | 2003-07-10 | Paper |
A formal model for an expressive fragment of XSLT
Information Systems | 2003-02-02 | Paper |
Adding for-loops to first-order logic
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1834677 (Why is no real title available?) | 2002-11-25 | Paper |
Query automata over finite trees
Theoretical Computer Science | 2002-07-31 | Paper |
| scientific article; zbMATH DE number 1696859 (Why is no real title available?) | 2002-01-28 | Paper |
| scientific article; zbMATH DE number 1670851 (Why is no real title available?) | 2001-11-11 | Paper |
Typed query languages for databases containing queries
Information Systems | 2000-03-19 | Paper |
