A. Trächtler, “Simulation dynamischer Systeme mit dem Programmsystem PILAR,” Fortschritte in der Simulationstechnik, vol. Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg, pp. 395-397, 1990.
LibreCat: /record/23372

A. Trächtler and B. Lohmann, “Berechnung der Nullstellen quadratischer Mehrgrößensysteme,” at-Automatisierungstechnik, pp. 353-354, 1990.
LibreCat: /record/23373

U. Hohenstein and G. Engels, “Formal Semantics of an Entity-Relationship Query Language,” in Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland, 1990, pp. 177–188.
LibreCat: /record/7824

S. Krauter and R. Hanitsch, “The Influence of the Capsulation on the Efficiency of PV-Modules.,” in Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144., Reading (UK), 1990.
LibreCat: /record/8081
DOI: 10.1016/B978-0-08-037539-7.50062-4

G. Engels, “Elementary Actions on an Extended Entity-Relationship Database,” in Proceedings of the workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany), 1990, vol. 532, pp. 344–362.
LibreCat: /record/8259
DOI: http://dx.doi.org/10.1007/BFb0017372

M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in Automata, Languages and Programming, Berlin/Heidelberg, 1990.
LibreCat: /record/16738
DOI: 10.1007/bfb0032018

F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat: /record/16739
DOI: 10.1007/bfb0029597

M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat: /record/16740
DOI: 10.1007/bfb0029630

M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary in a complete network,” in Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90, 1990.
LibreCat: /record/16741
DOI: 10.1145/100216.100229

J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed in constant time,” in Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90, 1990.
LibreCat: /record/16742
DOI: 10.1145/100216.100247