default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWennan Zhu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Christopher Liaw
, Aranyak Mehta, Wennan Zhu:
Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints. WWW 2024: 223-234- [i10]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - 2023
- [c7]Yuhan Liu, Ananda Theertha Suresh, Wennan Zhu, Peter Kairouz, Marco Gruteser:
Algorithms for bounding contribution for histogram estimation under user-level privacy. ICML 2023: 21969-21996 - [c6]Jingfeng Wu, Wennan Zhu, Peter Kairouz, Vladimir Braverman:
Private Federated Frequency Estimation: Adapting to the Hardness of the Instance. NeurIPS 2023 - [i9]Jingfeng Wu, Wennan Zhu, Peter Kairouz, Vladimir Braverman:
Private Federated Frequency Estimation: Adapting to the Hardness of the Instance. CoRR abs/2306.09396 (2023) - [i8]Christopher Liaw, Aranyak Mehta, Wennan Zhu:
Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints. CoRR abs/2310.09271 (2023) - 2022
- [i7]Yuhan Liu, Ananda Theertha Suresh, Wennan Zhu, Peter Kairouz, Marco Gruteser:
Histogram Estimation under User-level Privacy with Heterogeneous Data. CoRR abs/2206.03008 (2022) - 2021
- [j3]Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions. ACM Trans. Economics and Comput. 9(2): 9:1-9:24 (2021) - [c5]Elliot Anshelevich, Wennan Zhu:
Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs). AAAI 2021: 5094-5101 - [i6]Jianyu Wang, Zachary Charles, Zheng Xu, Gauri Joshi, H. Brendan McMahan, Blaise Agüera y Arcas, Maruan Al-Shedivat, Galen Andrew, Salman Avestimehr, Katharine Daly, Deepesh Data, Suhas N. Diggavi, Hubert Eichner, Advait Gadhikar, Zachary Garrett, Antonious M. Girgis, Filip Hanzely, Andrew Hard, Chaoyang He, Samuel Horváth, Zhouyuan Huo, Alex Ingerman, Martin Jaggi, Tara Javidi, Peter Kairouz, Satyen Kale, Sai Praneeth Karimireddy, Jakub Konecný, Sanmi Koyejo, Tian Li, Luyang Liu, Mehryar Mohri, Hang Qi, Sashank J. Reddi, Peter Richtárik, Karan Singhal, Virginia Smith, Mahdi Soltanolkotabi, Weikang Song, Ananda Theertha Suresh, Sebastian U. Stich, Ameet Talwalkar, Hongyi Wang, Blake E. Woodworth, Shanshan Wu, Felix X. Yu, Honglin Yuan, Manzil Zaheer, Mi Zhang, Tong Zhang, Chunxiang Zheng, Chen Zhu, Wennan Zhu:
A Field Guide to Federated Optimization. CoRR abs/2107.06917 (2021) - 2020
- [b1]Wennan Zhu:
Matching, social welfare and ordinal approximation. Rensselaer Polytechnic Institute, USA, 2020 - [c4]Wennan Zhu, Peter Kairouz, Brendan McMahan, Haicheng Sun, Wei Li:
Federated Heavy Hitters Discovery with Differential Privacy. AISTATS 2020: 3837-3847 - [i5]Elliot Anshelevich, Wennan Zhu:
Forming better stable solutions in Group Formation Games inspired by Internet Exchange Points (IXPs). CoRR abs/2008.12235 (2020)
2010 – 2019
- 2019
- [j2]Shigeru Imai, Sida Chen, Wennan Zhu, Carlos A. Varela:
Dynamic data-driven learning for self-healing avionics. Clust. Comput. 22(Suppl 1): 2187-2210 (2019) - [j1]Elliot Anshelevich, Wennan Zhu:
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. Theory Comput. Syst. 63(7): 1499-1530 (2019) - [c3]Ben Abramowitz, Elliot Anshelevich, Wennan Zhu:
Awareness of Voter Passion Greatly Improves the Distortion of Metric Social Choice. WINE 2019: 3-16 - [i4]Wennan Zhu, Peter Kairouz, Haicheng Sun, Brendan McMahan, Wei Li:
Federated Heavy Hitters Discovery with Differential Privacy. CoRR abs/1902.08534 (2019) - [i3]Ben Abramowitz, Elliot Anshelevich, Wennan Zhu:
Awareness of Voter Passion Greatly Improves the Distortion of Metric Social Choice. CoRR abs/1906.10562 (2019) - 2018
- [c2]Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions. WINE 2018: 3-20 - [p1]Sida Chen, Shigeru Imai, Wennan Zhu, Carlos A. Varela:
Towards Learning Spatio-Temporal Data Stream Relationships for Failure Detection in Avionics. Handbook of Dynamic Data Driven Applications Systems 2018: 97-121 - [i2]Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems given Candidate Positions. CoRR abs/1805.03103 (2018) - 2017
- [c1]Elliot Anshelevich, Wennan Zhu:
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. SAGT 2017: 267-279 - [i1]Elliot Anshelevich, Wennan Zhu:
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. CoRR abs/1707.01608 (2017)
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-09-25 00:45 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:
