Yi-Jun Chang

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