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
77 2018 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
54 2018 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
37 2018 A constant-factor approximation algorithm for Nash social welfare with submodular valuations W Li, J Vondrák
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 25-36, 2022
31 2022 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
24 2019 Distributed YJ Chang, W Li, S Pettie
SIAM Journal on Computing 49 (3), 497-539, 2020
20 2020 Approximating nash social welfare by matching and local search J Garg, E Husić, W Li, LA Végh, J Vondrák
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1298-1310, 2023
14 2023 Estimating the Nash social welfare for coverage and other submodular valuations W Li, J Vondrák
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
11 2021 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
10 2020 