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.

361 Publications


1996 | Conference Paper | LibreCat-ID: 17419
Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In Proc. of 28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization.
LibreCat
 

1996 | Book Chapter | LibreCat-ID: 16703
Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16700
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542. https://doi.org/10.1007/bf01940878
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16698
Ameur, F., Fischer, P., Höffgen, K.-U., & Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. Acta Informatica, 621–630. https://doi.org/10.1007/bf03036467
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16701
Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955. https://doi.org/10.1137/s0097539793255722
LibreCat | DOI
 

1996 | Report | LibreCat-ID: 17418
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention Resolution in Hashing Based Shared Memory Simulations.
LibreCat
 

1996 | Book Chapter | LibreCat-ID: 17564
Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg. https://doi.org/10.1007/bfb0024725
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 16707
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. In Proceedings Third Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16704
Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16874
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 16706
Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95. https://doi.org/10.1145/215399.215430
LibreCat | DOI
 

1995 | Conference Paper | LibreCat-ID: 17482
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Simulating shared memory in real time: On the computation power of reconfigurable meshes. In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures (pp. 46--59).
LibreCat
 

1995 | Journal Article | LibreCat-ID: 16566
Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
LibreCat | DOI
 

1994 | Journal Article | LibreCat-ID: 16728
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 738–761. https://doi.org/10.1137/s0097539791194094
LibreCat | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
Meyer auf der Heide, F., Monien, B., & Rosenberg, A. L. (Eds.). (1993). Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-56731-3
LibreCat | DOI
 

1993 | Book Chapter | LibreCat-ID: 16730
Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 16731
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93. https://doi.org/10.1145/165231.165246
LibreCat | DOI
 

1993 | Journal Article | LibreCat-ID: 16729
Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. Information and Computation, 196–217. https://doi.org/10.1006/inco.1993.1007
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 17479
Kastens, U., Meyer auf der Heide, F., Wachsmann, A., & Wichmann, F. (1993). OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In Proc. 3rd PASA Workshop, PARS Mitteilungen (pp. 50–55).
LibreCat
 

1993 | Book Chapter | LibreCat-ID: 16732
Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_3
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16735
Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 16736
Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92. https://doi.org/10.1145/129712.129743
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16737
Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16738
Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018
LibreCat | DOI
 

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 | Book Chapter | LibreCat-ID: 16739
Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597
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 | 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
 

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
 

1988 | Journal Article | LibreCat-ID: 16764
Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747. https://doi.org/10.1145/44483.44490
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16765
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1988). A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7
LibreCat | DOI
 

1988 | Conference Paper | LibreCat-ID: 16766
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21968
LibreCat | DOI
 

1988 | Book Chapter | LibreCat-ID: 16767
Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., & Wigderson, A. (1988). On computations with integer division. In STACS 88. Berlin, Heidelberg. https://doi.org/10.1007/bfb0035829
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
 

1988 | Book Chapter | LibreCat-ID: 16768
Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., & Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In SWAT 88. Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_24
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16772
Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1987). A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 97–99. https://doi.org/10.1137/0216007
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16773
Meyer auf der Heide, F., & Wigderson, A. (1987). The Complexity of Parallel Sorting. SIAM Journal on Computing, 100–107. https://doi.org/10.1137/0216008
LibreCat | DOI
 

1986 | Journal Article | LibreCat-ID: 16771
Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models of Parallel Computers. SIAM Journal on Computing, 106–119. https://doi.org/10.1137/0215008
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16776
Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A time-space tradeoff for element distinctness. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_89
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16774
Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_54
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16775
Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_72
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed