On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication - Meyer auf der Heide, Friedhelm; Reischuk, R. (25th Annual Symposium onFoundations of Computer Science, 1984.)

Efficient simulations among several models of parallel computers (extended abstract) - Meyer auf der Heide, Friedhelm (STACS 84)

Efficiency of universal parallel computers - Meyer auf der Heide, Friedhelm (Acta Informatica)

A lower time bound for the knapsack problem on random access machines - Klein, Peter; Meyer auf der Heide, Friedhelm (Acta Informatica)

Infinite cube-connected cycles - Meyer auf der Heide, Friedhelm (Information Processing Letters)

A polynomial linear search algorithm for the n-dimensional knapsack problem - Meyer auf der Heide, Friedhelm (Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83)

Efficiency of universal parallel computers - Meyer auf der Heide, Friedhelm (Lecture Notes in Computer Science)

Random access machines and straight-line programs - Meyer auf der Heide, Friedhelm; Rollik, Anton (Fundamentals of Computation Theory)

Time-processor trade-offs for universal parallel computers - Meyer auf der Heide, Friedhelm (Lecture Notes in Computer Science)

A comparison of two variations of a pebble game on graphs - Meyer auf der Heide, Friedhelm (Theoretical Computer Science)

Untere Zeitschranken für das Rucksack-Problem - Klein, P.; Meyer auf der Heide, Friedhelm (GI - 10. Jahrestagung)

A comparison of two variations of a pebble game on graphs - Meyer auf der Heide, Friedhelm (Automata, Languages and Programming. ICALP 1979)