Ptashnyk, Stefaniya. “LEXIKON. Eintrag (Einzelartikel).” WSK Grammatik (online-Publikation).

Öhlschläger, Claudia. “Bild/Bilderverbot (literaturwissenschaftlich).” Lexikon der Bibelhermeneutik. Begriffe-Methoden. Theorien-Konzepte. Redaktion Susanne Luther, edited by Oda Wischmeyer, de Gruyter, pp. 98–99.

Öhlschläger, Claudia. “Ikonographie (Literaturwissenschaftlich).” Lexikon Der Bibelhermeneutik. Begriffe-Methoden. Theorien-Konzepte. Redaktion Susanne Luther, edited by Oda Wischmeyer, de Gruyter, pp. 281–82.

Steigerwald, Jörn. “Die Selbstverortung des Individuums zwischen Spätaufklärung und Romantik .” Räume des Subjekts um 1800, edited by Jörn Steigerwald and Rudolf Behrens, Harrassowitz.

Öhlschläger, Claudia, editor. Ethik-Text-Kultur. Fink.

Reschetnik, W., et al. “Beeinflussung Des Risswachstums Durch Kerben in Additiv Gefertigten Strukturen.” Additive Fertigung von Bauteilen Und Strukturen – Neue Erkenntnisse Und Praxisbeispiele.

Riemer, A., et al. Optimierung der Werkstoffperformance lasergeschmolzener metallischer Werkstoffe.

Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.”10.1007/3-540-09510-1_32 __Automata, Languages and Programming. ICALP 1979, 1979, pp. 411–21, doi:10.1007/3-540-09510-1_32 .

Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.”10.1007/978-3-642-67838-7_34__GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34.

Hagengruber, Ruth Edith, editor. Inseln im Ich. Matthes &; Seitz, 1980.

Engels, Gregor, et al. Handling Errors and Exceptions in the Algebraic Specifications of Data Types. University of Osnabrück, 1981.

Pletat, Udo, et al. Operational Semantics of Algebraic Specifications with Conditional Equations. University of Dortmund, Department of Computer Science, 1981.

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.

Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.”10.1016/s0304-3975(81)80004-7__Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7.

Böcker, Joachim. Ein Kreiskriterium für Mehrgrößensysteme und seine Anwendung auf mechanische Schwingungssysteme. Institut für Regelungstechnik, TU Berlin, 1981.

Engels, Gregor, and Wilhelm Schäfer. “Specification of a Programming Support Environment by Graph Grammars.” Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG), München (Germany), Hanser, 1982, pp. 47–62.

Pletat, Udo, et al. “An Operational Approach to Conditional Algebraic Specifications.” Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France), vol. 82, 1982, pp. 254–70.

Böcker, Joachim. Untersuchungen zur L_inf-Stabilität für eine Klasse nichtlinearer Regelungssysteme. Institut für Regelungstechnik, TU Berlin, 1982.

Nagl, Manfred, et al. “Software Specification by Graph Grammars.”dx.doi.org/10.1007/BFb0000113__Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany), vol. 153, Springer, 1983, pp. 267–87, doi:dx.doi.org/10.1007/BFb0000113.

Engels, Gregor, et al. “Software Specification Using Graph Grammars.”http://dx.doi.org/10.1007/BF02251236__Computing, vol. 31, no. 4, 1983, pp. 317–46, doi:http://dx.doi.org/10.1007/BF02251236.

Engels, Gregor, et al. “An Operational Semantics for Specifications of Abstract Data Types with Error Handling.”http://dx.doi.org/10.1007/BF00265557__Acta Informatica, vol. 9, no. 3, 1983, pp. 235–54, doi:http://dx.doi.org/10.1007/BF00265557.

Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”10.1007/bf00265559__Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.

Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.”10.1007/bf00290735__Acta Informatica, 1983, pp. 385–95, doi:10.1007/bf00290735.

Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.”10.1016/0020-0190(83)90001-7__Information Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7.

Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.”10.1145/800061.808734__Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983, doi:10.1145/800061.808734.

Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”10.1007/bfb0036483__Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483.

Domik, Gitta, et al. “Radar Image Simulation and Its Application in Image Analysis.” International Archives of Photogrammetry and Remote Sensing, vol. 25A, no. 3, 1984, pp. 99–108.

Domik, Gitta, et al. “Rectification of Radar Images Using Stereo- Derived Height Models and Simulations.” XVth Congress of the International Society for Photogrammetry and Remote Sensing, vol. 25A, no. 3, 1984, pp. 109–116.

Domik, Gitta. “Evaluation of Radar Stereo Viewability by Means of a Simulation Technique.” ESA IGARSS 84: Remote Sensing: From Res. towards Operational Use, vol. 2, 1984.

Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.”10.1145/828.322450__Journal of the ACM (JACM), 1984, pp. 668–76, doi:10.1145/828.322450.

Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.”10.1109/sfcs.1984.715901__25th Annual Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.

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.

Domik, Gitta, and E. Kienegger. “Method to Relate Digital SAR Images and Map Information in Mountainous Areas .” Proceedings of the World Conference on Remote Sensing, 1984.

Rott, H., and Gitta Domik. “The SAR-580 Experiment on Snow and Glaciers at the Austrian Test Site.” Proc. SAR-580 Investigators Workshop, vol. 2, 1984, pp. 217–32.

Domik, Gitta, et al. Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models. Graz Research Center, 1984.

Domik, Gitta, et al. “Analyse von Radarbildern Mittels Digitaler Hoehenmodelle.” Bildmessung Und Luftbildwesen, vol. 52, no. 5, 1984, pp. 249–63.

Peckhaus, Volker. Der nationalsozialistische eneue Begriff“von Wissenschaft am Beispiel der eDeutschen Mathematik“4 Programm, Konzeption und politische Realisierung, Magisterarbeit an der Philosophischen Fakultät der Rheinisch-Westfälischen Technischen Hochschule Aachen, August 1984. 1984.

Hagengruber, Ruth Edith. Das Schöne Als Vollzug Der Liebe. Eros-Logos-Verhältnisse in Platons Symposion. 1984.

Hilgert, Joachim, and K. H. Hofmann. “Lie Theory of Semigroups.” Semigroup Forum, vol. 30, 1984, pp. 243–51.

Domik, Gitta. “Radar Image Simulation as a Tool to Analyze Topographic Effects on Geometry and Radiometry of Radar Imagery.” Machine Processing of Remotely Sensed Data- Quantifying Global Process: Models, Sensor Systems, and Analytical Methods, 1985, pp. 248–253.

Raggam, J., et al. “Radargrammetric Aspects of SAR Data Evaluation.” Thematic Applications of SAR Data, 1985, p. 57.

Engels, Gregor, and Wilhelm Schäfer. “Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment.” Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany), vol. 186, Springer, 1985, pp. 179–93.

Engels, Gregor, and Wilhelm Schäfer. “The Design of an Adaptive and Portable Programming Support Environment.” Proceedings of the International Computing Symposium, Amsterdam (The Netherlands), 1985.

Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.”10.1016/0020-0190(85)90042-0__Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.

Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.”10.1145/4221.4250__Journal of the ACM (JACM), 1985, pp. 929–37, doi:10.1145/4221.4250.

Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.”10.1016/0304-3975(85)90079-9__Theoretical Computer Science, 1985, pp. 325–30, doi:10.1016/0304-3975(85)90079-9.

Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.”10.1109/sfcs.1985.58__26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58.

Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.”10.1145/22145.22151__Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22151.

Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.”10.1145/22145.22191__Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985, doi:10.1145/22145.22191.