Frederik Harwath
E-Mail: frederik@harwath.name

Please consider using e-mail encryption when contacting me. My OpenPGP public key:
BEBD 6B17 A7CC 56DF A441 3DB1 68A2 F595 C917 6F7C

I am a computer scientist. My current work as a software developer is related to database systems development and, in particular, to query language implementation.

My doctoral thesis was concerned with finite and algorithmic model theory, a branch of logic in computer science with close connections to topics such as database theory, computational complexity, and graph theory.

This is a selected list of my scientific publications. See also DBLP.

Conference and Journal Papers

Property Testing for Bounded Degree Databases
with I. Adler , STACS 2018
(DOI)

Succinctness of Order-Invariant Logics on Depth-Bounded Structures
with K. Eickmeyer , M. Elberfeld , ACM Transactions on Computational Logic 18(4), 2017
(DOI)

On the locality of arb-invariant first-order formulas with modulo counting quantifiers
with N. Schweikardt, Logical Methods in Computer Science 12(4), 2016
(DOI)

Order-Invariance of Two-Variable Logic is Decidable
with T. Zeume , Proceedings of LICS 2016
(DOI)

A note on the size of prenex normal forms
Information Processing Letters 116(7), 2016
(PDF|DOI)

Preservation and decomposition theorems for bounded degree structures
with L. Heimberg , N. Schweikardt, Logical Methods in Computer Science 11(4), 2015
(DOI)

Preservation and decomposition theorems for bounded degree structures
with L. Heimberg , N. Schweikardt, Proceedings of CSL-LICS, 2014
(PDF|DOI)

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
with K. Eickmeyer , M. Elberfeld , Proceedings of MFCS, 2014
(PDF|DOI)

On the locality of arb-invariant first-order logic with modulo counting quantifiers
with N. Schweikardt, Proceedings of CSL, 2013
(PDF|DOI)

Regular tree languages, cardinality predicates, and addition-invariant FO
with N. Schweikardt, Proceedings of STACS, 2012
(DOI)