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.

735 Publications


1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger M, Meyer auf der Heide F. A new universal class of hash functions and dynamic hashing in real time. In: Automata, Languages and Programming. Berlin/Heidelberg; 1990. doi:10.1007/bfb0032018
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16740
Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029630
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide F. Dynamic hashing strategies. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029597
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger M, Meyer auf der Heide F. 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. doi:10.1145/100216.100229
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 3050
Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
Gil J, Meyer auf der Heide F, Wigderson A. 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. doi:10.1145/100216.100247
LibreCat | DOI
 

1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide F. Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum. 1990;13(4):231-232.
LibreCat
 

1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide F. On genuinely time bounded computations. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028969
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide F, Wanka R. Time-optimal simulations of networks by universal parallel computers. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028978
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: STACS 89. Berlin, Heidelberg; 1989. doi:10.1007/bfb0028983
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed