Nicole Schweikardt

Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

2013

Expressiveness and static analysis of extended conjunctive regular path queries.

[BibT_eX]

[DOI]

Dominik D. Freydenberger

J. Comput. Syst. Sci., 2013

A note on monadic datalog on unranked trees.

[BibT_eX]

[DOI]

André Frochaux

CoRR, 2013

An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree.

[BibT_eX]

[DOI]

Lucas Heimberg

Dietrich Kuske

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

A Short Tutorial on Order-Invariant First-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2013

On the locality of arb-invariant first-order logic with modulo counting quantifiers.

[BibT_eX]

[DOI]

Frederik Harwath

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information and Computation, 2012

Regular tree languages, cardinality predicates, and addition-invariant FO.

[BibT_eX]

[DOI]

Frederik Harwath

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

A Toolkit for Proving Limitations of the Expressive Power of Logics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Closed world data exchange.

[BibT_eX]

[DOI]

Leonid Libkin

ACM Trans. Database Syst., 2011

Report on DEIS'10: advanced school on data exchange, information, and streams (A GI-Dagstuhl Seminar).

[BibT_eX]

[DOI]

Phokion G. Kolaitis

Maurizio Lenzerini

SIGMOD Rec., 2011

Locality from Circuit Lower Bounds.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

A note on the expressive power of linear orders

[BibT_eX]

[DOI]

Thomas Schwentick

Log. Methods Comput. Sci., 2011

Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Logik und Automaten: ein echtes Dreamteam.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Addition-Invariant FO and Regularity.

[BibT_eX]

[DOI]

Luc Segoufin

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

10501 Executive Summary - Advances and Applications of Automata on Words and Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances and Applications of Automata on Words and Trees, 12.12., 2010

2009

One-Pass Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Ehrenfeucht-Fraïssé Games.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Zero-One Laws.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Machine models for query processing.

[BibT_eX]

[DOI]

SIGMOD Rec., 2009

Database Query Processing Using Finite Cursor Machines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Lower bounds for processing data with few random accesses to external memory.

[BibT_eX]

[DOI]

J. ACM, 2009

Lower Bounds for Multi-Pass Processing of Multiple Data Streams.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

Reversal complexity revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Logic and Data Exchange: Which Solutions Are "Good" Solutions?

[BibT_eX]

[DOI]

Proceedings of the Logic and the Foundations of Game and Decision Theory, 2008

Expressive power of monadic logics on words, trees, pictures, and graphs.

[BibT_eX]

Oliver Matz

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Tight lower bounds for query processing on streaming and external memory data.

[BibT_eX]

[DOI]

Christoph Koch

Theor. Comput. Sci., 2007

An Ehrenfeucht-Fraïssé game approach to collapse results in database theory.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Machine models and lower bounds for query processing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

CWA-solutions for data exchange settings with target dependencies.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Boundedness of Monadic FO over Acyclic Structures.

[BibT_eX]

[DOI]

Stephan Kreutzer

Martin Otto

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Model Theory Makes Formulas Large.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

On the expressive power of monadic least fixed point logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Randomized computations on large data sets: tight lower bounds.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Approximation Schemes for First-Order Definable Optimisation Problems.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005

Arithmetic, first-order logic, and counting quantifiers.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2005

The succinctness of first-order logic on linear orders.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2005

First-order expressibility of languages with neutral letters or: The Crane Beach conjecture.

[BibT_eX]

[DOI]

David A. Mix Barrington

J. Comput. Syst. Sci., 2005

Lower bounds for sorting with few random accesses to external memory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

The Expressive Power of Two-Variable Least Fixed-Point Logics.

[BibT_eX]

[DOI]

Stephan Kreutzer

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

The Complexity of Querying External Memory and Streaming Data.

[BibT_eX]

[DOI]

Christoph Koch

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Comparing the succinctness of monadic query languages over finite trees.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

Logik und Informatik.

[BibT_eX]

[DOI]

Stephan Kreutzer

it Inf. Technol., 2004

FluXQuery: An Optimizing XQuery Processor for Streaming XML Data.

[BibT_eX]

[DOI]

Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams.

[BibT_eX]

[DOI]

Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

2002

The Monadic Quantifier Alternation Hierarchy over Grids and Graphs.

[BibT_eX]

[DOI]

Oliver Matz

Wolfgang Thomas

Inf. Comput., 2002

Die Ausdrucksstärke der Logik erster Stufe mit eingebauten Prädikaten.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2002, 2002

2001

An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases.

[BibT_eX]

[DOI]

Clemens Lautemann

Proceedings of the STACS 2001, 2001

The Crane Beach Conjecture.

[BibT_eX]

[DOI]

David A. Mix Barrington

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

The Natural Order-Generic Collapse for omega-Representable Databases over the Rational and the Real Ordered Group.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

On the expressive power of first-order logic with built-in predicates.

[BibT_eX]

Universität Mainz, ISBN: 978-3-8325-0017-7, 2001

1999

A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.

[BibT_eX]

[DOI]

Clemens Lautemann

Thomas Schwentick

Proceedings of the STACS 99, 1999

1997

The Monadic Quantifier Alternation Hierarchy over Grids and Pictures.

[BibT_eX]

[DOI]