Capabilities and complexity of computations with integer division
K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

Resemblance and symmetries of geometric patterns
H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

High performance universal hashing, with applications to shared memory simulations
M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

Hashing strategies for simulating shared memory on distributed memory machines
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

On the performance of networks with multiple busses
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Computing minimum spanning forests on 1- and 2-dimensional processor arrays
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

On computations with integer division
B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.
LibreCat: /record/16767
DOI: 10.1007/bfb0035829

Upper and lower bounds for the dictionary problem
M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.
LibreCat: /record/16768
DOI: 10.1007/3-540-19487-8_24

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

Classes of first order formulas under various satisfiability definitions
H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat: /record/19819
DOI: 10.1007/3-540-16780-3_119

A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.
LibreCat: /record/16774
DOI: 10.1007/3-540-16761-7_54

Speeding up random access machines by few processors
F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat: /record/16775
DOI: 10.1007/3-540-16078-7_72

A time-space tradeoff for element distinctness
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat: /record/16776
DOI: 10.1007/3-540-16078-7_89

Efficient simulations among several models of parallel computers (extended abstract)
F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

Random access machines and straight-line programs
F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

Time-processor trade-offs for universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111