default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominik D. Freydenberger
Person information
- affiliation: Loughborough University, UK
- affiliation (former): Bayreuth University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Sam M. Thompson
, Dominik D. Freydenberger:
Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC. Proc. ACM Manag. Data 2(2): 80 (2024)- 2023
- [c19]Sam M. Thompson, Dominik D. Freydenberger:
Languages Generated by Conjunctive Query Fragments of FC[REG]. DLT 2023: 233-245 - [i8]Sam M. Thompson, Dominik D. Freydenberger:
Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC. CoRR abs/2306.16364 (2023) - 2022
- [c18]Dominik D. Freydenberger, Sam M. Thompson:
Splitting Spanner Atoms: A Tool for Acyclic Core Spanners. ICDT 2022: 10:1-10:18 - 2021
- [c17]Dominik D. Freydenberger, Liat Peterfreund:
The Theory of Concatenation over Finite Models. ICALP 2021: 130:1-130:17 - [i7]Dominik D. Freydenberger, Sam M. Thompson:
Splitting Spanner Atoms: A Tool for Acyclic Core Spanners. CoRR abs/2104.04758 (2021) - 2020
- [c16]Dominik D. Freydenberger, Sam M. Thompson:
Dynamic Complexity of Document Spanners. ICDT 2020: 11:1-11:21
2010 – 2019
- 2019
- [j13]Dominik D. Freydenberger, Markus L. Schmid:
Deterministic regular expressions with back-references. J. Comput. Syst. Sci. 105: 1-39 (2019) - [j12]Dominik D. Freydenberger:
A Logic for Document Spanners. Theory Comput. Syst. 63(7): 1679-1754 (2019) - [c15]Liat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld, Markus Kröll:
Complexity Bounds for Relational Algebra over Document Spanners. PODS 2019: 320-334 - [i6]Liat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld, Markus Kröll:
Complexity Bounds for Relational Algebra over Document Spanners. CoRR abs/1901.04182 (2019) - [i5]Dominik D. Freydenberger, Sam M. Thompson:
Dynamic Complexity of Document Spanners. CoRR abs/1909.10869 (2019) - [i4]Dominik D. Freydenberger, Liat Peterfreund:
Finite models and the theory of concatenation. CoRR abs/1912.06110 (2019) - 2018
- [j11]Dominik D. Freydenberger, Mario Holldack:
Document Spanners: From Expressive Power to Decision Problems. Theory Comput. Syst. 62(4): 854-898 (2018) - [c14]Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund:
Joining Extractions of Regular Expressions. PODS 2018: 137-149 - [i3]Dominik D. Freydenberger, Markus L. Schmid:
Deterministic Regular Expressions With Back-References. CoRR abs/1802.01508 (2018) - 2017
- [c13]Dominik D. Freydenberger:
A Logic for Document Spanners. ICDT 2017: 13:1-13:18 - [c12]Dominik D. Freydenberger, Markus L. Schmid:
Deterministic Regular Expressions with Back-References. STACS 2017: 33:1-33:14 - [i2]Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund:
Joining Extractions of Regular Expressions. CoRR abs/1703.10350 (2017) - 2016
- [c11]Dominik D. Freydenberger, Mario Holldack:
Document Spanners: From Expressive Power to Decision Problems. ICDT 2016: 17:1-17:17 - 2015
- [j10]Dominik D. Freydenberger, Timo Kötzing:
Fast Learning of Restricted Regular Expressions and DTDs. Theory Comput. Syst. 57(4): 1114-1158 (2015) - [i1]Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter:
Testing k-binomial equivalence. CoRR abs/1509.00622 (2015) - 2013
- [j9]Dominik D. Freydenberger, Daniel Reidenbach:
Inferring descriptive generalisations of formal languages. J. Comput. Syst. Sci. 79(5): 622-639 (2013) - [j8]Dominik D. Freydenberger, Nicole Schweikardt:
Expressiveness and static analysis of extended conjunctive regular path queries. J. Comput. Syst. Sci. 79(6): 892-909 (2013) - [j7]Dominik D. Freydenberger:
Extended Regular Expressions: Succinctness and Decidability. Theory Comput. Syst. 53(2): 159-193 (2013) - [c10]Dominik D. Freydenberger, Timo Kötzing:
Fast learning of restricted regular expressions and DTDs. ICDT 2013: 45-56 - 2012
- [j6]Joachim Bremer, Dominik D. Freydenberger:
Inclusion problems for patterns with a bounded number of variables. Inf. Comput. 220: 15-43 (2012) - [j5]Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach:
Weakly unambiguous morphisms. Theor. Comput. Sci. 448: 21-40 (2012) - 2011
- [b1]Dominik D. Freydenberger:
Inclusion of pattern languages and related problems. Goethe University Frankfurt am Main, Logos 2011, pp. 1-153 - [c9]Dominik D. Freydenberger, Nicole Schweikardt:
Expressiveness and Static Analysis of Extended Conjunctive Regular Path Queries. AMW 2011 - [c8]Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach:
Weakly Unambiguous Morphisms. STACS 2011: 213-224 - [c7]Dominik D. Freydenberger:
Extended Regular Expressions: Succinctness and Decidability. STACS 2011: 507-518 - [p1]Dominik D. Freydenberger:
Inclusion of Pattern Languages and Related Problems. Ausgezeichnete Informatikdissertationen 2011: 41-50 - 2010
- [j4]Dominik D. Freydenberger, Daniel Reidenbach:
Bad news on decision problems for patterns. Inf. Comput. 208(1): 83-96 (2010) - [j3]Dominik D. Freydenberger, Daniel Reidenbach:
Existence and nonexistence of descriptive patterns. Theor. Comput. Sci. 411(34-36): 3274-3286 (2010) - [c6]Dominik D. Freydenberger, Daniel Reidenbach:
Inferring Descriptive Generalisations of Formal Languages. COLT 2010: 194-206 - [c5]Joachim Bremer, Dominik D. Freydenberger:
Inclusion Problems for Patterns with a Bounded Number of Variables. Developments in Language Theory 2010: 100-111
2000 – 2009
- 2009
- [j2]Dominik D. Freydenberger, Daniel Reidenbach:
The unambiguity of segmented morphisms. Discret. Appl. Math. 157(14): 3055-3068 (2009) - [c4]Dominik D. Freydenberger, Daniel Reidenbach:
Existence and Nonexistence of Descriptive Patterns. Developments in Language Theory 2009: 228-239 - 2008
- [c3]Dominik D. Freydenberger, Daniel Reidenbach:
Bad News on Decision Problems for Patterns. Developments in Language Theory 2008: 327-338 - 2007
- [c2]Dominik D. Freydenberger, Daniel Reidenbach:
The Unambiguity of Segmented Morphisms. Developments in Language Theory 2007: 181-192 - 2006
- [j1]Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider:
Unambiguous Morphic Images of Strings. Int. J. Found. Comput. Sci. 17(3): 601-628 (2006) - 2005
- [c1]Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider:
Unambiguous Morphic Images of Strings. Developments in Language Theory 2005: 248-259
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-07-20 21:24 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:
