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.
264 Publications
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
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 | Book Chapter | LibreCat-ID: 16767
Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.” In STACS 88. Berlin, Heidelberg, 1988. https://doi.org/10.1007/bfb0035829.
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.” In SWAT 88. Berlin, Heidelberg, 1988. https://doi.org/10.1007/3-540-19487-8_24.
LibreCat
| DOI
1987 | Book Chapter | LibreCat-ID: 19821
Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” In Computation Theory and Logic, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987. https://doi.org/10.1007/3-540-18170-9_167.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 19819
Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” In 8th International Conference on Automated Deduction. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16780-3_119.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” In Automata, Languages and Programming. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16761-7_54.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” In STACS 86. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_72.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” In STACS 86. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_89.
LibreCat
| DOI
1984 | Book Chapter | LibreCat-ID: 16787
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” In STACS 84. Berlin, Heidelberg, 1984. https://doi.org/10.1007/3-540-12920-0_20.
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16813
Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 1981. https://doi.org/10.1007/3-540-10854-8_29.
LibreCat
| DOI
1981 | Book Chapter | LibreCat-ID: 16814
Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1981. https://doi.org/10.1007/3-540-10856-4_111.
LibreCat
| DOI