Frederik Harwath

According to our database1, Frederik Harwath authored at least 11 papers between 2009 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
On Invariant Formulae of First-Order Logic with Numerical Predicates
PhD thesis, 2018

Property Testing for Bounded Degree Databases.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017
Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
ACM Trans. Comput. Log., 2017

2016
A note on the size of prenex normal forms.
Inf. Process. Lett., 2016

On the locality of arb-invariant first-order formulas with modulo counting quantifiers.
Log. Methods Comput. Sci., 2016

Order-Invariance of Two-Variable Logic is Decidable.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Preservation and decomposition theorems for bounded degree structures.
Log. Methods Comput. Sci., 2015

2014
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
On the locality of arb-invariant first-order logic with modulo counting quantifiers.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Regular tree languages, cardinality predicates, and addition-invariant FO.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2009
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi.
Proceedings of the 39. Jahrestagung der Gesellschaft für Informatik, Im Focus das Leben, INFORMATIK 2009, Lübeck, Germany, September 28, 2009


  Loading...