Klaus Indermark

According to our database1, Klaus Indermark
  • authored at least 16 papers between 1972 and 2006.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2006
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information.
Acta Inf., 2006

1989
Distributed Implementation of Programmed Graph Reduction.
Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

1987
Compiling Fibonacci-Like Recursion.
SIGPLAN Notices, 1987

Efficient Implementation of Structural Recursion.
Proceedings of the Fundamentals of Computation Theory, 1987

Efficient Implementation of an Algebraic Specification Language.
Proceedings of the Algebraic Methods: Theory, 1987

1984
Reduction Semantics for Rational Schemes.
ITA, 1984

1983
Complexity of Infinite Trees.
Proceedings of the Automata, 1983

1982
On Rational Definitions in Complete Algebras without Rank.
Theor. Comput. Sci., 1982

1976
Schemes with Recursion on Higher Types.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
On primitive recursive wordfunctions.
Computing, 1975

The Continuous Algebra of Monadic Languages.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

Control structures and monadic languages.
Proceedings of the Automata Theory and Formal Languages, 1975

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

On lanov schemas with one memory location.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

1972
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata.
ICALP, 1972

Programmschemata mit Booleschen Unterprogrammen.
Proceedings of the Gesellschaft für Informatik e.V., 1972


  Loading...