A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Jg. 13.1981, S. 315-322
Efficiency of universal parallel computers
In: Acta Informatica, Jg. 19.1983, S. 269-296Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-747Das Heinz-Nixdorf-Institut der Universität-GH Paderborn
In: Informatik-Spektrum, Jg. 1990, S. 231-232Infinite cube-connected cycles
In: Information Processing Letters, Jg. 1983, S. 1-2Lower bounds for solving linear diophantine equations on random access machines
In: Journal of the Association for Computing Machinery, Jg. 1985, S. 929-937Lower time bounds for solving linear diophantine equations on several parallel computational models
In: Information and Control, Jg. 1985, S. 195-211A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Jg. 1984, S. 668-676Simulating probabilistic by deterministic algebraic computation trees
In: Theoretical Computer Science, Jg. 1985, S. 325-330