Udi Wieder - RankMe

70 papers A* 15A 5B 5Misc 1Journal 32Unranked 12

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