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.