Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.”10.1007/3-540-61863-5_33__Lecture Notes in Computer Science, 1996, doi:10.1007/3-540-61863-5_33.

Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”10.1007/bfb0024725__Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.

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

Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.”10.1007/3-540-60922-9_16__STACS 96, 1996, doi:10.1007/3-540-60922-9_16.

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

Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”10.1007/3-540-60313-1_133__Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.

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

Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”10.1007/3-540-60313-1_131__Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.

Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.

Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”10.1007/3-540-56939-1_89__Automata, Languages and Programming, 1993, doi: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.”10.1007/3-540-56503-5_46__Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.

Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.”10.1007/3-540-55488-2_19__Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, 1992, pp. 1–24, doi: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.”10.1007/3-540-55488-2_31__Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.

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

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

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

Just, Bettina, et al. “On Computations with Integer Division.”10.1007/bfb0035829__STACS 88, 1988, doi:10.1007/bfb0035829.

Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.”10.1007/3-540-19487-8_24__SWAT 88, 1988, doi: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.”10.1007/3-540-18170-9_167__Computation Theory and Logic, edited by Egon Börger, 1987, pp. 208–23, doi:10.1007/3-540-18170-9_167.

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

Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”10.1007/3-540-16761-7_54__Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.

Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.”10.1007/3-540-16078-7_72__STACS 86, 1986, doi:10.1007/3-540-16078-7_72.

Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.”10.1007/3-540-16078-7_89__STACS 86, 1986, doi:10.1007/3-540-16078-7_89.

Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).”10.1007/3-540-12920-0_20__STACS 84, 1984, doi:10.1007/3-540-12920-0_20.

Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.”10.1007/3-540-10854-8_29__Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.

Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.”10.1007/3-540-10856-4_111__Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.