K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.

H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.

M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in Data structures and efficient algorithms, Berlin, Heidelberg, 1992.

F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.

F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in STACS 92, Berlin, Heidelberg, 1992.

F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in STACS 89, Berlin, Heidelberg, 1989.

B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson, “On computations with integer division,” in STACS 88, Berlin, Heidelberg, 1988.

M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper and lower bounds for the dictionary problem,” in SWAT 88, Berlin, Heidelberg, 1988.

H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in Computation Theory and Logic, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.

H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.

A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in Automata, Languages and Programming, Berlin, Heidelberg, 1986.

F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in STACS 86, Berlin, Heidelberg, 1986.

A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in STACS 86, Berlin, Heidelberg, 1986.

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 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.