Alexander Kartzow

According to our database, Alexander Kartzow authored at least 18 papers between 2009 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

Satisfiability of ECTL∗ with Local Tree Constraints.

Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey

Theory Comput. Syst., 2017

Pumping for ordinal-automatic structures.

Martin Huschenbett, Alexander Kartzow, Philipp Schlicht

Comput., 2017

2016

Satisfiability of ECTL^⁎ with constraints.

Claudia Carapelle, Alexander Kartzow, Markus Lohrey

J. Comput. Syst. Sci., 2016

The Field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic.

Alexander Kartzow

J. Autom. Lang. Comb., 2016

2015

Model Checking Constraint LTL over Trees.

Alexander Kartzow, Thomas Weidner

CoRR, 2015

Satisfiability of ECTL* with Tree Constraints.

Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey

Proceedings of the Computer Science - Theory and Applications, 2015

2013

First-Order Logic on Higher-Order Nested Pushdown Trees.

Alexander Kartzow

ACM Trans. Comput. Log., 2013

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

Alexander Kartzow

Log. Methods Comput. Sci., 2013

Tree-Automatic Well-Founded Trees

Martin Huschenbett, Alexander Kartzow, Jiamou Liu, Markus Lohrey

Log. Methods Comput. Sci., 2013

Reachability in Higher-Order-Counters.

Alexander Heußner, Alexander Kartzow

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Satisfiability of CTL* with Constraints.

Claudia Carapelle, Alexander Kartzow, Markus Lohrey

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Structures without Scattered-Automatic Presentation.

Alexander Kartzow, Philipp Schlicht

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

First-Order Model Checking on Generalisations of Pushdown Graphs

Alexander Kartzow

CoRR, 2012

Strictness of the Collapsible Pushdown Hierarchy.

Alexander Kartzow, Pawel Parys

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time.

Alexander Kartzow

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Tree-Automatic Well-Founded Trees.

Alexander Kartzow, Jiamou Liu, Markus Lohrey

Proceedings of the How the World Computes, 2012

2011

A Pumping Lemma for Collapsible Pushdown Graphs of Level 2.

Alexander Kartzow

Proceedings of the Computer Science Logic, 2011

2009

FO Model Checking on Nested Pushdown Trees.

Alexander Kartzow

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009