Udi Wieder

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 24

Top Topics

Approximate Nearest Neighbor Search

Anomaly Detection

Top Venues

Publications

Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder
Loss Minimization Through the Lens Of Outcome Indistinguishability. ITCS (2023)
Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder
Loss Minimization through the Lens of Outcome Indistinguishability. CoRR (2022)
Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder
Multicalibrated Partitions for Importance Weights. ALT (2022)
Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder
Omnipredictors. ITCS (2022)
Mihai Budiu, Pratiksha Thaker, Parikshit Gopalan, Udi Wieder, Matei Zaharia
Overlook: Differentially Private Exploratory Visualization for Big Data. J. Priv. Confidentiality 12 (1) (2022)
Parikshit Gopalan, Nina Narodytska, Omer Reingold, Vatsal Sharan, Udi Wieder
KL Divergence Estimation with Multi-group Attribution. CoRR (2022)
Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder
Omnipredictors. CoRR (2021)
Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder
Multicalibrated Partitions for Importance Weights. CoRR (2021)
Parikshit Gopalan, Roie Levin, Udi Wieder
Finding Skewed Subcubes Under a Distribution. ITCS (2020)
Pratiksha Thaker, Mihai Budiu, Parikshit Gopalan, Udi Wieder, Matei Zaharia
Overlook: Differentially Private Exploratory Visualization for Big Data. CoRR (2020)
Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera
Hillview: A trillion-cell spreadsheet for big data. Proc. VLDB Endow. 12 (11) (2019)
Parikshit Gopalan, Vatsal Sharan, Udi Wieder
PIDForest: Anomaly Detection via Partial Identification. CoRR (2019)
Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera
Hillview: A trillion-cell spreadsheet for big data. CoRR (2019)
Parikshit Gopalan, Vatsal Sharan, Udi Wieder
PIDForest: Anomaly Detection via Partial Identification. NeurIPS (2019)
Parikshit Gopalan, Roie Levin, Udi Wieder
Finding Skewed Subcubes Under a Distribution. CoRR (2019)
Benny Pinkas, Thomas Schneider, Christian Weinert, Udi Wieder
Efficient Circuit-Based PSI via Cuckoo Hashing. EUROCRYPT (3) (2018)
Vatsal Sharan, Parikshit Gopalan, Udi Wieder
Efficient Anomaly Detection via Matrix Sketching. NeurIPS (2018)
Udi Wieder
Another Proof of Cuckoo hashing with New Variants. CoRR (2018)
Benny Pinkas, Thomas Schneider, Christian Weinert, Udi Wieder
Efficient Circuit-based PSI via Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2018 (2018)
Parikshit Gopalan, Vatsal Sharan, Udi Wieder
Faster Anomaly Detection via Matrix Sketching. CoRR (2018)
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
vCorfu: A Cloud-Scale Object Store on a Shared Log. NSDI (2017)
Udi Wieder
Hashing, Load Balancing and Multiple Choice. Found. Trends Theor. Comput. Sci. 12 (3-4) (2017)
Michael Wei, Christopher J. Rossbach, Ittai Abraham, Udi Wieder, Steven Swanson, Dahlia Malkhi, Amy Tai
Silver: A Scalable, Distributed, Multi-versioning, Always Growing (Ag) File System. HotStorage (2016)
Tal Wagner, Eric Schkufza, Udi Wieder
A sampling-based approach to accelerating queries in log management systems. SPLASH (Companion Volume) (2016)
Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder
Approximate Nearest Neighbor Search in Metrics of Planar Graphs. APPROX-RANDOM (2015)
Yuval Peres, Kunal Talwar, Udi Wieder
Graphical balanced allocations and the (1 + β)-choice process. Random Struct. Algorithms 47 (4) (2015)
Anupam Gupta, Kunal Talwar, Udi Wieder
Changing Bases: Multistage Optimization for Matroids and Matchings. ICALP (1) (2014)
Anupam Gupta, Kunal Talwar, Udi Wieder
Changing Bases: Multistage Optimization for Matroids and Matchings. CoRR (2014)
Kunal Talwar, Udi Wieder
Balanced Allocations: A Simple Proof for the Heavily Loaded Case. ICALP (1) (2014)
Omer Reingold, Ron D. Rothblum, Udi Wieder
Pseudorandom Graphs in Data Structures. ICALP (1) (2014)
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
Balls and Bins: Smaller Hash Families and Faster Evaluation. SIAM J. Comput. 42 (3) (2013)
Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder
Minimum Makespan Scheduling with Low Rank Processing Times. SODA (2013)
Kunal Talwar, Udi Wieder
Balanced Allocations: A Simple Proof for the Heavily Loaded Case. CoRR (2013)
Rasmus Pagh, Gil Segev, Udi Wieder
How to Approximate A Set Without Knowing Its Size In Advance CoRR (2013)
Rasmus Pagh, Gil Segev, Udi Wieder
How to Approximate a Set without Knowing Its Size in Advance. FOCS (2013)
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
Balls and Bins: Smaller Hash Families and Faster Evaluation. FOCS (2011)
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
Balls and Bins: Smaller Hash Families and Faster Evaluation. Electron. Colloquium Comput. Complex. 18 (2011)
Rina Panigrahy, Kunal Talwar, Udi Wieder
Lower Bounds on Near Neighbor Search via Metric Expansion. FOCS (2010)
Rina Panigrahy, Kunal Talwar, Udi Wieder
Lower Bounds on Near Neighbor Search via Metric Expansion CoRR (2010)
Yuval Peres, Kunal Talwar, Udi Wieder
The (1 + beta)-Choice Process and Weighted Balls-into-Bins. SODA (2010)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput. Syst. 47 (4) (2010)
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
More Robust Hashing: Cuckoo Hashing with a Stash. SIAM J. Comput. 39 (4) (2009)
Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder
Virtual Ring Routing Trends. DISC (2009)
Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg
Quincy: fair scheduling for distributed computing clusters. SOSP (2009)
James Aspnes, Udi Wieder
The expansion and mixing time of skip graphs with applications. Distributed Comput. 21 (6) (2009)
John MacCormick, Nicholas Murphy, Venugopalan Ramasubramanian, Udi Wieder, Junfeng Yang, Lidong Zhou
Kinesis: A new approach to replica placement in distributed storage systems. ACM Trans. Storage 4 (4) (2009)
Moni Naor, Gil Segev, Udi Wieder
History-Independent Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2008 (2008)
Moni Naor, Gil Segev, Udi Wieder
History-Independent Cuckoo Hashing. ICALP (2) (2008)
Rina Panigrahy, Kunal Talwar, Udi Wieder
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. FOCS (2008)
Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder
Trace reconstruction with constant deletion probability and related results. SODA (2008)
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
Routing complexity of faulty networks. Random Struct. Algorithms 32 (1) (2008)
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
More Robust Hashing: Cuckoo Hashing with a Stash. ESA (2008)
Kunal Talwar, Udi Wieder
Balanced allocations: the weighted case. STOC (2007)
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder
Strong-diameter decompositions of minor free graphs. SPAA (2007)
Udi Wieder
Balanced allocations with heterogenous bins. SPAA (2007)
Moni Naor, Udi Wieder
Novel architectures for P2P applications: The continuous-discrete approach. ACM Trans. Algorithms 3 (3) (2007)
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
Routing complexity of faulty networks. PODC (2005)
Moni Naor, Udi Wieder
Scalable and dynamic quorum systems. Distributed Comput. 17 (4) (2005)
James Aspnes, Udi Wieder
The expansion and mixing time of skip graphs with applications. SPAA (2005)
Moni Naor, Udi Wieder
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. IPTPS (2004)
Gurmeet Singh Manku, Moni Naor, Udi Wieder
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. STOC (2004)
Moni Naor, Udi Wieder
A Simple Fault Tolerant Distributed Hash Table. IPTPS (2003)
Moni Naor, Udi Wieder
Novel architectures for P2P applications: the continuous-discrete approach. SPAA (2003)
Moni Naor, Udi Wieder
Scalable and dynamic quorum systems. PODC (2003)
Uriel Feige, Eran Ofek, Udi Wieder
Approximating Maximum Edge Coloring in Multigraphs. APPROX (2002)