Obserwuj
Friedhelm Meyer auf der Heide
Friedhelm Meyer auf der Heide
Professor of Computer Science, University of Paderborn
Zweryfikowany adres z upb.de
Tytuł
Cytowane przez
Cytowane przez
Rok
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
6291994
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
3081992
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
2142001
A new universal class of hash functions and dynamic hashing in real time
M Dietzfelbinger, F Meyer auf der Heide
Automata, Languages and Programming: 17th International Colloquium Warwick …, 1990
1921990
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
1421997
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
1171984
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
1162011
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
1121995
Simple, efficient shared memory simulations
M Dietzfelbinger, F Meyer auf der Heide
Proceedings of the fifth annual ACM symposium on Parallel Algorithms and …, 1993
1021993
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
972002
Dynamic load balancing in distributed hash tables
M Bienkowski, M Korzeniowski, FM der Heide
International Workshop on Peer-to-Peer Systems, 217-225, 2005
922005
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
901996
Strongly adaptive token distribution
F auf der Meyer Heide, B Oesterdiekhoff, R Wanka
Algorithmica 15 (5), 413-427, 1996
771996
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
75*1996
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
741998
A packet routing protocol for arbitrary networks
F Meyer, B Vöcking
Annual Symposium on Theoretical Aspects of Computer Science, 291-302, 1995
721995
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
671987
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
661985
The complexity of parallel sorting
FM auf der Heide, A Wigderson
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 532-540, 1985
661985
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
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20