| 2025 | ICLR | Provable Uncertainty Decomposition via Higher-Order Calibration. | Gustaf Ahdritz, Aravind Gollakota, Parikshit Gopalan, Charlotte Peale, Udi Wieder |
| 2022 | ALT | Multicalibrated Partitions for Importance Weights. | Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder |
| 2018 | EuroCrypt | Efficient Circuit-Based PSI via Cuckoo Hashing. | Benny Pinkas, Thomas Schneider, Christian Weinert, Udi Wieder |
| 2017 | NSDI | vCorfu: A Cloud-Scale Object Store on a Shared Log. | Michael Wei, Amy Tai, Christopher J. Rossbach, Ittai Abraham, Maithem Munshed, Medhavi Dhawan, Jim Stabile, Udi Wieder, Scott Fritchie, Steven Swanson, Michael J. Freedman, Dahlia Malkhi |
| 2016 | OOPSLA | A sampling-based approach to accelerating queries in log management systems. | Tal Wagner, Eric Schkufza, Udi Wieder |
| 2014 | ICALP | Changing Bases: Multistage Optimization for Matroids and Matchings. | Anupam Gupta, Kunal Talwar, Udi Wieder |
| 2014 | ICALP | Pseudorandom Graphs in Data Structures. | Omer Reingold, Ron D. Rothblum, Udi Wieder |
| 2014 | ICALP | Balanced Allocations: A Simple Proof for the Heavily Loaded Case. | Kunal Talwar, Udi Wieder |
| 2013 | FOCS | How to Approximate a Set without Knowing Its Size in Advance. | Rasmus Pagh, Gil Segev, Udi Wieder |
| 2013 | SODA | Minimum Makespan Scheduling with Low Rank Processing Times. | Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder |
| 2011 | FOCS | Balls and Bins: Smaller Hash Families and Faster Evaluation. | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
| 2010 | FOCS | Lower Bounds on Near Neighbor Search via Metric Expansion. | Rina Panigrahy, Kunal Talwar, Udi Wieder |
| 2010 | SODA | The (1 + beta)-Choice Process and Weighted Balls-into-Bins. | Yuval Peres, Kunal Talwar, Udi Wieder |
| 2009 | SOSP | Quincy: fair scheduling for distributed computing clusters. | Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg |
| 2008 | ESA | More Robust Hashing: Cuckoo Hashing with a Stash. | Adam Kirsch, Michael Mitzenmacher, Udi Wieder |
| 2008 | FOCS | A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. | Rina Panigrahy, Kunal Talwar, Udi Wieder |
| 2008 | ICALP | History-Independent Cuckoo Hashing. | Moni Naor, Gil Segev, Udi Wieder |
| 2008 | SODA | Trace reconstruction with constant deletion probability and related results. | Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder |
| 2007 | STOC | Balanced allocations: the weighted case. | Kunal Talwar, Udi Wieder |
| 2007 | SPAA | Strong-diameter decompositions of minor free graphs. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder |
| 2007 | SPAA | Balanced allocations with heterogenous bins. | Udi Wieder |
| 2005 | PODC | Routing complexity of faulty networks. | Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder |
| 2005 | SPAA | The expansion and mixing time of skip graphs with applications. | James Aspnes, Udi Wieder |
| 2004 | STOC | Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. | Gurmeet Singh Manku, Moni Naor, Udi Wieder |
| 2003 | PODC | Scalable and dynamic quorum systems. | Moni Naor, Udi Wieder |
| 2003 | SPAA | Novel architectures for P2P applications: the continuous-discrete approach. | Moni Naor, Udi Wieder |