Yi-Jun CHANG

Yi-Jun CHANG is an NUS Presidential Young Professor in the Department of Computer Science at the National University of Singapore. He received his Ph.D. in Computer Science and Engineering from the University of Michigan in 2019. His research focuses on theoretical computer science, particularly distributed, parallel, and sublinear algorithms. CHANG has published extensively in top-tier conferences and journals, including the Journal of the ACM and the SIAM Journal on Computing. He has been recognized with awards such as the best paper award and the best student paper award at PODC 2019, as well as the 2020 PODC Doctoral Dissertation Award.

Yi-Jun Chang is a researcher in theoretical computer science, focusing on distributed algorithms and complexity theory. His work explores the complexity of distributed problems, including locally checkable problems on trees and paths, and the energy complexity of distributed tasks such as broadcast and BFS. He has made significant contributions to understanding the separation between randomized and deterministic complexity in the LOCAL model, as well as the time hierarchy theorem for distributed computing. His research also includes distributed graph problems, such as edge coloring and triangle enumeration, and the application of expander decompositions in distributed algorithms.