default search action
Udi Wieder
Person information
- affiliation: Weizmann Institute of Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c36]Parikshit Gopalan, Lunjia Hu
, Michael P. Kim, Omer Reingold, Udi Wieder:
Loss Minimization Through the Lens Of Outcome Indistinguishability. ITCS 2023: 60:1-60:20 - 2022
- [j12]Mihai Budiu, Pratiksha Thaker
Overlook: Differentially Private Exploratory Visualization for Big Data. J. Priv. Confidentiality 12(1) (2022) - [c35]Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder:
Multicalibrated Partitions for Importance Weights. ALT 2022: 408-435 - [c34]Parikshit Gopalan, Adam Tauman Kalai
Omnipredictors. ITCS 2022: 79:1-79:21 - [i17]Parikshit Gopalan, Nina Narodytska, Omer Reingold, Vatsal Sharan, Udi Wieder:
KL Divergence Estimation with Multi-group Attribution. CoRR abs/2202.13576 (2022) - [i16]Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder:
Loss Minimization through the Lens of Outcome Indistinguishability. CoRR abs/2210.08649 (2022) - 2021
- [i15]Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder:
Multicalibrated Partitions for Importance Weights. CoRR abs/2103.05853 (2021) - [i14]Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder:
Omnipredictors. CoRR abs/2109.05389 (2021) - 2020
- [c33]Parikshit Gopalan, Roie Levin, Udi Wieder:
Finding Skewed Subcubes Under a Distribution. ITCS 2020: 84:1-84:30 - [i13]Pratiksha Thaker, Mihai Budiu, Parikshit Gopalan, Udi Wieder, Matei Zaharia:
Overlook: Differentially Private Exploratory Visualization for Big Data. CoRR abs/2006.12018 (2020)
2010 – 2019
- 2019
- [j11]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): 1442-1457 (2019) - [c32]Parikshit Gopalan, Vatsal Sharan, Udi Wieder:
PIDForest: Anomaly Detection via Partial Identification. NeurIPS 2019: 15783-15793 - [i12]Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera:
Hillview: A trillion-cell spreadsheet for big data. CoRR abs/1907.04827 (2019) - [i11]Parikshit Gopalan, Roie Levin, Udi Wieder:
Finding Skewed Subcubes Under a Distribution. CoRR abs/1911.07378 (2019) - [i10]Parikshit Gopalan, Vatsal Sharan, Udi Wieder:
PIDForest: Anomaly Detection via Partial Identification. CoRR abs/1912.03582 (2019) - 2018
- [c31]Benny Pinkas, Thomas Schneider
Efficient Circuit-Based PSI via Cuckoo Hashing. EUROCRYPT (3) 2018: 125-157 - [c30]Vatsal Sharan, Parikshit Gopalan, Udi Wieder:
Efficient Anomaly Detection via Matrix Sketching. NeurIPS 2018: 8080-8091 - [i9]Parikshit Gopalan, Vatsal Sharan, Udi Wieder:
Faster Anomaly Detection via Matrix Sketching. CoRR abs/1804.03065 (2018) - [i8]Udi Wieder:
Another Proof of Cuckoo hashing with New Variants. CoRR abs/1806.02004 (2018) - [i7]Benny Pinkas, Thomas Schneider, Christian Weinert, Udi Wieder:
Efficient Circuit-based PSI via Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2018: 120 (2018) - 2017
- [j10]Udi Wieder:
Hashing, Load Balancing and Multiple Choice. Found. Trends Theor. Comput. Sci. 12(3-4): 275-379 (2017) - [c29]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: 35-49 - 2016
- [c28]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 - [c27]Tal Wagner, Eric Schkufza, Udi Wieder:
A sampling-based approach to accelerating queries in log management systems. SPLASH (Companion Volume) 2016: 37-38 - 2015
- [j9]Yuval Peres, Kunal Talwar, Udi Wieder:
Graphical balanced allocations and the (1 + β)-choice process. Random Struct. Algorithms 47(4): 760-775 (2015) - [c26]Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder:
Approximate Nearest Neighbor Search in Metrics of Planar Graphs. APPROX-RANDOM 2015: 20-42 - 2014
- [c25]Anupam Gupta, Kunal Talwar, Udi Wieder:
Changing Bases: Multistage Optimization for Matroids and Matchings. ICALP (1) 2014: 563-575 - [c24]Omer Reingold, Ron D. Rothblum, Udi Wieder:
Pseudorandom Graphs in Data Structures. ICALP (1) 2014: 943-954 - [c23]Kunal Talwar, Udi Wieder:
Balanced Allocations: A Simple Proof for the Heavily Loaded Case. ICALP (1) 2014: 979-990 - [i6]Anupam Gupta, Kunal Talwar, Udi Wieder:
Changing Bases: Multistage Optimization for Matroids and Matchings. CoRR abs/1404.3768 (2014) - 2013
- [j8]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. SIAM J. Comput. 42(3): 1030-1050 (2013) - [c22]Rasmus Pagh, Gil Segev, Udi Wieder:
How to Approximate a Set without Knowing Its Size in Advance. FOCS 2013: 80-89 - [c21]Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder:
Minimum Makespan Scheduling with Low Rank Processing Times. SODA 2013: 937-947 - [i5]Rasmus Pagh, Gil Segev, Udi Wieder:
How to Approximate A Set Without Knowing Its Size In Advance. CoRR abs/1304.1188 (2013) - [i4]Kunal Talwar, Udi Wieder:
Balanced Allocations: A Simple Proof for the Heavily Loaded Case. CoRR abs/1310.5367 (2013) - 2011
- [c20]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. FOCS 2011: 599-608 - [i3]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j7]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder:
Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput. Syst. 47(4): 837-855 (2010) - [c19]Rina Panigrahy, Kunal Talwar, Udi Wieder:
Lower Bounds on Near Neighbor Search via Metric Expansion. FOCS 2010: 805-814 - [c18]Yuval Peres, Kunal Talwar, Udi Wieder:
The (1 + beta)-Choice Process and Weighted Balls-into-Bins. SODA 2010: 1613-1619 - [i2]Rina Panigrahy, Kunal Talwar, Udi Wieder:
Lower Bounds on Near Neighbor Search via Metric Expansion. CoRR abs/1005.0418 (2010)
2000 – 2009
- 2009
- [j6]James Aspnes, Udi Wieder:
The expansion and mixing time of skip graphs with applications. Distributed Comput. 21(6): 385-393 (2009) - [j5]Adam Kirsch, Michael Mitzenmacher, Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash. SIAM J. Comput. 39(4): 1543-1561 (2009) - [j4]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): 11:1-11:28 (2009) - [c17]Michael Isard, Vijayan Prabhakaran, Jon Currey
Quincy: fair scheduling for distributed computing clusters. SOSP 2009: 261-276 - [c16]Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder:
Virtual Ring Routing Trends. DISC 2009: 392-406 - 2008
- [j3]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. Random Struct. Algorithms 32(1): 71-87 (2008) - [c15]Adam Kirsch, Michael Mitzenmacher, Udi Wieder:
More Robust Hashing: Cuckoo Hashing with a Stash. ESA 2008: 611-622 - [c14]Rina Panigrahy, Kunal Talwar, Udi Wieder:
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. FOCS 2008: 414-423 - [c13]Moni Naor, Gil Segev, Udi Wieder:
History-Independent Cuckoo Hashing. ICALP (2) 2008: 631-642 - [c12]Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder:
Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398 - [i1]Moni Naor, Gil Segev, Udi Wieder:
History-Independent Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2008: 358 (2008) - 2007
- [j2]Moni Naor, Udi Wieder:
Novel architectures for P2P applications: The continuous-discrete approach. ACM Trans. Algorithms 3(3): 34 (2007) - [c11]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder:
Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24 - [c10]Udi Wieder:
Balanced allocations with heterogenous bins. SPAA 2007: 188-193 - [c9]Kunal Talwar, Udi Wieder:
Balanced allocations: the weighted case. STOC 2007: 256-265 - 2005
- [j1]Moni Naor, Udi Wieder:
Scalable and dynamic quorum systems. Distributed Comput. 17(4): 311-322 (2005) - [c8]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. PODC 2005: 209-217 - [c7]James Aspnes, Udi Wieder:
The expansion and mixing time of skip graphs with applications. SPAA 2005: 126-134 - 2004
- [c6]Moni Naor, Udi Wieder:
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. IPTPS 2004: 269-277 - [c5]Gurmeet Singh Manku, Moni Naor, Udi Wieder:
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. STOC 2004: 54-63 - 2003
- [c4]Moni Naor, Udi Wieder:
A Simple Fault Tolerant Distributed Hash Table. IPTPS 2003: 88-97 - [c3]Moni Naor, Udi Wieder:
Scalable and dynamic quorum systems. PODC 2003: 114-122 - [c2]Moni Naor, Udi Wieder:
Novel architectures for P2P applications: the continuous-discrete approach. SPAA 2003: 50-59 - 2002
- [c1]Uriel Feige, Eran Ofek, Udi Wieder:
Approximating Maximum Edge Coloring in Multigraphs. APPROX 2002: 108-121
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: