Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Jg. 2.1974, S. 280-2932009
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-4212009The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Jg. 5, S. 300-3092009Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-1922009