Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Jg. 2.1974, S. 280-293
A comparison between two variations of a pebble game on graphs
In: Automata, languages and programming. 1973 : Graz, Austria, July 16 - 20, 1979 (Lecture notes in computer science : 71), Jg. 1979, S. 411-421Compilation for instruction parallel processors
In: Compiler compilers, Jg. 1990, S. 179-192The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Jg. 5, S. 300-309Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-192A concept for the editing of hardware resulting in an automatic hardware editor
In: 14th Design Automation Conference, New Orleans, Jg. 1977, S. 187-193The concurrent programming language CAP and the -processor oriented CAP CAD-system
In: Microprocessors and their applications / Symposium on Microprocessing and Microprogramming <5, 1979, Göteborg>, Jg. 1979, S. 249-258Convexity Properties of Graßmannians
In: Seminar Sophus Lie, Jg. 2.1992, S. 13-20Coupling of completely integrable systems
the perturbation bundleIn: Applications of analytic and geometric methods to nonlinear differential equations : [proceedings of the NATO Advanced Research Workshop on Applications of Analytic and Geometric Methods to Nonlinear Differential Equations, Exeter, U.K., July 14 - 19, 1992] (NATO ASI series : Series C, Computer and physical sciences : 413), Jg. 1993, S. 125-138