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.” Lecture Notes in Computer Science, 1993, doi: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, pp. 213–20, doi: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.” Data Structures and Efficient Algorithms, 1992, doi: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.” Lecture Notes in Computer Science, 1992, doi: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.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176.
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 16736
Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 1992, doi: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.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi: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.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi: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.” Lecture Notes in Computer Science, 1990, doi: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.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90, 1990, doi:10.1145/100216.100229.
LibreCat
| DOI
1990 | Conference Paper | LibreCat-ID: 16742
Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” 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, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum, vol. 13, no. 4, 1990, pp. 231–32.
LibreCat
1989 | Journal Article | LibreCat-ID: 16743
Just, Bettina, et al. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, pp. 101–11, doi:10.1051/ita/1989230101011.
LibreCat
| DOI
1989 | Conference Paper | LibreCat-ID: 16744
Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’89, 1989, doi:10.1145/72935.72974.
LibreCat
| DOI
1989 | Book Chapter | LibreCat-ID: 16745
Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS 89, 1989, doi: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.” STACS 89, 1989, doi: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.” STACS 89, 1989, doi:10.1007/bfb0028983.
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16763
Babai, László, et al. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, pp. 99–107, doi:10.1016/0890-5401(88)90031-4.
LibreCat
| DOI