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
1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56503-5_46.
LibreCat
| DOI
1992 | Journal Article | LibreCat-ID: 18936
Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, 213–20. https://doi.org/10.1142/s0129626492000349.
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_31.
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-56731-3_3.
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In STACS 92. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55210-3_176.
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 16736
Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 1992. https://doi.org/10.1145/129712.129743.
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” In TEUBNER-TEXTE Zur Informatik. Wiesbaden, 1992. https://doi.org/10.1007/978-3-322-95233-2_7.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, Martin, and Friedhelm 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. https://doi.org/10.1007/bfb0032018.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029597.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16740
Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029630.
LibreCat
| DOI
1990 | Conference Paper | LibreCat-ID: 16741
Dietzfelbinger, M., and Friedhelm 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. https://doi.org/10.1145/100216.100229.
LibreCat
| DOI
1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., Friedhelm 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. https://doi.org/10.1145/100216.100247.
LibreCat
| DOI
1990 | Journal Article | LibreCat-ID: 16824
Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum 13, no. 4 (1990): 231–32.
LibreCat
1989 | Journal Article | LibreCat-ID: 16743
Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, 101–11. https://doi.org/10.1051/ita/1989230101011.
LibreCat
| DOI
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” In Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’89, 1989. https://doi.org/10.1145/72935.72974.
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/10.1007/bfb0028969.
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16746
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/10.1007/bfb0028978.
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16789
Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” In STACS 89. Berlin, Heidelberg, 1989. https://doi.org/10.1007/bfb0028983.
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16763
Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4.
LibreCat
| DOI