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, 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
1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Journal of the ACM (JACM), 1988, pp. 740–47, doi:10.1145/44483.44490.
LibreCat
| DOI
1988 | Journal Article | LibreCat-ID: 16765
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Theoretical Computer Science, 1988, pp. 57–68, doi:10.1016/0304-3975(88)90018-7.
LibreCat
| DOI
1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988, doi:10.1109/sfcs.1988.21968.
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16767
Just, Bettina, et al. “On Computations with Integer Division.” STACS 88, 1988, doi:10.1007/bfb0035829.
LibreCat
| DOI
1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” SWAT 88, 1988, doi:10.1007/3-540-19487-8_24.
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.
LibreCat
| DOI
1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” SIAM Journal on Computing, 1987, pp. 100–07, doi:10.1137/0216008.
LibreCat
| DOI
1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” SIAM Journal on Computing, 1986, pp. 106–19, doi:10.1137/0215008.
LibreCat
| DOI
1986 | Book Chapter | LibreCat-ID: 16774
Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Automata, Languages and Programming, 1986, doi: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.” STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
LibreCat
| DOI