2009 |
19 | EE | John MacCormick,
Nicholas Murphy,
Venugopalan Ramasubramanian,
Udi Wieder,
Junfeng Yang,
Lidong Zhou:
Kinesis: A new approach to replica placement in distributed storage systems.
TOS 4(4): (2009) |
2008 |
18 | EE | Adam Kirsch,
Michael Mitzenmacher,
Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash.
ESA 2008: 611-622 |
17 | EE | Rina Panigrahy,
Kunal Talwar,
Udi Wieder:
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.
FOCS 2008: 414-423 |
16 | EE | Moni Naor,
Gil Segev,
Udi Wieder:
History-Independent Cuckoo Hashing.
ICALP (2) 2008: 631-642 |
15 | EE | Thomas Holenstein,
Michael Mitzenmacher,
Rina Panigrahy,
Udi Wieder:
Trace reconstruction with constant deletion probability and related results.
SODA 2008: 389-398 |
14 | EE | Omer Angel,
Itai Benjamini,
Eran Ofek,
Udi Wieder:
Routing complexity of faulty networks.
Random Struct. Algorithms 32(1): 71-87 (2008) |
2007 |
13 | EE | Ittai Abraham,
Cyril Gavoille,
Dahlia Malkhi,
Udi Wieder:
Strong-diameter decompositions of minor free graphs.
SPAA 2007: 16-24 |
12 | EE | Udi Wieder:
Balanced allocations with heterogenous bins.
SPAA 2007: 188-193 |
11 | EE | Kunal Talwar,
Udi Wieder:
Balanced allocations: the weighted case.
STOC 2007: 256-265 |
10 | EE | Moni Naor,
Udi Wieder:
Novel architectures for P2P applications: The continuous-discrete approach.
ACM Transactions on Algorithms 3(3): (2007) |
2005 |
9 | EE | Omer Angel,
Itai Benjamini,
Eran Ofek,
Udi Wieder:
Routing complexity of faulty networks.
PODC 2005: 209-217 |
8 | EE | James Aspnes,
Udi Wieder:
The expansion and mixing time of skip graphs with applications.
SPAA 2005: 126-134 |
7 | EE | Moni Naor,
Udi Wieder:
Scalable and dynamic quorum systems.
Distributed Computing 17(4): 311-322 (2005) |
2004 |
6 | EE | Moni Naor,
Udi Wieder:
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds.
IPTPS 2004: 269-277 |
5 | EE | Gurmeet Singh Manku,
Moni Naor,
Udi Wieder:
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks.
STOC 2004: 54-63 |
2003 |
4 | EE | Moni Naor,
Udi Wieder:
A Simple Fault Tolerant Distributed Hash Table.
IPTPS 2003: 88-97 |
3 | EE | Moni Naor,
Udi Wieder:
Scalable and dynamic quorum systems.
PODC 2003: 114-122 |
2 | EE | Moni Naor,
Udi Wieder:
Novel architectures for P2P applications: the continuous-discrete approach.
SPAA 2003: 50-59 |
2002 |
1 | EE | Uriel Feige,
Eran Ofek,
Udi Wieder:
Approximating Maximum Edge Coloring in Multigraphs.
APPROX 2002: 108-121 |