Wenzheng Li
Wenzheng Li
Graduate studetn, Stanford University
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
An optimal distributed (δ+ 1)-coloring algorithm?
YJ Chang, W Li, S Pettie
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
632018
The complexity of distributed edge coloring with small palettes
YJ Chang, Q He, W Li, S Pettie, J Uitto
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
392018
The energy complexity of broadcast
YJ Chang, V Dani, TP Hayes, Q He, W Li, S Pettie
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
192018
Distributed edge coloring and a special case of the constructive Lovász local lemma
YJ Chang, Q He, W Li, S Pettie, J Uitto
ACM Transactions on Algorithms (TALG) 16 (1), 1-51, 2019
92019
A constant-factor approximation algorithm for Nash social welfare with submodular valuations
W Li, J Vondrák
arXiv preprint arXiv:2103.10536, 2021
82021
Distributed -Coloring via Ultrafast Graph Shattering
YJ Chang, W Li, S Pettie
SIAM Journal on Computing 49 (3), 497-539, 2020
72020
A polynomial lower bound on adaptive complexity of submodular maximization
W Li, P Liu, J Vondrák
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
52020
The system can't perform the operation now. Try again later.
Articles 1–7