Mickus-Miceli, KD, and G Domik. “An Enriched Framework for Multidisciplinary Data Analysis.” In Symposium on Intelligent Scientific Computation, American Association for Artificial Intelligence (AAAI), Fall 1992 Symposium Series, Cambridge MA, October, 1992.

Ginthör, Robert, Marco Platzner, and Reinhold Weiss. “Experimental Results to Interprocessor Communication in Distributed Transputer-Systems.” In Proceedings of the 1st Austrian-Hungarian Workshop on Transputer Applications, 45–54, 1992.

Müller, Wolfgang, and Bernd Kleinjohann. “The EXPRESS Information Modeling Workbench - A New Approach to Graphical Design Environments.” In Proceedings of the 2nd EXPRESS User’s Group Conference. Dallas TX, 1992.

Dahn, Bernd I., Theodor Lettmann, and Wolfgang Schönfeld. ILFA Interface Concept. Vol. 193. IWBS Report. ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland , 1991.

Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes (Extended Abstract).”https://doi.org/10.1145/109648.109669__In Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91. ACM Press, 1991.https://doi.org/10.1145/109648.109669 .

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”https://doi.org/10.1109/sfcs.1991.185434__In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991.https://doi.org/10.1109/sfcs.1991.185434 .

Domik, Gitta. “The Role of Visualization in Understanding Data.” In New Results and New Trends in Computer Science, edited by Hermann Maurer, 91–107. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991.

Löhr-Richter, Perdita, and Gregor Engels. Incremental Design of Conceptual Database Schemata with CADDY. Leiden University, P.O. Box 9500, 2300 RA Leiden, The Netherlands: Leiden University, 1991.

Domik, Gitta, and KD  Mickus. “Visualization in the Analysis Cycle of Observational Data, in Analyzing and Modeling Data and Knowledge.” In Proceedings of the 15th Annual Conference of the “Gesellschaft Für Klassifikation e.V.” University of Salzburg, edited by M. Schader, 267–76, 1991.

Müller, Wolfgang. “Contract-Oriented System Design and Specification.” In Proceedings of the Workshop on Practical Computer Based Systems Engineering - Its Scope and Methods. Grassau Germany, 1991.

Lehrenfeld, Georg, and Wolfgang Müller. “Validation of EXPRESS Models Using Prolog.” In Proceedings of the 1st EXPRESS User’s Group Conference. Houston TX, USA, 1991.

Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.”https://doi.org/10.1007/bfb0032068__In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990.https://doi.org/10.1007/bfb0032068 .

Hohenstein, Uwe, and Gregor Engels. “Formal Semantics of an Entity-Relationship Query Language.” In Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland, 177–88. ER Institute, 1990.

Engels, Gregor. “Elementary Actions on an Extended Entity-Relationship Database.”http://dx.doi.org/10.1007/BFb0017372__In Proceedings of the Workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany), 532:344–62. Berlin/Heidelberg: Springer, 1990.http://dx.doi.org/10.1007/BFb0017372 .

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.”https://doi.org/10.1007/bfb0032018__In Automata, Languages and Programming. Berlin/Heidelberg, 1990.https://doi.org/10.1007/bfb0032018 .

Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.”https://doi.org/10.1007/bfb0029597__In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990.https://doi.org/10.1007/bfb0029597 .

Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.”https://doi.org/10.1007/bfb0029630__In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990.https://doi.org/10.1007/bfb0029630 .

Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.”https://doi.org/10.1145/100216.100229__In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.https://doi.org/10.1145/100216.100229 .

Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys Can Be Hashed in Constant Time.”https://doi.org/10.1145/100216.100247__In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.https://doi.org/10.1145/100216.100247 .

Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum 13, no. 4 (1990): 231–32.