Mickus-Miceli, K., &; Domik, G. (1992). 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.
LibreCat: /record/15252

Ginthör, R., Platzner, M., &; Weiss, R. (1992). Experimental Results to Interprocessor Communication in Distributed Transputer-Systems. In Proceedings of the 1st Austrian-Hungarian Workshop on Transputer Applications (pp. 45–54).
LibreCat: /record/13465

Müller, W., &; Kleinjohann, B. (1992). The EXPRESS Information Modeling Workbench - A New Approach to Graphical Design Environments. Proceedings of the 2nd EXPRESS User’s Group Conference.
LibreCat: /record/39582

Dahn, B. I., Lettmann, T., &; Schönfeld, W. (1991). ILFA Interface Concept (Vol. 193). ´Heidelberg: Wissenschaftliche Zentrum der IBM Deutschland .
LibreCat: /record/19822

Alt, H., Behrends, B., &; Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91. ACM Press.https://doi.org/10.1145/109648.109669 
LibreCat: /record/3048
DOI: 10.1145/109648.109669

Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press.https://doi.org/10.1109/sfcs.1991.185434 
LibreCat: /record/3049
DOI: 10.1109/sfcs.1991.185434

Domik, G. (1991). The role of visualization in understanding data. In H. Maurer (Ed.), New Results and New Trends in Computer Science (pp. 91–107). Berlin, Heidelberg: Springer Berlin Heidelberg.
LibreCat: /record/21790

Löhr-Richter, P., &; Engels, G. (1991). Incremental Design of Conceptual Database Schemata with CADDY. Leiden University, P.O. Box 9500, 2300 RA Leiden, The Netherlands: Leiden University.
LibreCat: /record/8188

Domik, G., &; Mickus, K. (1991). Visualization in the Analysis Cycle of Observational Data, in Analyzing and Modeling Data and Knowledge. In M. Schader (Ed.), Proceedings of the 15th Annual Conference of the “Gesellschaft für Klassifikation e.V.” University of Salzburg (pp. 267–276). Salzburg.
LibreCat: /record/16912

Müller, W. (1991). Contract-Oriented System Design and Specification. Proceedings of the Workshop on Practical Computer Based Systems Engineering - Its Scope and Methods.
LibreCat: /record/39584

Lehrenfeld, G., &; Müller, W. (1991). Validation of EXPRESS Models Using Prolog. Proceedings of the 1st EXPRESS User’s Group Conference.
LibreCat: /record/39583

Alt, H., Blömer, J., &; Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag.https://doi.org/10.1007/bfb0032068 
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

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

Engels, G. (1990). 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) (Vol. 532, pp. 344–362). Berlin/Heidelberg: Springer.http://dx.doi.org/10.1007/BFb0017372 
LibreCat: /record/8259
DOI: http://dx.doi.org/10.1007/BFb0017372

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg.https://doi.org/10.1007/bfb0032018 
LibreCat: /record/16738
DOI: 10.1007/bfb0032018

Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg.https://doi.org/10.1007/bfb0029597 
LibreCat: /record/16739
DOI: 10.1007/bfb0029597

Karpinski, M., &; Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg.https://doi.org/10.1007/bfb0029630 
LibreCat: /record/16740
DOI: 10.1007/bfb0029630

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90.https://doi.org/10.1145/100216.100229 
LibreCat: /record/16741
DOI: 10.1145/100216.100229

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

Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4), 231–232.
LibreCat: /record/16824