Udi Wieder
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 at 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.
Conference Publications
- Laura Elisa Celis, Omer Reingold, Gil Segev, and Udi Wieder, Balls and Bins: Smaller Hash Families and Faster Evaluation, in FOCS, IEEE, 2011
- Rina Panigrahy, Kunal Talwar, and Udi Wieder, Lower Bounds on Near Neighbor Search via Metric Expansion, in FOCS , IEEE Computer Society, October 2010
- Yuval Peres, Kunal Talwar, and Udi Wieder, The (1+beta)-Choice Process and Weighted Balls into Bins, in SODA, Society for Industrial and Applied Mathematics, January 2010
- Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, and Andrew Goldberg, Quincy: Fair Scheduling for Distributed Computing Clusters, in Proceedings of 22nd ACM Symposium on Operating Systems Principles, Association for Computing Machinery, Inc., 11 October 2009
- Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Werneck, and Udi Wieder, Virtual Ring Routing Trends, in DISC 2009, Springer Verlag, 23 September 2009
- Rina Panigrahy, Kunal Talwar, and Udi Wieder, A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match, in FOCS '08: Proceedings of the 49th annual IEEE Symposium on Foundations of Computer Science, IEEE, October 2008
- Adam Kirsch, Michael Mitzenmacher, and Udi Wieder, More Robust Hashing: Cuckoo Hashing with a Stash, in ESA '08: Proceedings of the 16th annual European symposium on Algorithms, Springer-Verlag, Berlin, Heidelberg, September 2008
- Moni Naor, Gil Segev, and Udi Wieder, History-Independent Cuckoo Hashing, in ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, Springer-Verlag, Berlin, Heidelberg, July 2008
- Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, and Udi Wieder, Trace reconstruction with constant deletion probability and related results, in ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, January 2008
- Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder, Strong-diameter decompositions of minor free graphs, in ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM, San Diego, California, June 2007
- Kunal Talwar and Udi Wieder, Balanced Allocations: The Weighted Case, in ACM Symposium on Theory of Computing (STOC), Association for Computing Machinery, Inc., San Diego, CA, June 2007
- Udi Wieder, Balanced Allocations with Heterogeneous Bins, in SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, ACM, New York, NY, USA, 2007
- James Aspnes and Udi Wieder, The expansion and mixing time of skip graphs with applications, in SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, ACM, New York, NY, USA, 2005
- Omer Angel, Itai Benjamini, Eran Ofek, and Udi Wieder, Routing complexity of faulty networks, in PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, ACM, New York, NY, USA, 2005
- Gurmeet Singh Manku, Moni Naor, and Udi Wieder, Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks, in STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, ACM, New York, NY, USA, 2004
- Moni Naor and Udi Wieder, Novel architectures for P2P applications: the continuous-discrete approach, in SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, ACM, New York, NY, USA, 2003
- Moni Naor and Udi Wieder, Scalable and dynamic quorum systems, in PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, ACM, New York, NY, USA, 2003
- Moni Naor and Udi Wieder, A Simple Fault-Toulerant Distributed Hash Table, in IPTPS, 2003
- Uriel Feige, Eran Ofek, and Udi Wieder, Approximating Maximum Edge Coloring in Multigraphs, in APPROX '02: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, Springer-Verlag, London, UK, 2002
Journal Publications
- Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder, Strong-Diameter Decompositions of Minor Free Graphs, in Theory of Computing Systems, 2009
- Adam Kirsch, Michael Mitzenmacher, and Udi Wieder, More Robust Hashing: Cuckoo Hashing with a Stash, in Siam Journal Computing, Society for Industrial and Applied Mathematics, 2009
- James Aspnes and Udi Wieder, The expansion and mixing time of skip graphs with applications, in Distributed Computing, Springer Verlag, 2008
- Omer Angel, Itai Benjamini, Eran Ofek, and Udi Wieder, Routing complexity of faulty networks, in Random Struct. Algorithms, vol. 32, no. 1, pp. 71–87, John Wiley & Sons, Inc., New York, NY, USA, 2008
- John MacCormick, Nick Murphy, Venugopalan Ramasubramanian, Udi Wieder, Junfeng Yang, and Lidong Zhou, Kinesis: A New Approach to Replica Placement in Distributed Storage Systems, in Transactions on Storage, 2008
- Moni Naor and Udi Wieder, Novel architectures for P2P applications: The continuous-discrete approach, in ACM Trans. Algorithms, vol. 3, no. 3, pp. 34, ACM, New York, NY, USA, August 2007
- Moni Naor and Udi Wieder, Scalable and dynamic quorum systems, in Distrib. Comput., vol. 17, no. 4, pp. 311–322, Springer-Verlag, London, UK, 2005
Manuscripts
- Sangmin Lee, Rina Panigrahy, Vijayan Prabhakaran, Venugopalan Ramasubramanian, Kunal Talwar, Lincoln Uyeda, and Udi Wieder, Validating Heuristics for Virtual Machines Consolidation, no. MSR-TR-2011-9, January 2011
- Rina Panigrahy, Kunal Talwar, Lincoln Uyeda, and Udi Wieder, Heuristics for Vector Bin Packing, 2011
