Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”https://doi.org/10.1007/bfb0024725__In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996.https://doi.org/10.1007/bfb0024725 .

Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. Automata, Languages and Programming, 23rd International Colloquium, ICAL. Berlin, Heidelberg, 1996.https://doi.org/10.1007/3-540-61440-0 .

Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.”https://doi.org/10.1007/3-540-60922-9_16__In STACS 96. Berlin, Heidelberg, 1996.https://doi.org/10.1007/3-540-60922-9_16 .

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.”https://doi.org/10.1007/3-540-59042-0_81__In STACS 95. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-59042-0_81 .

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.”https://doi.org/10.1007/3-540-60313-1_133__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_133 .

Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.”https://doi.org/10.1007/3-540-60618-1_77__In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60618-1_77 .

Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1007/3-540-60313-1_131__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_131 .

Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.https://doi.org/10.1007/3-540-56731-3 .

Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.”https://doi.org/10.1007/3-540-56939-1_89__In Automata, Languages and Programming. Berlin, Heidelberg, 1993.https://doi.org/10.1007/3-540-56939-1_89 .

Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.”https://doi.org/10.1007/3-540-56503-5_46__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993.https://doi.org/10.1007/3-540-56503-5_46 .

Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.”https://doi.org/10.1007/3-540-55488-2_19__In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992.https://doi.org/10.1007/3-540-55488-2_19 .

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.”https://doi.org/10.1007/3-540-55488-2_31__In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-55488-2_31 .

Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.”https://doi.org/10.1007/3-540-56731-3_3__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-56731-3_3 .

Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.”https://doi.org/10.1007/3-540-55210-3_176__In STACS 92. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-55210-3_176 .

Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.”https://doi.org/10.1007/bfb0028983__In STACS 89. Berlin, Heidelberg, 1989.https://doi.org/10.1007/bfb0028983 .

Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.”https://doi.org/10.1007/bfb0035829__In STACS 88. Berlin, Heidelberg, 1988.https://doi.org/10.1007/bfb0035829 .

Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.”https://doi.org/10.1007/3-540-19487-8_24__In SWAT 88. Berlin, Heidelberg, 1988.https://doi.org/10.1007/3-540-19487-8_24 .

Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.”https://doi.org/10.1007/3-540-18170-9_167__In Computation Theory and Logic, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987.https://doi.org/10.1007/3-540-18170-9_167 .

Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.”https://doi.org/10.1007/3-540-16780-3_119__In 8th International Conference on Automated Deduction. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16780-3_119 .

Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”https://doi.org/10.1007/3-540-16761-7_54__In Automata, Languages and Programming. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16761-7_54 .