Udi Wieder

According to our database, Udi Wieder authored at least 44 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Loss Minimization Through the Lens Of Outcome Indistinguishability.

Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Overlook: Differentially Private Exploratory Visualization for Big Data.

Mihai Budiu, Pratiksha Thaker, Parikshit Gopalan, Udi Wieder, Matei Zaharia

J. Priv. Confidentiality, 2022

KL Divergence Estimation with Multi-group Attribution.

Parikshit Gopalan, Nina Narodytska, Omer Reingold, Vatsal Sharan, Udi Wieder

CoRR, 2022

Omnipredictors.

Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Multicalibrated Partitions for Importance Weights.

Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2020

Finding Skewed Subcubes Under a Distribution.

Parikshit Gopalan, Roie Levin, Udi Wieder

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Hillview: A trillion-cell spreadsheet for big data.

Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera

Proc. VLDB Endow., 2019

PIDForest: Anomaly Detection via Partial Identification.

Parikshit Gopalan, Vatsal Sharan, Udi Wieder

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Efficient Circuit-based PSI via Cuckoo Hashing.

Benny Pinkas, Thomas Schneider, Christian Weinert, Udi Wieder

IACR Cryptol. ePrint Arch., 2018

Another Proof of Cuckoo hashing with New Variants.

Udi Wieder

CoRR, 2018

Faster Anomaly Detection via Matrix Sketching.

Parikshit Gopalan, Vatsal Sharan, Udi Wieder

CoRR, 2018

Efficient Anomaly Detection via Matrix Sketching.

Vatsal Sharan, Parikshit Gopalan, Udi Wieder

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

Hashing, Load Balancing and Multiple Choice.

Udi Wieder

Found. Trends Theor. Comput. Sci., 2017

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

Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017

2016

A sampling-based approach to accelerating queries in log management systems.

Tal Wagner, Eric Schkufza, Udi Wieder

Proceedings of the Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, 2016

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

Proceedings of the 8th USENIX Workshop on Hot Topics in Storage and File Systems, 2016

2015

Graphical balanced allocations and the (1 + β)-choice process.

Yuval Peres, Kunal Talwar, Udi Wieder

Random Struct. Algorithms, 2015

Approximate Nearest Neighbor Search in Metrics of Planar Graphs.

Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder

Proceedings of the Approximation, 2015

2014

Balanced Allocations: A Simple Proof for the Heavily Loaded Case.

Kunal Talwar, Udi Wieder

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Pseudorandom Graphs in Data Structures.

Omer Reingold, Ron D. Rothblum, Udi Wieder

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Changing Bases: Multistage Optimization for Matroids and Matchings.

Anupam Gupta, Kunal Talwar, Udi Wieder

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Minimum Makespan Scheduling with Low Rank Processing Times.

Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

How to Approximate a Set without Knowing Its Size in Advance.

Rasmus Pagh, Gil Segev, Udi Wieder

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2011

Balls and Bins: Smaller Hash Families and Faster Evaluation.

L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder

Electron. Colloquium Comput. Complex., 2011

2010

Strong-Diameter Decompositions of Minor Free Graphs.

Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder

Theory Comput. Syst., 2010

The (1 + beta)-Choice Process and Weighted Balls-into-Bins.

Yuval Peres, Kunal Talwar, Udi Wieder

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Lower Bounds on Near Neighbor Search via Metric Expansion.

Rina Panigrahy, Kunal Talwar, Udi Wieder

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

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

More Robust Hashing: Cuckoo Hashing with a Stash.

Adam Kirsch, Michael Mitzenmacher, Udi Wieder

SIAM J. Comput., 2009

The expansion and mixing time of skip graphs with applications.

James Aspnes, Udi Wieder

Distributed Comput., 2009

Virtual Ring Routing Trends.

Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Quincy: fair scheduling for distributed computing clusters.

Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg

Proceedings of the 22nd ACM Symposium on Operating Systems Principles 2009, 2009

2008

Routing complexity of faulty networks.

Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder

Random Struct. Algorithms, 2008

History-Independent Cuckoo Hashing.

Moni Naor, Gil Segev, Udi Wieder

IACR Cryptol. ePrint Arch., 2008

Trace reconstruction with constant deletion probability and related results.

Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.

Rina Panigrahy, Kunal Talwar, Udi Wieder

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Novel architectures for P2P applications: The continuous-discrete approach.

Moni Naor, Udi Wieder

ACM Trans. Algorithms, 2007

Balanced allocations: the weighted case.

Kunal Talwar, Udi Wieder

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Balanced allocations with heterogenous bins.

Udi Wieder

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2005

Scalable and dynamic quorum systems.

Moni Naor, Udi Wieder

Distributed Comput., 2005

2004

Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks.

Gurmeet Singh Manku, Moni Naor, Udi Wieder

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds.

Moni Naor, Udi Wieder

Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

2003

A Simple Fault Tolerant Distributed Hash Table.

Moni Naor, Udi Wieder

Proceedings of the Peer-to-Peer Systems II, Second International Workshop, 2003

2002

Approximating Maximum Edge Coloring in Multigraphs.

Uriel Feige, Eran Ofek, Udi Wieder

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002