Approximating Maximum Edge Coloring in Multigraphs. - Uriel Feige; Eran Ofek; Udi Wieder (APPROX, 2002)

A Simple Fault Tolerant Distributed Hash Table. - Moni Naor; Udi Wieder (IPTPS, 2003)

Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. - Moni Naor; Udi Wieder (IPTPS, 2004)

Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. - Gurmeet Singh Manku; Moni Naor; Udi Wieder (STOC, 2004)

Scalable and dynamic quorum systems. - Moni Naor; Udi Wieder (Distributed Comput., 2005)

Balanced allocations with heterogenous bins. - Udi Wieder (SPAA, 2007)

Balanced allocations: the weighted case. - Kunal Talwar; Udi Wieder (STOC, 2007)

Novel architectures for P2P applications: The continuous-discrete approach. - Moni Naor; Udi Wieder (ACM Trans. Algorithms, 2007)

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. - Rina Panigrahy; Kunal Talwar; Udi Wieder (FOCS, 2008)

Trace reconstruction with constant deletion probability and related results. - Thomas Holenstein; Michael Mitzenmacher; Rina Panigrahy; Udi Wieder (SODA, 2008)

History-Independent Cuckoo Hashing. - Moni Naor; Gil Segev 001; Udi Wieder (IACR Cryptol. ePrint Arch., 2008)

Routing complexity of faulty networks. - Omer Angel; Itai Benjamini; Eran Ofek; Udi Wieder (Random Struct. Algorithms, 2008)

Quincy: fair scheduling for distributed computing clusters. - Michael Isard; Vijayan Prabhakaran; Jon Currey; Udi Wieder; Kunal Talwar; Andrew V. Goldberg (SOSP, 2009)

Virtual Ring Routing Trends. - Dahlia Malkhi; Siddhartha Sen 001; Kunal Talwar; Renato Fonseca F. Werneck; Udi Wieder (DISC, 2009)

The expansion and mixing time of skip graphs with applications. - James Aspnes; Udi Wieder (Distributed Comput., 2009)

More Robust Hashing: Cuckoo Hashing with a Stash. - Adam Kirsch; Michael Mitzenmacher; Udi Wieder (SIAM J. Comput., 2009)

Kinesis: A new approach to replica placement in distributed storage systems. - John MacCormick; Nicholas Murphy; Venugopalan Ramasubramanian; Udi Wieder; Junfeng Yang; Lidong Zhou (ACM Trans. Storage, 2009)

Lower Bounds on Near Neighbor Search via Metric Expansion. - Rina Panigrahy; Kunal Talwar; Udi Wieder (FOCS, 2010)

The (1 + beta)-Choice Process and Weighted Balls-into-Bins. - Yuval Peres; Kunal Talwar; Udi Wieder (SODA, 2010)

Strong-Diameter Decompositions of Minor Free Graphs. - Ittai Abraham; Cyril Gavoille; Dahlia Malkhi; Udi Wieder (Theory Comput. Syst., 2010)

How to Approximate a Set without Knowing Its Size in Advance. - Rasmus Pagh; Gil Segev 001; Udi Wieder (FOCS, 2013)

Minimum Makespan Scheduling with Low Rank Processing Times. - Aditya Bhaskara; Ravishankar Krishnaswamy; Kunal Talwar; Udi Wieder (SODA, 2013)

Balls and Bins: Smaller Hash Families and Faster Evaluation. - L. Elisa Celis; Omer Reingold; Gil Segev 001; Udi Wieder (SIAM J. Comput., 2013)

Changing Bases: Multistage Optimization for Matroids and Matchings. - Anupam Gupta 001; Kunal Talwar; Udi Wieder (ICALP (1), 2014)

Pseudorandom Graphs in Data Structures. - Omer Reingold; Ron D. Rothblum; Udi Wieder (ICALP (1), 2014)

Balanced Allocations: A Simple Proof for the Heavily Loaded Case. - Kunal Talwar; Udi Wieder (ICALP (1), 2014)

Approximate Nearest Neighbor Search in Metrics of Planar Graphs. - Ittai Abraham; Shiri Chechik; Robert Krauthgamer; Udi Wieder (APPROX-RANDOM, 2015)

Graphical balanced allocations and the (1 + β)-choice process. - Yuval Peres; Kunal Talwar; Udi Wieder (Random Struct. Algorithms, 2015)

Silver: A Scalable, Distributed, Multi-versioning, Always Growing (Ag) File System. - Michael Wei; Christopher J. Rossbach; Ittai Abraham; Udi Wieder; Steven Swanson; Dahlia Malkhi; Amy Tai (HotStorage, 2016)

A sampling-based approach to accelerating queries in log management systems. - Tal Wagner; Eric Schkufza; Udi Wieder (SPLASH (Companion Volume), 2016)

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 (NSDI, 2017)

Hashing, Load Balancing and Multiple Choice. - Udi Wieder (Found. Trends Theor. Comput. Sci., 2017)

Efficient Anomaly Detection via Matrix Sketching. - Vatsal Sharan; Parikshit Gopalan; Udi Wieder (NeurIPS, 2018)

Faster Anomaly Detection via Matrix Sketching. - Parikshit Gopalan; Vatsal Sharan; Udi Wieder (CoRR, 2018)

Another Proof of Cuckoo hashing with New Variants. - Udi Wieder (CoRR, 2018)

Efficient Circuit-based PSI via Cuckoo Hashing. - Benny Pinkas; Thomas Schneider 003; Christian Weinert; Udi Wieder (IACR Cryptol. ePrint Arch., 2018)

PIDForest: Anomaly Detection via Partial Identification. - Parikshit Gopalan; Vatsal Sharan; Udi Wieder (NeurIPS, 2019)

Hillview: A trillion-cell spreadsheet for big data. - Mihai Budiu; Parikshit Gopalan; Lalith Suresh 001; Udi Wieder; Han Kruiger; Marcos K. Aguilera (Proc. VLDB Endow., 2019)

Finding Skewed Subcubes Under a Distribution. - Parikshit Gopalan; Roie Levin; Udi Wieder (ITCS, 2020)

Multicalibrated Partitions for Importance Weights. - Parikshit Gopalan; Omer Reingold; Vatsal Sharan; Udi Wieder (ALT, 2022)

Omnipredictors. - Parikshit Gopalan; Adam Tauman Kalai; Omer Reingold; Vatsal Sharan; Udi Wieder (ITCS, 2022)

KL Divergence Estimation with Multi-group Attribution. - Parikshit Gopalan; Nina Narodytska; Omer Reingold; Vatsal Sharan; Udi Wieder (CoRR, 2022)

Overlook: Differentially Private Exploratory Visualization for Big Data. - Mihai Budiu; Pratiksha Thaker; Parikshit Gopalan; Udi Wieder; Matei Zaharia (J. Priv. Confidentiality, 2022)

Loss Minimization Through the Lens Of Outcome Indistinguishability. - Parikshit Gopalan; Lunjia Hu; Michael P. Kim; Omer Reingold; Udi Wieder (ITCS, 2023)

When Does a Predictor Know Its Own Loss? - Aravind Gollakota; Parikshit Gopalan; Aayush Karan; Charlotte Peale; Udi Wieder (FORC, 2025)

Provable Uncertainty Decomposition via Higher-Order Calibration. - Gustaf Ahdritz; Aravind Gollakota; Parikshit Gopalan; Charlotte Peale; Udi Wieder (ICLR, 2025)