default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Kartzow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j7]Martin Huschenbett, Alexander Kartzow, Philipp Schlicht
:
Pumping for ordinal-automatic structures. Comput. 6(2): 125-164 (2017)- [j6]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL∗ with Local Tree Constraints. Theory Comput. Syst. 61(2): 689-720 (2017) - 2016
- [j5]Alexander Kartzow:
The Field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic. J. Autom. Lang. Comb. 20(1): 27-43 (2016) - [j4]Claudia Carapelle, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL⁎ with constraints. J. Comput. Syst. Sci. 82(5): 826-855 (2016) - 2015
- [c10]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with Tree Constraints. CSR 2015: 94-108 - [i9]Alexander Kartzow, Thomas Weidner:
Model Checking Constraint LTL over Trees. CoRR abs/1504.06105 (2015) - 2014
- [i8]Alexander Kartzow:
The field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic. CoRR abs/1410.5197 (2014) - [i7]Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with tree constraints. CoRR abs/1412.2905 (2014) - 2013
- [j3]Alexander Kartzow:
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. Log. Methods Comput. Sci. 9(1) (2013) - [j2]Martin Huschenbett, Alexander Kartzow, Jiamou Liu, Markus Lohrey:
Tree-Automatic Well-Founded Trees. Log. Methods Comput. Sci. 9(2) (2013) - [j1]Alexander Kartzow:
First-Order Logic on Higher-Order Nested Pushdown Trees. ACM Trans. Comput. Log. 14(2): 8:1-8:45 (2013) - [c9]Alexander Kartzow, Philipp Schlicht:
Structures without Scattered-Automatic Presentation. CiE 2013: 273-283 - [c8]Claudia Carapelle, Alexander Kartzow, Markus Lohrey:
Satisfiability of CTL* with Constraints. CONCUR 2013: 455-469 - [c7]Alexander Heußner, Alexander Kartzow:
Reachability in Higher-Order-Counters. MFCS 2013: 528-539 - [i6]Alexander Kartzow, Philipp Schlicht:
Structures Without Scattered-Automatic Presentation. CoRR abs/1304.0912 (2013) - [i5]Claudia Carapelle, Alexander Kartzow, Markus Lohrey:
Satisfiability of CTL* with constraints. CoRR abs/1306.0814 (2013) - [i4]Alexander Heußner, Alexander Kartzow:
Reachability in Higher-Order-Counters. CoRR abs/1306.1069 (2013) - 2012
- [c6]Alexander Kartzow, Jiamou Liu, Markus Lohrey:
Tree-Automatic Well-Founded Trees. CiE 2012: 363-373 - [c5]Alexander Kartzow:
First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time. FoSSaCS 2012: 376-390 - [c4]Alexander Kartzow, Pawel Parys:
Strictness of the Collapsible Pushdown Hierarchy. MFCS 2012: 566-577 - [i3]Alexander Kartzow, Pawel Parys:
Strictness of the Collapsible Pushdown Hierarchy. CoRR abs/1201.3250 (2012) - [i2]Alexander Kartzow:
First-Order Model Checking on Generalisations of Pushdown Graphs. CoRR abs/1202.0137 (2012) - [i1]Alexander Kartzow:
First-Order Logic on Higher-Order Nested Pushdown Trees. CoRR abs/1202.1980 (2012) - 2011
- [c3]Alexander Kartzow:
A Pumping Lemma for Collapsible Pushdown Graphs of Level 2. CSL 2011: 322-336 - 2010
- [c2]Alexander Kartzow:
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic. STACS 2010: 501-512
2000 – 2009
- 2009
- [c1]Alexander Kartzow:
FO Model Checking on Nested Pushdown Trees. MFCS 2009: 451-463
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
