Yi-Jun Chang
Yi-Jun Chang
Institute for Theoretical Studies, ETH Zürich
Verified email at eth-its.ethz.ch - Homepage
Title
Cited by
Cited by
Year
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
872019
Distributed -Coloring via Ultrafast Graph Shattering
YJ Chang, W Li, S Pettie
SIAM Journal on Computing 49 (3), 497-539, 2020
50*2020
A time hierarchy theorem for the LOCAL model
YJ Chang, S Pettie
SIAM Journal on Computing 48 (1), 33-69, 2019
432019
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
31*2019
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
292019
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
222019
Distributed triangle detection via expander decomposition
YJ Chang, S Pettie, H Zhang
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
212019
Improved distributed expander decomposition and nearly optimal triangle enumeration
YJ Chang, T Saranurak
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
152019
Hardness of RNA folding problem with four symbols
YJ Chang
Theoretical Computer Science 757, 11-26, 2019
11*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
112018
Improved algorithms for grid-unfolding orthogonal polyhedra
YJ Chang, HC Yen
International Journal of Computational Geometry & Applications 27 (01n02), 33-56, 2017
9*2017
On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs
YJ Chang, HC Yen
The 33rd International Symposium on Computational Geometry (SoCG 2017), 2017
92017
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
72019
Simple contention resolution via multiplicative weight updates
YJ Chang, W Jin, S Pettie
Proceedings 2nd Symposium on Simplicity in Algorithms (SOSA), 2019
62019
On orthogonally convex drawings of plane graphs
YJ Chang, HC Yen
Computational Geometry 62, 34-51, 2017
5*2017
Unfolding some classes of orthogonal polyhedra of arbitrary genus
KY Ho, YJ Chang, HC Yen
Journal of Combinatorial Optimization 37 (2), 482-500, 2019
32019
Constrained floorplans in 2D and 3D
YJ Chang, HC Yen
Theoretical Computer Science 607, 320-336, 2015
2*2015
A new approach for contact graph representations and its applications
YJ Chang, HC Yen
Workshop on Algorithms and Data Structures, 166-177, 2015
22015
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization
YJ Chang, T Saranurak
arXiv preprint arXiv:2007.14898, 2020
12020
Distributed graph problems through an automata-theoretic lens
YJ Chang, J Studenı, J Suomela
arXiv preprint arXiv:2002.07659, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20