Yi-Jun Chang

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 92

Top Topics

Graph Representation

Labeling Problems

Top Venues

Theor. Comput. Sci.

Publications

Yi-Jun Chang
The energy complexity of diameter and minimum cut computation in bounded-genus networks. Theor. Comput. Sci. 982 (2024)
Yi-Jun Chang, Da Wei Zheng
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. SODA (2024)
Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
Fast Broadcast in Highly Connected Networks. CoRR (2024)
Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
Fast Broadcast in Highly Connected Networks. SPAA (2024)
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
Improved All-Pairs Approximate Shortest Paths in Congested Clique. PODC (2024)
Yi-Jun Chang
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees. ITCS (2024)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. PODC (2024)
Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Mingyang Yang, Yu-Cheng Yeh
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. PODC (2024)
Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su
Deterministic Expander Routing: Faster and More Versatile. CoRR (2024)
Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su
Deterministic Expander Routing: Faster and More Versatile. PODC (2024)
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
Improved All-Pairs Approximate Shortest Paths in Congested Clique. CoRR (2024)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes
Low-Distortion Clustering in Bounded Growth Graphs. CoRR (2024)
Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. PODC (2024)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
Locally checkable problems in rooted trees. Distributed Comput. 36 (3) (2023)
Yi-Jun Chang
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. PODC (2023)
Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. CoRR (2023)
Yi-Jun Chang, Jan Studený, Jukka Suomela
Distributed graph problems through an automata-theoretic lens. Theor. Comput. Sci. 951 (2023)
Yi-Jun Chang, Ran Duan, Shunhua Jiang
Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election. ACM Trans. Algorithms 19 (4) (2023)
Yi-Jun Chang
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. CoRR (2023)
Yi-Jun Chang, Da Wei Zheng
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. CoRR (2023)
Yi-Jun Chang
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees. CoRR (2023)
Yi-Jun Chang, Zeyong Li
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. PODC (2023)
Yi-Jun Chang
Ortho-Radial Drawing in Near-Linear Time. ICALP (2023)
Yi-Jun Chang, Oren Hecht, Dean Leitersdorf
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model. CoRR (2023)
Yi-Jun Chang, Zeyong Li
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. CoRR (2023)
Yi-Jun Chang
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks. SIROCCO (2023)
Yi-Jun Chang, Gopinath Mishra, Thuan Hung Nguyen, Mingyang Yang, Yu-Cheng Yeh
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. CoRR (2023)
Yi-Jun Chang
Ortho-Radial Drawing in Near-Linear Time. CoRR (2023)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. ITCS (2022)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela
Efficient Classification of Local Problems in Regular Trees. CoRR (2022)
Yi-Jun Chang, Hsin-Hao Su
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. PODC (2022)
Yi-Jun Chang, Hsin-Hao Su
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. CoRR (2022)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela
Efficient Classification of Locally Checkable Problems in Regular Trees. DISC (2022)
Yi-Jun Chang, Shunhua Jiang
The Energy Complexity of Las Vegas Leader Election. CoRR (2022)
Yi-Jun Chang, Shunhua Jiang
The Energy Complexity of Las Vegas Leader Election. SPAA (2022)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. CoRR (2021)
Yi-Jun Chang, Ran Duan, Shunhua Jiang
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. CoRR (2021)
Yi-Jun Chang, Seth Pettie, Thatchaphol Saranurak, Hengjie Zhang
Near-optimal Distributed Triangle Enumeration via Expander Decompositions. J. ACM 68 (3) (2021)
Yi-Jun Chang, Jan Studený, Jukka Suomela
Distributed Graph Problems Through an Automata-Theoretic Lens. SIROCCO (2021)
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky
On Homomorphism Graphs. CoRR (2021)
Yi-Jun Chang, Mohsen Ghaffari
Strong-Diameter Network Decomposition. PODC (2021)
Yi-Jun Chang, Mohsen Ghaffari
Strong-Diameter Network Decomposition. CoRR (2021)
Yi-Jun Chang, Ran Duan, Shunhua Jiang
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. SPAA (2021)
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf
Tight Distributed Listing of Cliques. SODA (2021)
Yi-Jun Chang, Thatchaphol Saranurak
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. FOCS (2020)
Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai
Streaming Complexity of Spanning Tree Computation. CoRR (2020)
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf
Tight Distributed Listing of Cliques. CoRR (2020)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie
The Energy Complexity of BFS in Radio Networks. PODC (2020)
Yi-Jun Chang, Jan Studený, Jukka Suomela
Distributed graph problems through an automata-theoretic lens. CoRR (2020)
Yi-Jun Chang, Jan Studený, Jukka Suomela
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. DISC (2020)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie
The Energy Complexity of BFS in Radio Networks. CoRR (2020)
Yi-Jun Chang, Wenzheng Li, Seth Pettie
Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering. SIAM J. Comput. 49 (3) (2020)
Yi-Jun Chang, Thatchaphol Saranurak
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. CoRR (2020)
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma. ACM Trans. Algorithms 16 (1) (2020)
Yi-Jun Chang
The Complexity Landscape of Distributed Locally Checkable Problems on Trees. DISC (2020)
Yi-Jun Chang
The Complexity Landscape of Distributed Locally Checkable Problems on Trees. CoRR (2020)
Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai
Streaming Complexity of Spanning Tree Computation. STACS (2020)
Yi-Jun Chang
Hardness of RNA folding problem with four symbols. Theor. Comput. Sci. 757 (2019)
Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen
Unfolding some classes of orthogonal polyhedra of arbitrary genus. J. Comb. Optim. 37 (2) (2019)
Yi-Jun Chang, Thatchaphol Saranurak
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. CoRR (2019)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan
Exponential Separations in the Energy Complexity of Leader Election. ACM Trans. Algorithms 15 (4) (2019)
Yi-Jun Chang, Thatchaphol Saranurak
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. PODC (2019)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48 (1) (2019)
Yi-Jun Chang, Wenyu Jin, Seth Pettie
Simple Contention Resolution via Multiplicative Weight Updates. SOSA (2019)
Yi-Jun Chang, Seth Pettie
A Time Hierarchy Theorem for the LOCAL Model. SIAM J. Comput. 48 (1) (2019)
Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
PODC 2019 Review. SIGACT News 50 (4) (2019)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. PODC (2019)
Yi-Jun Chang, Seth Pettie, Hengjie Zhang
Distributed Triangle Detection via Expander Decomposition. SODA (2019)
Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, Yufan Zheng
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. PODC (2019)
Yi-Jun Chang, Wenzheng Li, Seth Pettie
An optimal distributed (Δ+1)-coloring algorithm? STOC (2018)
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela
The distributed complexity of locally checkable problems on paths is decidable. CoRR (2018)
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto
The Complexity of Distributed Edge Coloring with Small Palettes. SODA (2018)
Yi-Jun Chang, Seth Pettie, Hengjie Zhang
Distributed Triangle Detection via Expander Decomposition. CoRR (2018)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie
The Energy Complexity of Broadcast. PODC (2018)
Yi-Jun Chang
Energy Complexity of Distance Computation in Multi-hop Networks. CoRR (2018)
Yi-Jun Chang, Hsu-Chun Yen
On orthogonally convex drawings of plane graphs. Comput. Geom. 62 (2017)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan
Exponential separations in the energy complexity of leader election. STOC (2017)
Yi-Jun Chang, Hsu-Chun Yen
Area-universal drawings of biconnected outerplane graphs. Inf. Process. Lett. 118 (2017)
Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen
Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus. COCOON (2017)
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto
The Complexity of Distributed Edge Coloring with Small Palettes. CoRR (2017)
Yi-Jun Chang, Wenzheng Li, Seth Pettie
An Optimal Distributed (Δ+1)-Coloring Algorithm? CoRR (2017)
Yi-Jun Chang, Seth Pettie
A Time Hierarchy Theorem for the LOCAL Model. CoRR (2017)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie
The Energy Complexity of Broadcast. CoRR (2017)
Yi-Jun Chang, Hsu-Chun Yen
On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs. SoCG (2017)
Yi-Jun Chang, Hsu-Chun Yen
Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra. Int. J. Comput. Geom. Appl. 27 (1-2) (2017)
Yi-Jun Chang, Seth Pettie
A Time Hierarchy Theorem for the LOCAL Model. FOCS (2017)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. FOCS (2016)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan
How to Elect a Low-energy Leader. CoRR (2016)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. PODC (2016)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. CoRR (2016)
Yi-Jun Chang
Hardness of RNA Folding Problem With Four Symbols. CPM (2016)
Yi-Jun Chang, Hsu-Chun Yen
A New Approach for Contact Graph Representations and Its Applications. WADS (2015)
Yi-Jun Chang, Hsu-Chun Yen
Constrained floorplans in 2D and 3D. Theor. Comput. Sci. 607 (2015)
Yi-Jun Chang, Hsu-Chun Yen
Unfolding Orthogonal Polyhedra with Linear Refinement. ISAAC (2015)
Yi-Jun Chang
Conditional Lower Bound for RNA Folding Problem. CoRR (2015)
Yi-Jun Chang, Hsu-Chun Yen
Rectilinear Duals Using Monotone Staircase Polygons. COCOA (2014)
Yi-Jun Chang, Hsu-Chun Yen
On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract). Graph Drawing (2013)