default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Indermark
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[e2]Helen Bolke-Hermanns, Joost-Pieter Katoen, Klaus Indermark, Stefan Kowalewski, Thomas Noll, Wolfgang Thomas:
50 Jahre Studiengang Informatik an der RWTH. RWTH Aachen, Fachgruppe Informatik in der Fakultät für Mathematik, Informatik und Naturwissenschaften, Germany 2022
2000 – 2009
- 2006
- [j5]Klaus Indermark, Thomas Noll
:
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information. Acta Informatica 43(1): 1-43 (2006)
1990 – 1999
- 1999
- [p2]Klaus Indermark:
Walter Oberschelp Lehrstuhl für angewandte Mathematik, insbesondere Informatik. Angewandte Mathematik, insbesondere Informatik 1999: 1-4 - [p1]Klaus Indermark:
Semantik rekursiver Funktionsdefinitionen mit Striktheitsinformation. Angewandte Mathematik, insbesondere Informatik 1999: 118-143
1980 – 1989
- 1989
- [c12]Rita Loogen, Herbert Kuchen, Klaus Indermark, Werner Damm:
Distributed Implementation of Programmed Graph Reduction. PARLE (1) 1989: 136-157 - 1987
- [j4]Klaus Indermark, Herbert Klaeren:
Compiling Fibonacci-Like Recursion. ACM SIGPLAN Notices 22(6): 101-108 (1987) - [c11]Herbert Klaeren, Klaus Indermark:
Efficient Implementation of an Algebraic Specification Language. Algebraic Methods 1987: 69-90 - [c10]Klaus Indermark, Herbert Klaeren:
Efficient Implementation of Structural Recursion. FCT 1987: 204-213 - 1984
- [j3]Klaus Indermark:
Reduction Semantics for Rational Schemes. RAIRO Theor. Informatics Appl. 18(3): 209-223 (1984) - 1983
- [c9]Klaus Indermark:
Complexity of Infinite Trees. ICALP 1983: 347-360 - 1982
- [j2]Klaus Indermark:
On Rational Definitions in Complete Algebras without Rank. Theor. Comput. Sci. 21: 281-313 (1982)
1970 – 1979
- 1977
- [c8]Werner Damm, Elfriede Fehr, Klaus Indermark:
Higher Type Recursion and Self-Application as Control Structures. Formal Description of Programming Concepts 1977: 461-490 - 1976
- [c7]Klaus Indermark:
Schemes with Recursion on Higher Types. MFCS 1976: 352-358 - 1975
- [j1]Friedrich W. von Henke, G. Rose, Klaus Indermark, Klaus Weihrauch:
On primitive recursive wordfunctions. Computing 15(3): 217-234 (1975) - [c6]Klaus Indermark:
Control structures and monadic languages. Automata Theory and Formal Languages 1975: 289-292 - [c5]Klaus Indermark:
The Continuous Algebra of Monadic Languages. MFCS 1975: 266-270 - 1973
- [c4]Klaus Indermark:
On lanov schemas with one memory location. Automatentheorie und Formale Sprachen 1973: 284-293 - [c3]Klaus Indermark:
On Ianov Schemas with One Memory Location. MFCS 1973: 239-245 - [e1]Karl-Heinz Böhling, Klaus Indermark:
1. Fachtagung über Automatentheorie und Formale Sprachen, Bonn, 9.-12. Juli 1973, Gesellschaft für Informatik (GI). Lecture Notes in Computer Science 2, Springer 1973, ISBN 3-540-06527-X [contents] - 1972
- [c2]Klaus Indermark:
Programmschemata mit Booleschen Unterprogrammen. GI Jahrestagung 1972: 107-115 - [c1]Friedrich W. von Henke, Klaus Indermark, Klaus Weihrauch:
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata. ICALP 1972: 549-561
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-05-02 21:46 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:
