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.

330 Publications


1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_3
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 16736
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92. https://doi.org/10.1145/129712.129743
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7
LibreCat | DOI
 

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

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

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

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

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

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

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

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

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

1989 | Journal Article | LibreCat-ID: 16743
Just, B., Meyer auf der Heide, F., & Wigderson, A. (1989). On computations with integer division. RAIRO - Theoretical Informatics and Applications, 101–111. https://doi.org/10.1051/ita/1989230101011
LibreCat | DOI
 

1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., & Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89. https://doi.org/10.1145/72935.72974
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747. https://doi.org/10.1145/44483.44490
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16765
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1988). A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7
LibreCat | DOI
 

1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21968
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed