Travelled to:1 × Austria
1 × Canada
1 × France
1 × Sweden
1 × Switzerland
5 × USA
Collaborated with:∅ M.Dietzfelbinger A.Wigderson F.E.Fich B.Vöcking B.Oesterdiekhoff R.Wanka R.M.Karp M.Luby J.Y.Gil R.Cypher C.Scheideler D.Grigoriev M.Karpinski R.Smolensky P.Ragde A.Borodin E.Upfal R.Cole B.M.Maggs M.Mitzenmacher A.W.Richa K.Schröder R.K.Sitaraman A.Cord-Landwehr B.Degener M.Fischer M.Hüllmann B.Kempkes A.Klaas P.Kling S.Kurras M.Märtens C.Raupach K.Swierkot D.Warner C.Weddemann D.Wonisch
Talks about:algorithm (4) distribut (3) problem (3) time (3) hash (3) dictionari (2) dimension (2) univers (2) network (2) between (2)
Person: Friedhelm Meyer auf der Heide
DBLP: Heide:Friedhelm_Meyer_auf_der
Facilitated 3 volumes:
EdEdEdContributed to:
2011
1998199619931992199019901986198519831979Wrote 14 papers:
- ICALP-v2-2011-Cord-LandwehrDFHKKKKMHRSWWW #algorithm #approach #convergence #mobile
- A New Approach for Analyzing Convergence Algorithms for Mobile Robots (ACL, BD, MF, MH, BK, AK, PK, SK, MM, FMadH, CR, KS, DW, CW, DW), pp. 650–661.
- STOC-1998-ColeMHMRSSV #multi #network #protocol #random
- Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks (RC, BMM, FMadH, MM, AWR, KS, RKS, BV), pp. 378–388.
- STOC-1996-CypherHSV #algorithm
- Universal Algorithms for Store-and-Forward and Wormhole Routing (RC, FMadH, CS, BV), pp. 356–365.
- STOC-1996-GrigorievKHS #algebra #bound #random
- A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.
- ICALP-1993-HeideOW #adaptation
- Strongly Adaptive Token Distribution (FMadH, BO, RW), pp. 398–409.
- STOC-1992-KarpLH #distributed #memory management #performance #simulation
- Efficient PRAM Simulation on a Distributed Memory Machine (RMK, ML, FMadH), pp. 318–326.
- ICALP-1990-DietzfelbingerH #realtime
- A New Universal Class of Hash Functions and Dynamic Hashing in Real Time (MD, FMadH), pp. 6–19.
- STOC-1990-DietzfelbingerH #how #network #taxonomy
- How to Distribute a Dictionary in a Complete Network (MD, FMadH), pp. 117–127.
- STOC-1990-GilHW #constant
- Not All Keys Can Be Hashed in Constant Time (JYG, FMadH, AW), pp. 244–253.
- ICALP-1986-BorodinFHUW #problem #taxonomy #trade-off
- A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem (AB, FEF, FMadH, EU, AW), pp. 50–59.
- STOC-1985-FichHRW #bound #infinity #parallel
- One, Two, Three … Infinity: Lower Bounds for Parallel Computation (FEF, FMadH, PR, AW), pp. 48–58.
- STOC-1985-Heide #algorithm #performance #problem #strict
- Fast Algorithms for N-Dimensional Restrictions of Hard Problems (FMadH), pp. 413–420.
- STOC-1983-Heide #algorithm #linear #polynomial #problem
- A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem (FMadH), pp. 70–79.
- ICALP-1979-Heide #comparison #game studies #graph
- A Comparison Between Two Variations of a Pebble Game on Graphs (FMadH), pp. 411–421.