Software Specification by Graph Grammars
M. Nagl, G. Engels, R. Gall, W. Schäfer, in: Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany), Springer, Berlin/Heidelberg, 1983, pp. 267–287.

Software Specification Using Graph Grammars
G. Engels, R. Gall, M. Nagl, W. Schäfer, Computing 31 (1983) 317–346.

An Operational Semantics for Specifications of Abstract Data Types with Error Handling
G. Engels, U. Pletat, H.-D. Ehrich, Acta Informatica 9 (1983) 235–254.

Efficiency of universal parallel computers
F. Meyer auf der Heide, Acta Informatica (1983) 269–296.

A lower time bound for the knapsack problem on random access machines
P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.

Infinite cube-connected cycles
F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.

A polynomial linear search algorithm for the n-dimensional knapsack problem
F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983.

Efficiency of universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.

The mathematization of situations outside mathematics from an educational point of view
R. Biehler, in: M. Zweng (Ed.), Proceedings of the Fourth International Congress on Mathematical Education, Birkhäuser, Boston, 1983, pp. 291–293.

Review of Applications in School Mathematics: National Report Federal Republic of Germany
R. Biehler, U. Beck, G. Kaiser, in: H. Burkhardt (Ed.), An International Review of Applications in School Mathematics: The Elusive El Dorado, ERIC, Columbus, 1983, pp. 68–93.

Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht?
R. Biehler, in: Beiträge zum Mathematikunterricht 1983, Franzbecker, Bad Salzdetfurth, 1983, pp. 72–75.