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.

330 Publications


1993 | Book Chapter | LibreCat-ID: 16732
Capabilities and complexity of computations with integer division
K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
High performance universal hashing, with applications to shared memory simulations
M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
Hashing strategies for simulating shared memory on distributed memory machines
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16735
On the performance of networks with multiple busses
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 16736
Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16737
Dynamic Hashing in Real Time
M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.
LibreCat | DOI
 

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

1990 | Book Chapter | LibreCat-ID: 16740
On the complexity of genuinely polynomial computation
M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16739
Dynamic hashing strategies
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16741
How to distribute a dictionary in a complete network
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
Not all keys can be hashed in constant time
J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.
LibreCat | DOI
 

1990 | Journal Article | LibreCat-ID: 16824
Das Heinz Nixdorf-Institut der Universität-GH Paderborn
F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232.
LibreCat
 

1989 | Book Chapter | LibreCat-ID: 16745
On genuinely time bounded computations
F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16746
Time-optimal simulations of networks by universal parallel computers
F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 

1989 | Book Chapter | LibreCat-ID: 16789
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
LibreCat | DOI
 

1989 | Journal Article | LibreCat-ID: 16743
On computations with integer division
B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111.
LibreCat | DOI
 

1989 | Conference Paper | LibreCat-ID: 16744
An optimal parallel dictionary
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989.
LibreCat | DOI
 

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

1988 | Journal Article | LibreCat-ID: 16765
A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.
LibreCat | DOI
 

1988 | Conference Paper | LibreCat-ID: 16766
Dynamic perfect hashing: upper and lower bounds
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed