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

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

F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta Informatica, pp. 269–296, 1983.

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

F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing Letters, pp. 1–2, 1983.

F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional knapsack problem,” in Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83, 1983.

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

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

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

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

P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.

F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Automata, Languages and Programming. ICALP 1979, pp. 411–421, 1979.