 |
Udi Wieder
Researcher
Microsoft Research, Silicon Valley
1065 La Avenida
Mountain View, CA 94043
Phone: +1 (650) 693-1251
Fax: +1 (425) 936-7329
uwieder [at] microsoft.com
|
I am a Researcher in Microsoft Research's Silicon Valley lab,
which I joined in September, 2005.
I did my Ph.D at the Weizmann Institute of Science, under the supervision of Moni Naor. My Master's degree was done under the supervision of Uri Feige.
Papers
|
-
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.
with Rina Panigrahy and Kunal Talwar.
submitted. [PDF]
-
More Robust Hashing: Cuckoo Hashing with a Stash.
with Adam Kirsch and Michael Mitzenmacher.
submitted. [PDF]
-
History-Independent Cuckoo Hashing.
with Moni Naor and Gil Segev.
ICALP 2008. [PDF]
-
Kinesis: A New Approach to Replica Placement in Distributed Storage Systems.
with John MacCormick, Nick Murphy, Venugopalan Ramasubramanian, Junfeng Yang and Lidong Zhou.
Transactions on Storage, 2008. [PDF]
-
Trace Reconstruction with Constant Deletion Probability and Related Results.
with Thomas Holenstein, Michael Mitzenmacher and Rina Panigrahy.
SODA 2008. [PDF]
-
Strong-Diameter Decompositions of Minor Free Graphs.
with Ittai Abraham, Cyril Gaviolle and Dahlia Malkhi.
SPAA 2007. [PDF]
-
Balanced Allocations: The Weighted Case.
with Kunal Talwar.
STOC 2007. [PDF]
-
Balanced Allocations with Heterogeneous Bins.
SPAA 2007. [PDF]
-
The Expansion and Mixing Time of Skip Graphs with Applications.
with Jim Aspnes.
SPAA 2005.
[PS,PDF,PPT]
-
The Routing Complexity of Faulty Networks.
with Omer Angel, Itai Benjamini and Eran Ofek.
Random Structures and Algorithms 32(1), 2008. Earlier version in
PODC 2005,
[PS,PDF,PPT]
-
Know thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks.
with Gurmeet S. Manku and Moni Naor.
STOC 2004.
[PDF,PPT]
-
Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds.
with Moni Naor.
IPTPS 2004.
[PS,PDF,PPT]
-
Scalable and dynamic quorum systems.
with Moni Naor.
Distributed Computing 17(4) 2005. Earlier version appeared in PODC 2003.
[PS,PDF,PPT]
-
A Simple Fault Tolerant Distributed Hash Table.
with Moni Naor.
IPTPS 2003.
[PS,PDF,PPT]
-
Novel Architectures for P2P Applications: the Continuous-Discrete Approach.
with Moni Naor.
ACM Transactions on Algorithms 3(3) 2007, earlier version in
SPAA 2003.
[PDF,PPT]
-
Approximating Maximum Edge Coloring in Multigraphs
with Uri Feige and Eran Ofek.
APPROX 2002.
[PS,PPT]
|
Personal
|
My Paintings.
Photos
|
|
