default search action
Christian Rauch 0001
Person information
- affiliation: Universität Giessen, Germany
Other persons with the same name
- Christian Rauch 0002
— Bosch Center for Artificial Intelligence, Stuttgart, Germany (and 1 more)
- Christian Rauch 0003 — German Federal Employment Agency, Nürnberg, Germany
- Christian Rauch 0004 — University of Bremen, Germany
- Christian Rauch 0005 — Vodafone Group Services GmbH, Germany
- Christian Rauch 0006 — Johannes Gutenberg University, Mainz, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Context-Free Languages is Undecidable. DLT 2024: 141-155 - [c12]Hermann Gruber, Markus Holzer, Christian Rauch:
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). CIAA 2024: 153-165 - 2023
- [j2]Markus Holzer
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case. Int. J. Found. Comput. Sci. 34(8): 987-1022 (2023) - [j1]Christian Rauch, Markus Holzer:
On the accepting state complexity of operations on permutation automata. RAIRO Theor. Informatics Appl. 57: 9 (2023) - [c11]Markus Holzer, Christian Rauch:
On Jaffe's Pumping Lemma, Revisited. DCFS 2023: 65-78 - [c10]Markus Holzer
Computational Complexity of Reversible Reaction Systems. RC 2023: 40-54 - [c9]Hermann Gruber
The Pumping Lemma for Regular Languages is Hard. CIAA 2023: 128-140 - [c8]Markus Holzer, Christian Rauch:
On Minimal Pumping Constants for Regular Languages. AFL 2023: 127-141 - 2022
- [c7]Markus Holzer
On the Descriptional Complexity of the Direct Product of Finite Automata. DCFS 2022: 100-111 - [c6]Hermann Gruber
On 25 Years of CIAA Through the Lens of Data Science. CIAA 2022: 3-18 - [c5]Christian Rauch, Markus Holzer
On the Accepting State Complexity of Operations on Permutation Automata. NCMA 2022: 177-189 - 2021
- [c4]Markus Holzer
On the Computational Complexity of Reaction Systems, Revisited. CSR 2021: 170-185 - [c3]Markus Holzer
More on the Descriptional Complexity of Products of Finite Automata. DCFS 2021: 76-87 - [c2]Markus Holzer
The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract). DLT 2021: 229-241 - [c1]Markus Holzer
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract). CIAA 2021: 90-101
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-09-13 00:44 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: