dblp.uni-trier.dewww.uni-trier.de

Udi Wieder Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
22EEDahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder: Virtual Ring Routing Trends. DISC 2009: 392-406
21EEMichael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew Goldberg: Quincy: fair scheduling for distributed computing clusters. SOSP 2009: 261-276
20EEJames Aspnes, Udi Wieder: The expansion and mixing time of skip graphs with applications. Distributed Computing 21(6): 385-393 (2009)
19EEJohn 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
18EEAdam Kirsch, Michael Mitzenmacher, Udi Wieder: More Robust Hashing: Cuckoo Hashing with a Stash. ESA 2008: 611-622
17EERina Panigrahy, Kunal Talwar, Udi Wieder: A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. FOCS 2008: 414-423
16EEMoni Naor, Gil Segev, Udi Wieder: History-Independent Cuckoo Hashing. ICALP (2) 2008: 631-642
15EEThomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder: Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398
14EEOmer Angel, Itai Benjamini, Eran Ofek, Udi Wieder: Routing complexity of faulty networks. Random Struct. Algorithms 32(1): 71-87 (2008)
2007
13EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder: Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24
12EEUdi Wieder: Balanced allocations with heterogenous bins. SPAA 2007: 188-193
11EEKunal Talwar, Udi Wieder: Balanced allocations: the weighted case. STOC 2007: 256-265
10EEMoni Naor, Udi Wieder: Novel architectures for P2P applications: The continuous-discrete approach. ACM Transactions on Algorithms 3(3): (2007)
2005
9EEOmer Angel, Itai Benjamini, Eran Ofek, Udi Wieder: Routing complexity of faulty networks. PODC 2005: 209-217
8EEJames Aspnes, Udi Wieder: The expansion and mixing time of skip graphs with applications. SPAA 2005: 126-134
7EEMoni Naor, Udi Wieder: Scalable and dynamic quorum systems. Distributed Computing 17(4): 311-322 (2005)
2004
6EEMoni Naor, Udi Wieder: Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. IPTPS 2004: 269-277
5EEGurmeet Singh Manku, Moni Naor, Udi Wieder: Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. STOC 2004: 54-63
2003
4EEMoni Naor, Udi Wieder: A Simple Fault Tolerant Distributed Hash Table. IPTPS 2003: 88-97
3EEMoni Naor, Udi Wieder: Scalable and dynamic quorum systems. PODC 2003: 114-122
2EEMoni Naor, Udi Wieder: Novel architectures for P2P applications: the continuous-discrete approach. SPAA 2003: 50-59
2002
1EEUriel Feige, Eran Ofek, Udi Wieder: Approximating Maximum Edge Coloring in Multigraphs. APPROX 2002: 108-121

Coauthor Index

1Ittai Abraham [13]
2Omer Angel [9] [14]
3James Aspnes [8] [20]
4Itai Benjamini [9] [14]
5Jon Currey [21]
6Uriel Feige [1]
7Cyril Gavoille [13]
8Andrew Goldberg [21]
9Thomas Holenstein [15]
10Michael Isard [21]
11Adam Kirsch [18]
12John MacCormick [19]
13Dahlia Malkhi (Dalia Malki) [13] [22]
14Gurmeet Singh Manku [5]
15Michael Mitzenmacher [15] [18]
16Nicholas Murphy [19]
17Moni Naor [2] [3] [4] [5] [6] [7] [10] [16]
18Eran Ofek [1] [9] [14]
19Rina Panigrahy [15] [17]
20Vijayan Prabhakaran [21]
21Venugopalan Ramasubramanian [19]
22Gil Segev [16]
23Siddhartha Sen [22]
24Kunal Talwar [11] [17] [21] [22]
25Renato Fonseca F. Werneck [22]
26Junfeng Yang [19]
27Lidong Zhou [19]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)