Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

5711 Publications


1991 | Conference Paper | LibreCat-ID: 39584
W. Müller, “Contract-Oriented System Design and Specification,” 1991.
LibreCat
 

1991 | Conference Paper | LibreCat-ID: 39583
G. Lehrenfeld and W. Müller, “Validation of EXPRESS Models Using Prolog,” 1991.
LibreCat
 

1990 | Book Chapter | LibreCat-ID: 3050
H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 7824
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
 

1990 | Conference Paper | LibreCat-ID: 8259
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 | DOI
 

1990 | Book Chapter | LibreCat-ID: 16738
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 | DOI
 

1990 | Book Chapter | LibreCat-ID: 16739
F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16740
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 | DOI
 

1990 | Conference Paper | LibreCat-ID: 16741
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 | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
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 | DOI
 

Filters and Search Terms

department=7

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed