| Publication | Date of Publication | Type |
|---|
Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation
| 2024-12-03 | Paper |
Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints
| 2024-04-25 | Paper |
Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints
| 2024-04-23 | Paper |
Enumeration for FO Queries over Nowhere Dense Graphs
Journal of the ACM | 2023-04-27 | Paper |
Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
| 2022-07-21 | Paper |
Answering FO+MOD queries under updates on bounded degree databases
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Gaifman normal forms for counting extensions of first-order logic
| 2021-07-28 | Paper |
First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
| 2021-01-19 | Paper |
Answering UCQs under updates and in the presence of integrity constraints
| 2020-08-06 | Paper |
Finite-State Map-Reduce Computation and Relational Algebra Queries
ACM Transactions on Computational Logic | 2018-08-20 | Paper |
Answering FO+MOD queries under updates on bounded degree databases
| 2018-07-18 | Paper |
Preservation and decomposition theorems for bounded degree structures
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
On Hanf-equivalence and the number of embeddings of small induced subgraphs
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Hanf normal form for first-order logic with unary counting quantifiers
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Arithmetic, first-order logic, and counting quantifiers
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Distributed streaming with finite memory
| 2017-06-13 | Paper |
On the locality of arb-invariant first-order formulas with modulo counting quantifiers
Logical Methods in Computer Science | 2017-04-11 | Paper |
scientific article; zbMATH DE number 6680147 (Why is no real title available?)
| 2017-02-02 | Paper |
\(+\omega\)-picture languages recognizable by Büchi-tiling systems
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Preservation and decomposition theorems for bounded degree structures
Logical Methods in Computer Science | 2016-01-07 | Paper |
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM | 2015-11-11 | Paper |
Expressiveness and static analysis of extended conjunctive regular path queries
Journal of Computer and System Sciences | 2014-01-20 | Paper |
A short tutorial on order-invariant first-order logic
Computer Science – Theory and Applications | 2013-06-14 | Paper |
On the expressive power of logics with invariant uses of arithmetic predicates
Logic, Language, Information and Computation | 2012-09-21 | Paper |
Regular tree languages, cardinality predicates, and addition-invariant FO
| 2012-08-23 | Paper |
Lower bounds for multi-pass processing of multiple data streams
| 2012-04-24 | Paper |
A note on the expressive power of linear orders
Logical Methods in Computer Science | 2012-04-02 | Paper |
Expressive power of monadic logics on words, trees, pictures, and graphs
| 2011-03-30 | Paper |
Logic and data exchange: which solutions are ``good solutions?
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Database query processing using finite cursor machines
Theory of Computing Systems | 2009-08-06 | Paper |
Reversal complexity revisited
Theoretical Computer Science | 2008-07-31 | Paper |
Model Theory Makes Formulas Large
Automata, Languages and Programming | 2007-11-28 | Paper |
Boundedness of Monadic FO over Acyclic Structures
Automata, Languages and Programming | 2007-11-28 | Paper |
The succinctness of first-order logic on linear orders
Logical Methods in Computer Science | 2007-10-11 | Paper |
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science | 2007-07-16 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
Information and Computation | 2007-03-12 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation | 2006-10-10 | Paper |
On the expressive power of monadic least fixed point logic
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences | 2005-05-12 | Paper |
Comparing the succinctness of monadic query languages over finite trees
RAIRO - Theoretical Informatics and Applications | 2005-03-21 | Paper |
scientific article; zbMATH DE number 1848311 (Why is no real title available?)
| 2003-01-01 | Paper |
scientific article; zbMATH DE number 1688383 (Why is no real title available?)
| 2002-01-09 | Paper |
scientific article; zbMATH DE number 1304315 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1223636 (Why is no real title available?)
| 1998-11-15 | Paper |
