An exponential separation between randomized and deterministic complexity in the LOCAL model YJ Chang, T Kopelowitz, S Pettie
SIAM Journal on Computing 48 (1), 122-143, 2019
172 2019 A time hierarchy theorem for the LOCAL model YJ Chang, S Pettie
SIAM Journal on Computing 48 (1), 33-69, 2019
110 2019 Distributed YJ Chang, W Li, S Pettie
SIAM Journal on Computing 49 (3), 497-539, 2020
102 * 2020 The complexity of (Δ+1) coloring in congested clique, massively parallel computation, and centralized local computation YJ Chang, M Fischer, M Ghaffari, J Uitto, Y Zheng
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
96 2019 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
82 * 2019 Near-optimal distributed triangle enumeration via expander decompositions YJ Chang, S Pettie, T Saranurak, H Zhang
Journal of the ACM (JACM) 68 (3), 1-36, 2021
71 * 2021 Exponential separations in the energy complexity of leader election YJ Chang, T Kopelowitz, S Pettie, R Wang, W Zhan
ACM Transactions on Algorithms (TALG) 15 (4), 1-31, 2019
55 2019 Distributed triangle detection via expander decomposition YJ Chang, S Pettie, H Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
44 2019 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
39 2018 Deterministic distributed expander decomposition and routing with applications in distributed derandomization YJ Chang, T Saranurak
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
37 2020 Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky
arXiv preprint arXiv:2106.02066, 2021
30 2021 The distributed complexity of locally checkable problems on paths is decidable A Balliu, S Brandt, YJ Chang, D Olivetti, M Rabie, J Suomela
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
30 2019 Locally checkable problems in rooted trees A Balliu, S Brandt, YJ Chang, D Olivetti, J Studený, J Suomela, ...
Distributed Computing 36, 1-35, 2022
27 2022 Distributed graph problems through an automata-theoretic lens YJ Chang, J Studený, J Suomela
International Colloquium on Structural Information and Communication …, 2021
27 2021 The complexity landscape of distributed locally checkable problems on trees YJ Chang
arXiv preprint arXiv:2009.09645, 2020
27 2020 The energy complexity of BFS in radio networks YJ Chang, V Dani, TP Hayes, S Pettie
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
24 2020 Hardness of RNA folding problem with four symbols YJ Chang
Theoretical Computer Science 757, 11-26, 2019
22 * 2019 Streaming complexity of spanning tree computation YJ Chang, M Farach-Colton, TS Hsu, MT Tsai
arXiv preprint arXiv:2001.07672, 2020
21 2020 Tight distributed listing of cliques K Censor-Hillel, YJ Chang, FL Gall, D Leitersdorf
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
20 2021 Improved algorithms for grid-unfolding orthogonal polyhedra YJ Chang, HC Yen
International Journal of Computational Geometry & Applications 27 (01n02), 33-56, 2017
19 * 2017 
Seth PettieProfessor of Computer Science and Engineering, University of MichiganEmail verificata su umich.edu
