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.
792 Publications
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 | 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 | 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
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
1988 | Journal Article | LibreCat-ID: 16763
Babai, L., Just, B., & Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. Information and Computation, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4
LibreCat
| DOI