| No. |
Title |
Author |
Year |
| 1 |
Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints |
Kleest-Meißner, Sarah et al. |
2022 |
| 2 |
A Purely Regular Approach to Non-Regular Core Spanners |
Schmid, Markus L. et al. |
2021 |
| 3 |
Learning Concepts Described By Weight Aggregation Logic |
van Bergerem, Steffen et al. |
2021 |
| 4 |
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width |
Berkholz, Christoph et al. |
2019 |
| 5 |
Enumeration in Data Management (Dagstuhl Seminar 19211) |
Boros, Endre et al. |
2019 |
| 6 |
Answering UCQs under Updates and in the Presence of Integrity Constraints |
Berkholz, Christoph et al. |
2018 |
| 7 |
Gaifman Normal Forms for Counting Extensions of First-Order Logic |
Kuske, Dietrich et al. |
2018 |
| 8 |
Answering FO+MOD Queries Under Updates on Bounded Degree Databases |
Berkholz, Christoph et al. |
2017 |
| 9 |
Distributed Streaming with Finite Memory |
Neven, Frank et al. |
2015 |
| 10 |
Using Locality for Efficient Query Evaluation in Various Computation Models (Invited Talk) |
Schweikardt, Nicole |
2015 |
| 11 |
DFU, Volume 5, Data Exchange, Integration, and Streams, Complete Volume |
Kolaitis, Phokion G. et al. |
2013 |
| 12 |
Frontmatter, Table of Contents, Preface |
Kolaitis, Phokion G. et al. |
2013 |
| 13 |
On the locality of arb-invariant first-order logic with modulo counting quantifiers |
Harwath, Frederik et al. |
2013 |
| 14 |
Regular tree languages, cardinality predicates, and addition-invariant FO |
Harwath, Frederik et al. |
2012 |
| 15 |
10501 Abstracts Collection -- Advances and Applications of Automata on Words and Trees |
Glasser, Christian et al. |
2011 |
| 16 |
10501 Executive Summary -- Advances and Applications of Automata on Words and Trees |
Glasser, Christian et al. |
2011 |
| 17 |
Lower Bounds for Multi-Pass Processing of Multiple Data Streams |
Schweikardt, Nicole |
2009 |
