Friedhelm Meyer auf der Heide
Friedhelm Meyer auf der Heide
Professor of Computer Science, University of Paderborn
Dirección de correo verificada de upb.de
Título
Citado por
Citado por
Año
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
5501994
Efficient PRAM simulation on a distributed memory machine
RM Karp, M Luby, FM auf der Heide
Algorithmica 16 (4), 517-542, 1996
2531996
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
2012001
A new universal class of hash functions and dynamic hashing in real time
M Dietzfelbinger, FM auf der Heide
International Colloquium on Automata, Languages, and Programming, 6-19, 1990
1521990
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
1291997
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
A Bäumker, W Dittrich, FM auf der Heide
European Symposium on Algorithms, 17-30, 1995
1061995
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
991984
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
952002
Simple, efficient shared memory simulations
M Dietzfelbinger, F Meyer auf der Heide
Proceedings of the fifth annual ACM symposium on Parallel Algorithms and …, 1993
931993
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
862011
Dynamic load balancing in distributed hash tables
M Bienkowski, M Korzeniowski, FM auf der Heide
International Workshop on Peer-to-Peer Systems, 217-225, 2005
862005
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
821996
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
66*1996
A packet routing protocol for arbitrary networks
F Meyer, B Vöcking
Annual Symposium on Theoretical Aspects of Computer Science, 291-302, 1995
661995
Allocating weighted jobs in parallel
P Berenbrink, FM auf der Heide, K Schröder
Theory of Computing Systems 32 (3), 281-300, 1999
621999
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
581985
The complexity of parallel sorting
FM auf der Heide, A Wigderson
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 532-540, 1985
581985
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
571998
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
551987
Shortest-path routing in arbitrary networks
FM auf der Heide, B Vöcking
Journal of Algorithms 31 (1), 105-131, 1999
541999
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20