On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication
F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984.

Efficient simulations among several models of parallel computers (extended abstract)
F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.

Efficiency of universal parallel computers
F. Meyer auf der Heide, Acta Informatica (1983) 269–296.

A lower time bound for the knapsack problem on random access machines
P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.

Infinite cube-connected cycles
F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.

A polynomial linear search algorithm for the n-dimensional knapsack problem
F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983.

Efficiency of universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.

Random access machines and straight-line programs
F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.

Time-processor trade-offs for universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.

A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.