Alexander Kartzow


Formerly, I have been a computer scientist at TU Darmstadt, Universität Leipzig and Universität Siegen. I have been working in the field of automata theory.
From April 2015 I work as a project manager in a small software company.
This page contains a summary of my scientific work.
E-Mail:


My Publications in DBLP
Conference Papers:

Model Checking Constraint LTL over Trees [Preliminary PDF]
(joint work with Thomas Weidner)
submitted 2015

Satisfiability of ECTL with Tree Constraints [arXiv-Version]
(joint work with Claudia Carapelle, Shiguang Feng and Markus Lohrey)
CSR 2015, Listvyanka

Reachability in Higher-Order-Counters [arXiv-Version]
(joint work with Alexander Heu▀ner)
MFCS 2013, Klosterneuburg

Satisfiability of CTL* with constraints [arXiv-Version]
(joint work with Claudia Carapelle and Markus Lohrey)
Concur 2013, Buenos Aires

Structures without Scattered-Automatic Presentations [arXiv-Version]
(joint work with Philipp Schlicht)
CiE 2013, Milan

Strictness of the Collapsible Pushdown Hierarchy [PDF]
(joint work with Pawel Parys)
MFCS 2012, Bratislava

Tree-Automatic Well-Founded Trees [PDF]
(joint work with Jiamou Liu and Markus Lohrey)
CiE 2012, Cambridge

FO Model Checking on NPT is Complete for Doubly Exponential Alternating Time [PDF - preliminary version]
FoSSaCS 2012, Tallin

A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 [PDF- long version]
CSL 2011, Bergen

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic [PS- Preliminary version with appendix]
STACS 2010

FO Model Checking on Nested Pushdown Trees [PDF with Appendix]
MFCS 2009

Journal Papers:

A. Kartzow
The field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic [arxiv-version]
submitted 2014

M. Huschenbett, A. Kartzow, P. Schlicht
Pumping for Ordinal-Automatic Structures [pdf]
submitted 2014

C. Carapelle, A. Kartzow, M. Lohrey
Satisfiability of ECTL* with Constraints [pdf]
submitted 2014

M. Huschenbett, A. Kartzow, J. Liu, M. Lohrey
Tree-Automatic Well-Founded Trees [arXiv-Version]
Logical Methods in Computer Science 9(2), 2013

A. Kartzow, First-Order Logic on Higher-Order Nested Pushdown Trees [PDF]
ACM Transactions on Computational Logic Vol. 14 Number 2, 2013

A. Kartzow, Collapsible Pushdown Graphs of Level 2 are Tree-Automatic [PDF]
Logical Methods in Computer Science 9(1), 2013

PhD - Thesis:
A. Kartzow First-Order Model Checking on Generalisations of Pushdown Graphs, July 2011 [PDF]
Published at TUPrints

Talks:

Strictness of the Collapsible Pushdown Graph Hierarchy [PDF]
Talk at MFCS'12 in Bratislava

FO Model Checking on Generalisations of Pushdown Graphs [PDF]
Talk at AISS (satelite workshop of LICS'12) in Dubrovnik

Ranks of Tree-Automatic Well-Founded Order Trees [PDF]
Talk at CiE'12 in Cambridge

VardiA Lower Bound for FO Model Checking on Nested Pushdown Trees [PDF]
Talk at Workshop "Automata and Logic" in Dresden

A Lower Bound for FO Model Checking on Nested Pushdown Trees [PDF]
Talk at FoSSaCS'12 in Tallinn

Tree-Automatic Well-Founded Order Trees have Small Ranks [PDF]
Talk at AlMoth'12 in Ilmenau

A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 [PDF]
Talk at CSL'11 in Bergen

Collapsible Pushdown Graphs are Tree-Automatic [PDF]
Talk at the Workshop on Higher-Order Recursion Schemes and Pushdown Automata 2010 in Paris

FO Model Checking on Nested Pushdown Trees
and more: on Collapsible Pushdown Graphs
[PDF]
Talk at AAL'09 in Stuttgart

FO Model Checking on Nested Pushdown Trees [PDF]
Talk at AlMoTh'09 in Dortmund


image of me
Last updated: 01.03.2015