Wenzheng Li
I am a final-year Ph.D. student at Stanford, and I am very fortunate to be advised by Prof. Jan Vondrak. Prior to that, I did my undergrad at Yao Class, Tsinghua University.
I am generally interested in theoretical computer science and have been primarily focusing on discrete optimization and approximation algorithms. My research are often around three fundamental objects in this area: matroid, matching and submodular functions. Most recently I am working on maximizing Nash Social Welfare with various class of valuation functions. [CV]
Email: wzli [at] stanford [dot] edu
Publications
A constant factor approximation algorithm for Nash Social Welfare with subadditive valuations
Sharhar Dobzinski, Wenzheng Li, Aviad Rubinstein, Jan Vondrak
STOC 24 [Arxiv]
Approximating Nash Social Welfare by matching and local search
Jugal Garg, Edin Husic, Wenzheng Li, Laszlo A. Vegh, Jan Vondrak
STOC 23 [arXiv]
A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations
Wenzheng Li, Jan Vondrak
FOCS 21 [arXiv]
Estimating the Nash Social Welfare for coverage and other submodular valuations
Wenzheng Li, Jan Vondrak
SODA 21 [arXiv]
A polynomial lower bound on adaptive complexity of submodular maximization
Wenzheng Li, Paul Liu, Jan Vondrak
STOC 20 [arXiv]
The Energy Complexity of Broadcast
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie
PODC 18 [arXiv]
An Optimal Distributed (Delta+1)-Coloring Algorithm?
Yi-Jun Chang, Wenzheng Li, Seth Pettie
STOC 18 [arXiv]
The Complexity of Distributed Edge Coloring with Small Palette Size
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto
SODA 18 [arXiv]
Professional Service:
Conference reviewing: ICALP, FOCS, STOC, SODA, ITCS
Teaching:
Course Assistant for the following courses at Stanford:
CS 103: Mathematical Foundations of Computing (Spring 2020, Fall 2020, Winter 2021)
CS 261: Optimization and Algorithmic Paradigms (Spring 2022)
CS 161: Design and Analysis of Algorithms (Spring 2023, Fall 2023)