Meyer auf der Heide, F., Oesterdiekhoff, B., &; Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56939-1_89 

Lürwer-Brüggemeier, K., &; Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56503-5_46 

Alt, H., &; Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In Data structures and efficient algorithms (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-55488-2_19 

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg.https://doi.org/10.1007/3-540-55488-2_31 

Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56731-3_3 

Meyer auf der Heide, F., &; Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg.https://doi.org/10.1007/3-540-55210-3_176 

Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In STACS 89. Berlin, Heidelberg.https://doi.org/10.1007/bfb0028983 

Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., &; Wigderson, A. (1988). On computations with integer division. In STACS 88. Berlin, Heidelberg.https://doi.org/10.1007/bfb0035829 

Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., &; Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In SWAT 88. Berlin, Heidelberg.https://doi.org/10.1007/3-540-19487-8_24 

Büning, H. K., &; Lettmann, T. (1987). Representation independent query and update operations on propositional definite Horn formulas. In E. Börger (Ed.), Computation Theory and Logic (pp. 208–223). Berlin, Heidelberg.https://doi.org/10.1007/3-540-18170-9_167 

Kleine Büning, H., &; Lettmann, T. (1986). Classes of first order formulas under various satisfiability definitions. In 8th International Conference on Automated Deduction. Berlin, Heidelberg.https://doi.org/10.1007/3-540-16780-3_119 

Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &; Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-16761-7_54 

Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In STACS 86. Berlin, Heidelberg.https://doi.org/10.1007/3-540-16078-7_72 

Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &; Wigderson, A. (1986). A time-space tradeoff for element distinctness. In STACS 86. Berlin, Heidelberg.https://doi.org/10.1007/3-540-16078-7_89 

Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg.https://doi.org/10.1007/3-540-12920-0_20 

Meyer auf der Heide, F., &; Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/3-540-10854-8_29 

Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-10856-4_111