Follow
Friedhelm Meyer auf der Heide
Friedhelm Meyer auf der Heide
Professor of Computer Science, University of Paderborn
Verified email at upb.de
Title
Cited by
Cited by
Year
Dynamic perfect hashing: Upper and lower bounds
M Dietzfelbinger, A Karlin, K Mehlhorn, F Meyer Auf Der Heide, H Rohnert, ...
SIAM Journal on Computing 23 (4), 738-761, 1994
5991994
Efficient PRAM simulation on a distributed memory machine
RM Karp, M Luby, F Meyer auf der Heide
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
2861992
The randomized z-buffer algorithm: Interactive rendering of highly complex scenes
M Wand, M Fischer, I Peter, F Meyer auf der Heide, W Straßer
Proceedings of the 28th annual conference on Computer graphics and …, 2001
2152001
A new universal class of hash functions and dynamic hashing in real time
FM auf der Heide
Automata, Languages and Programming: 17th International Colloquium, Warwick …, 1990
1701990
Exploiting locality for data management in systems of limited bandwidth
BM Maggs, FM auf der Heide, B Vocking, M Westermann
Proceedings 38th Annual Symposium on Foundations of Computer Science, 284-293, 1997
1341997
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
A Bäumker, W Dittrich, F Meyer auf der Heide
Algorithms—ESA'95: Third Annual European Symposium Corfu, Greece, September …, 1995
1141995
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
F Meyer auf der Heide
Journal of the ACM (JACM) 31 (3), 668-676, 1984
1121984
Simple, efficient shared memory simulations
M Dietzfelbinger, F Meyer auf der Heide
Proceedings of the fifth annual ACM symposium on Parallel Algorithms and …, 1993
991993
Energy, congestion and dilation in radio networks
F Meyer auf de Heide, C Schindelhauer, K Volbert, M Grünewald
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
982002
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
B Degener, B Kempkes, T Langner, F Meyer auf der Heide, P Pietrzyk, ...
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
972011
Dynamic load balancing in distributed hash tables
M Bienkowski, M Korzeniowski, FM Heide
Lecture notes in computer science 3640, 217-225, 2005
882005
Universal algorithms for store-and-forward and wormhole routing
R Cypher, F Meyer auf der Heide, C Scheideler, B Vöcking
Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996
871996
Strongly adaptive token distribution
F auf der Meyer Heide, B Oesterdiekhoff, R Wanka
Algorithmica 15 (5), 413-427, 1996
731996
Exploiting storage redundancy to speed up randomized shared memory simulations
FM auf der Heide, C Scheideler, V Stemann
Theoretical Computer Science 162 (2), 245-281, 1996
72*1996
A Packet Routing Protocol for Arbitrary Networks.
FM auf der Heide, B Vöcking
STACS, 291-302, 1995
691995
One, two, three... infinity: Lower bounds for parallel computation
FE Fich, F Meyer auf der Heide, P Ragde, A Wigderson
Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985
641985
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
R Cole, BM Maggs, F Meyer auf der Heide, M Mitzenmacher, AW Richa, ...
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
621998
A time-space tradeoff for element distinctness
A Borodin, F Fich, F Meyer Auf Der Heide, E Upfal, A Wigderson
SIAM Journal on Computing 16 (1), 97-99, 1987
611987
Allocating weighted jobs in parallel
P Berenbrink, F Meyer auf der Heide, K Schröder
Proceedings of the ninth annual ACM symposium on Parallel algorithms and …, 1997
591997
The complexity of parallel sorting
FM auf der Heide, A Wigderson
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 532-540, 1985
591985
The system can't perform the operation now. Try again later.
Articles 1–20