F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” SIAM Journal on Computing, pp. 106–119, 1986.

A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in Automata, Languages and Programming, Berlin, Heidelberg, 1986.

F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in STACS 86, Berlin, Heidelberg, 1986.

A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in STACS 86, Berlin, Heidelberg, 1986.

F. Leberl, G. Domik, J. Raggam, and M. Kobrick, “Radar Stereomapping Techniques and Application to SIR-B Images of Mt. Shasta,” IEEE Transactions on Geoscience and Remote Sensing, vol. GE-24, no. 4, pp. 473–481, 1986.

F. Leberl, G. Domik, J. Raggam, J. Cimino, and M. Kobrick, “Multiple Incidence Angle SIR-B Expenment Over Argentina: Stereo-Radargrammetrc Analysis,” IEEE Transactions on Geoscience and Remote Sensing, vol. GE-24, no. 4, pp. 482–491, 1986.

G. Domik and F. Leberl, “Using secondary image products to aid in understanding and interpretation of radar imagery,” in IGARSS’86: Remote Sensing: Today’s Solutions for Tomorrow’s Information Needs, 1986, vol. 254, pp. 467–468.

F. Leberl, G. Domik, J. Raggam, J. Cimino, and M. Kobrick, “Radargrammetric Experiments with Space Shuttle SIR-B Imagery,” International archives of photogrammetry and remote sensing= Archives internationales de photogramm\rquote etrie et de t\rquote el\rquote ed\rquote etection= Internationales Archiv der Photogrammetrie und Fernerkundung, pp. 333–344, 1986.

G. Domik, “Radar image simulation as a tool to analyze topographic effects on geometry and radiometry of radar imagery,” in Machine processing of remotely sensed data- Quantifying global process: Models, sensor systems, and analytical methods, 1985, pp. 248–253.

J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, and F. Leberl, “Radargrammetric aspects of SAR data evaluation,” Thematic Applications of SAR data, p. 57, 1985.

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

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

C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” Information Processing Letters, pp. 101–105, 1985.

F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.

F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.

F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.

F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two, three . . . infinity: lower bounds for parallel computation,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.

F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.

F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.

F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine equations on several parallel computational models,” Information and Control, vol. 67, no. 1–3, pp. 195–211, 1985.