Travelled to:1 × Denmark
1 × Iceland
3 × USA
Collaborated with:K.Talwar M.Naor A.Gupta O.Reingold R.D.Rothblum G.Segev G.S.Manku M.Isard V.Prabhakaran J.Currey A.Goldberg
Talks about:neighbor (2) balanc (2) alloc (2) case (2) pseudorandom (1) multistag (1) lookahead (1) distribut (1) structur (1) independ (1)
Person: Udi Wieder
DBLP: Wieder:Udi
Contributed to:
2014
20092008
20072004Wrote 7 papers:
- ICALP-v1-2014-GuptaTW #multi #optimisation
- Changing Bases: Multistage Optimization for Matroids and Matchings (AG, KT, UW), pp. 563–575.
- ICALP-v1-2014-ReingoldRW #data type #graph #pseudo
- Pseudorandom Graphs in Data Structures (OR, RDR, UW), pp. 943–954.
- ICALP-v1-2014-TalwarW #proving
- Balanced Allocations: A Simple Proof for the Heavily Loaded Case (KT, UW), pp. 979–990.
- SOSP-2009-IsardPCWTG #clustering #distributed #named #scheduling
- Quincy: fair scheduling for distributed computing clusters (MI, VP, JC, UW, KT, AG), pp. 261–276.
- ICALP-C-2008-NaorSW #independence
- History-Independent Cuckoo Hashing (MN, GS, UW), pp. 631–642.
- STOC-2007-TalwarW
- Balanced allocations: the weighted case (KT, UW), pp. 256–265.
- STOC-2004-MankuNW #lookahead #network #power of #random
- Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks (GSM, MN, UW), pp. 54–63.