Udi Wieder
Udi Wieder
VMware Research
Verified email at vmware.com
TitleCited byYear
Quincy: fair scheduling for distributed computing clusters
M Isard, V Prabhakaran, J Currey, U Wieder, K Talwar, A Goldberg
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles …, 2009
8692009
Novel architectures for P2P applications: the continuous-discrete approach
M Naor, U Wieder
ACM Transactions on Algorithms (TALG) 3 (3), 34, 2007
3862007
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
GS Manku, M Naor, U Wieder
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
2482004
Heuristics for vector bin packing
R Panigrahy, K Talwar, L Uyeda, U Wieder
research. microsoft. com, 2011
1662011
A simple fault tolerant distributed hash table
M Naor, U Wieder
International Workshop on Peer-to-Peer Systems, 88-97, 2003
1592003
Validating heuristics for virtual machines consolidation
S Lee, R Panigrahy, V Prabhakaran, V Ramasubramanian, K Talwar, ...
Microsoft Research, MSR-TR-2011-9, 1-14, 2011
1322011
More robust hashing: Cuckoo hashing with a stash
A Kirsch, M Mitzenmacher, U Wieder
SIAM Journal on Computing 39 (4), 1543-1561, 2009
892009
Scheduling ready tasks by generating network flow graph using information receive from root task having affinities between ready task and computers for execution
M Isard, V Prabhakaran, JJ Currey, E Wieder, K Talwar
US Patent 8,332,862, 2012
812012
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
M Naor, U Wieder
International Workshop on Peer-to-Peer Systems, 269-277, 2004
782004
Scalable and dynamic quorum systems
M Naor, U Wieder
Distributed Computing 17 (4), 311-322, 2005
722005
Maintaining privacy during user profiling
N Nice, E Wieder, B Feldbaum, S Ophir, E Shamir, Y Yacobi, A Friedman
US Patent 8,520,842, 2013
632013
Graphical balanced allocations and the (1+ β)‐choice process
Y Peres, K Talwar, U Wieder
Random Structures & Algorithms 47 (4), 760-775, 2015
58*2015
Lower bounds on near neighbor search via metric expansion
R Panigrahy, K Talwar, U Wieder
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 805-814, 2010
562010
More robust hashing: Cuckoo hashing with a stash
A Kirsch, M Mitzenmacher, U Wieder
European Symposium on Algorithms, 611-622, 2008
522008
Balanced allocations: the weighted case
K Talwar, U Wieder
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
522007
Maintaining privacy during personalized content delivery
N Nice, E Wieder, A Friedman
US Patent App. 10/284,679, 2019
452019
Kinesis: A new approach to replica placement in distributed storage systems
J MacCormick, N Murphy, V Ramasubramanian, U Wieder, J Yang, ...
ACM Transactions On Storage (TOS) 4 (4), 11, 2009
442009
The expansion and mixing time of skip graphs with applications
J Aspnes, U Wieder
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
422005
A geometric approach to lower bounds for approximate near-neighbor search and partial match
R Panigrahy, K Talwar, U Wieder
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 414-423, 2008
402008
Trace reconstruction with constant deletion probability and related results
T Holenstein, M Mitzenmacher, R Panigrahy, U Wieder
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
402008
The system can't perform the operation now. Try again later.
Articles 1–20