Publication | Date of Publication | Type |
---|
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 | 2023-04-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q5092420 | 2022-07-21 | Paper |
Answering FO+MOD Queries under Updates on Bounded Degree Databases | 2021-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q5002820 | 2021-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5144680 | 2021-01-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q3305351 | 2020-08-06 | Paper |
Finite-State Map-Reduce Computation and Relational Algebra Queries | 2018-08-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q3174897 | 2018-07-18 | Paper |
Preservation and decomposition theorems for bounded degree structures | 2018-04-23 | Paper |
On Hanf-equivalence and the number of embeddings of small induced subgraphs | 2018-04-23 | Paper |
Hanf normal form for first-order logic with unary counting quantifiers | 2018-04-23 | Paper |
Arithmetic, first-order logic, and counting quantifiers | 2017-07-12 | Paper |
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree | 2017-07-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5738943 | 2017-06-13 | Paper |
On the locality of arb-invariant first-order formulas with modulo counting quantifiers | 2017-04-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q2958533 | 2017-02-02 | Paper |
$$+\omega $$ + ω -Picture Languages Recognizable by Büchi-Tiling Systems | 2016-04-13 | Paper |
Preservation and decomposition theorems for bounded degree structures | 2016-01-07 | Paper |
Lower bounds for processing data with few random accesses to external memory | 2015-11-11 | Paper |
Expressiveness and static analysis of extended conjunctive regular path queries | 2014-01-20 | Paper |
A Short Tutorial on Order-Invariant First-Order Logic | 2013-06-14 | Paper |
On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates | 2012-09-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q2904787 | 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 | 2012-04-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q3086932 | 2011-03-30 | Paper |
Logic and Data Exchange: Which Solutions Are “Good” Solutions? | 2010-08-31 | Paper |
Database query processing using finite cursor machines | 2009-08-06 | Paper |
Reversal complexity revisited | 2008-07-31 | Paper |
Boundedness of Monadic FO over Acyclic Structures | 2007-11-28 | Paper |
Model Theory Makes Formulas Large | 2007-11-28 | Paper |
The succinctness of first-order logic on linear orders | 2007-10-11 | Paper |
Tight lower bounds for query processing on streaming and external memory data | 2007-07-16 | Paper |
Computer Science Logic | 2007-06-21 | Paper |
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory | 2007-03-12 | Paper |
Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
Fundamentals of Computation Theory | 2006-10-20 | Paper |
The monadic quantifier alternation hierarchy over grids and graphs | 2006-10-10 | Paper |
On the expressive power of monadic least fixed point logic | 2006-03-20 | Paper |
Automata, Languages and Programming | 2006-01-10 | Paper |
Automata, Languages and Programming | 2005-08-24 | Paper |
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture | 2005-05-12 | Paper |
Comparing the succinctness of monadic query languages over finite trees | 2005-03-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4785505 | 2003-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q2762524 | 2002-01-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4251045 | 1999-06-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4218948 | 1998-11-15 | Paper |