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.

756 Publications


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
 

1985 | Conference Paper | LibreCat-ID: 16783
Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985). One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85. https://doi.org/10.1145/22145.22151
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16788
Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear search algorithms. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.38
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16784
Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions of hard problems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85. https://doi.org/10.1145/22145.22191
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16823
Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control, 67(1–3), 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16780
Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937. https://doi.org/10.1145/4221.4250
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed