We stand with Ukraine  

Klaus Indermark

Affiliations:
  • RWTH Aachen University, Germany


According to our database1, Klaus Indermark authored at least 19 papers between 1972 and 2006.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2006
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information.
[BibTeX]
[DOI]
Klaus Indermark
,
Thomas Noll
Acta Informatica, 2006

1999
Semantik rekursiver Funktionsdefinitionen mit Striktheitsinformation.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the Angewandte Mathematik, 1999

Walter Oberschelp Lehrstuhl für angewandte Mathematik, insbesondere Informatik.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the Angewandte Mathematik, 1999

1989
Distributed Implementation of Programmed Graph Reduction.
[BibTeX]
[DOI]
Rita Loogen
,
Herbert Kuchen
,
Klaus Indermark
,
Werner Damm
Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

1987
Compiling Fibonacci-Like Recursion.
[BibTeX]
[DOI]
Klaus Indermark
,
Herbert Klaeren
ACM SIGPLAN Notices, 1987

Efficient Implementation of Structural Recursion.
[BibTeX]
[DOI]
Klaus Indermark
,
Herbert Klaeren
Proceedings of the Fundamentals of Computation Theory, 1987

Efficient Implementation of an Algebraic Specification Language.
[BibTeX]
[DOI]
Herbert Klaeren
,
Klaus Indermark
Proceedings of the Algebraic Methods: Theory, 1987

1984
Reduction Semantics for Rational Schemes.
[BibTeX]
[DOI]
Klaus Indermark
RAIRO Theor. Informatics Appl., 1984

1983
Complexity of Infinite Trees.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the Automata, 1983

1982
On Rational Definitions in Complete Algebras without Rank.
[BibTeX]
[DOI]
Klaus Indermark
Theor. Comput. Sci., 1982

1977
Higher Type Recursion and Self-Application as Control Structures.
[BibTeX]
Werner Damm
,
Elfriede Fehr
,
Klaus Indermark
Proceedings of the Formal Description of Programming Concepts: Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1977

1976
Schemes with Recursion on Higher Types.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
On primitive recursive wordfunctions.
[BibTeX]
[DOI]
Friedrich W. von Henke
,
G. Rose
,
Klaus Indermark
,
Klaus Weihrauch
Computing, 1975

The Continuous Algebra of Monadic Languages.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

Control structures and monadic languages.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the Automata Theory and Formal Languages, 1975

1973
On Ianov Schemas with One Memory Location.
[BibTeX]
Klaus Indermark
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

On lanov schemas with one memory location.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

1972
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata.
[BibTeX]
Friedrich W. von Henke
,
Klaus Indermark
,
Klaus Weihrauch
Proceedings of the Automata, 1972

Programmschemata mit Booleschen Unterprogrammen.
[BibTeX]
[DOI]
Klaus Indermark
Proceedings of the Gesellschaft für Informatik e.V., 1972


  Loading...