default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi-Jun Chang
Person information
- affiliation: National University of Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]Yi-Jun Chang
:
The energy complexity of diameter and minimum cut computation in bounded-genus networks. Theor. Comput. Sci. 982: 114279 (2024)- [c44]Yi-Jun Chang:
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees. ITCS 2024: 26:1-26:25 - [c43]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: 106-116 - [c42]Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su:
Deterministic Expander Routing: Faster and More Versatile. PODC 2024: 194-204 - [c41]Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider:
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. PODC 2024: 380-390 - [c40]Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
Improved All-Pairs Approximate Shortest Paths in Congested Clique. PODC 2024: 391-400 - [c39]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes:
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. PODC 2024: 412-415 - [c38]Yi-Jun Chang, Da Wei Zheng:
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. SODA 2024: 4410-4450 - [c37]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. SPAA 2024: 331-343 - [i37]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. CoRR abs/2404.12930 (2024) - [i36]Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
Improved All-Pairs Approximate Shortest Paths in Congested Clique. CoRR abs/2405.02695 (2024) - [i35]Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su:
Deterministic Expander Routing: Faster and More Versatile. CoRR abs/2405.03908 (2024) - [i34]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes:
Low-Distortion Clustering in Bounded Growth Graphs. CoRR abs/2405.05132 (2024) - 2023
- [j16]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): 277-311 (2023) - [j15]Yi-Jun Chang, Ran Duan, Shunhua Jiang:
Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election. ACM Trans. Algorithms 19(4): 33:1-33:23 (2023) - [j14]Yi-Jun Chang, Jan Studený, Jukka Suomela:
Distributed graph problems through an automata-theoretic lens. Theor. Comput. Sci. 951: 113710 (2023) - [c36]Yi-Jun Chang:
Ortho-Radial Drawing in Near-Linear Time. ICALP 2023: 35:1-35:20 - [c35]Yi-Jun Chang, Zeyong Li:
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. PODC 2023: 32-43 - [c34]Yi-Jun Chang:
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. PODC 2023: 55-66 - [c33]Yi-Jun Chang:
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks. SIROCCO 2023: 262-296 - [i33]Yi-Jun Chang:
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. CoRR abs/2304.04699 (2023) - [i32]Yi-Jun Chang, Oren Hecht, Dean Leitersdorf:
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model. CoRR abs/2304.06317 (2023) - [i31]Yi-Jun Chang, Da Wei Zheng:
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. CoRR abs/2304.07441 (2023) - [i30]Yi-Jun Chang:
Ortho-Radial Drawing in Near-Linear Time. CoRR abs/2305.00425 (2023) - [i29]Yi-Jun Chang, Zeyong Li:
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. CoRR abs/2305.01324 (2023) - [i28]Yi-Jun Chang:
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees. CoRR abs/2311.06726 (2023) - [i27]Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider:
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. CoRR abs/2311.09548 (2023) - [i26]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. CoRR abs/2312.01384 (2023) - 2022
- [c32]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: 29:1-29:26 - [c31]Yi-Jun Chang, Hsin-Hao Su:
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. PODC 2022: 301-312 - [c30]Yi-Jun Chang, Shunhua Jiang:
The Energy Complexity of Las Vegas Leader Election. SPAA 2022: 75-86 - [c29]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela:
Efficient Classification of Locally Checkable Problems in Regular Trees. DISC 2022: 8:1-8:19 - [i25]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela:
Efficient Classification of Local Problems in Regular Trees. CoRR abs/2202.08544 (2022) - [i24]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 abs/2204.09329 (2022) - [i23]Yi-Jun Chang, Hsin-Hao Su:
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. CoRR abs/2205.08093 (2022) - [i22]Yi-Jun Chang, Shunhua Jiang:
The Energy Complexity of Las Vegas Leader Election. CoRR abs/2205.08642 (2022) - 2021
- [j13]Yi-Jun Chang, Seth Pettie, Thatchaphol Saranurak, Hengjie Zhang:
Near-optimal Distributed Triangle Enumeration via Expander Decompositions. J. ACM 68(3): 21:1-21:36 (2021) - [c28]Yi-Jun Chang, Mohsen Ghaffari:
Strong-Diameter Network Decomposition. PODC 2021: 273-281 - [c27]Yi-Jun Chang, Jan Studený, Jukka Suomela:
Distributed Graph Problems Through an Automata-Theoretic Lens. SIROCCO 2021: 31-49 - [c26]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. SODA 2021: 2878-2891 - [c25]Yi-Jun Chang, Ran Duan, Shunhua Jiang:
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. SPAA 2021: 162-172 - [i21]Yi-Jun Chang, Mohsen Ghaffari:
Strong-Diameter Network Decomposition. CoRR abs/2102.09820 (2021) - [i20]Yi-Jun Chang, Ran Duan, Shunhua Jiang:
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. CoRR abs/2105.07518 (2021) - [i19]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 abs/2106.02066 (2021) - [i18]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
On Homomorphism Graphs. CoRR abs/2111.03683 (2021) - 2020
- [j12]Yi-Jun Chang, Wenzheng Li, Seth Pettie:
Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering. SIAM J. Comput. 49(3): 497-539 (2020) - [j11]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): 8:1-8:51 (2020) - [c24]Yi-Jun Chang, Thatchaphol Saranurak:
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. FOCS 2020: 377-388 - [c23]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie:
The Energy Complexity of BFS in Radio Networks. PODC 2020: 273-282 - [c22]Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai:
Streaming Complexity of Spanning Tree Computation. STACS 2020: 34:1-34:19 - [c21]Yi-Jun Chang:
The Complexity Landscape of Distributed Locally Checkable Problems on Trees. DISC 2020: 18:1-18:17 - [c20]Yi-Jun Chang, Jan Studený, Jukka Suomela:
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. DISC 2020: 41:1-41:3 - [i17]Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai:
Streaming Complexity of Spanning Tree Computation. CoRR abs/2001.07672 (2020) - [i16]Yi-Jun Chang, Jan Studený, Jukka Suomela:
Distributed graph problems through an automata-theoretic lens. CoRR abs/2002.07659 (2020) - [i15]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie:
The Energy Complexity of BFS in Radio Networks. CoRR abs/2007.09816 (2020) - [i14]Yi-Jun Chang, Thatchaphol Saranurak:
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. CoRR abs/2007.14898 (2020) - [i13]Yi-Jun Chang:
The Complexity Landscape of Distributed Locally Checkable Problems on Trees. CoRR abs/2009.09645 (2020) - [i12]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. CoRR abs/2011.07405 (2020)
2010 – 2019
- 2019
- [b1]Yi-Jun Chang:
Locality of Distributed Graph Problems. University of Michigan, USA, 2019 - [j10]Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen:
Unfolding some classes of orthogonal polyhedra of arbitrary genus. J. Comb. Optim. 37(2): 482-500 (2019) - [j9]Yi-Jun Chang, Seth Pettie:
A Time Hierarchy Theorem for the LOCAL Model. SIAM J. Comput. 48(1): 33-69 (2019) - [j8]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48(1): 122-143 (2019) - [j7]Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
PODC 2019 Review. SIGACT News 50(4): 33-45 (2019) - [j6]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): 49:1-49:31 (2019) - [j5]Yi-Jun Chang:
Hardness of RNA folding problem with four symbols. Theor. Comput. Sci. 757: 11-26 (2019) - [c19]Yi-Jun Chang, Thatchaphol Saranurak:
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. PODC 2019: 66-73 - [c18]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: 262-271 - [c17]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: 471-480 - [c16]Yi-Jun Chang, Wenyu Jin, Seth Pettie:
Simple Contention Resolution via Multiplicative Weight Updates. SOSA 2019: 16:1-16:16 - [c15]Yi-Jun Chang, Seth Pettie, Hengjie Zhang:
Distributed Triangle Detection via Expander Decomposition. SODA 2019: 821-840 - [i11]Yi-Jun Chang, Thatchaphol Saranurak:
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. CoRR abs/1904.08037 (2019) - 2018
- [c14]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie:
The Energy Complexity of Broadcast. PODC 2018: 95-104 - [c13]Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto:
The Complexity of Distributed Edge Coloring with Small Palettes. SODA 2018: 2633-2652 - [c12]Yi-Jun Chang, Wenzheng Li, Seth Pettie:
An optimal distributed (Δ+1)-coloring algorithm? STOC 2018: 445-456 - [i10]Yi-Jun Chang:
Energy Complexity of Distance Computation in Multi-hop Networks. CoRR abs/1805.04071 (2018) - [i9]Yi-Jun Chang, Seth Pettie, Hengjie Zhang:
Distributed Triangle Detection via Expander Decomposition. CoRR abs/1807.06624 (2018) - [i8]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 abs/1811.01672 (2018) - 2017
- [j4]Yi-Jun Chang, Hsu-Chun Yen:
On orthogonally convex drawings of plane graphs. Comput. Geom. 62: 34-51 (2017) - [j3]Yi-Jun Chang, Hsu-Chun Yen:
Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra. Int. J. Comput. Geom. Appl. 27(1-2): 33-56 (2017) - [j2]Yi-Jun Chang, Hsu-Chun Yen:
Area-universal drawings of biconnected outerplane graphs. Inf. Process. Lett. 118: 1-5 (2017) - [c11]Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen:
Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus. COCOON 2017: 275-286 - [c10]Yi-Jun Chang, Hsu-Chun Yen:
On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs. SoCG 2017: 29:1-29:15 - [c9]Yi-Jun Chang, Seth Pettie:
A Time Hierarchy Theorem for the LOCAL Model. FOCS 2017: 156-167 - [c8]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
Exponential separations in the energy complexity of leader election. STOC 2017: 771-783 - [i7]Yi-Jun Chang, Seth Pettie:
A Time Hierarchy Theorem for the LOCAL Model. CoRR abs/1704.06297 (2017) - [i6]Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto:
The Complexity of Distributed Edge Coloring with Small Palettes. CoRR abs/1708.04290 (2017) - [i5]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie:
The Energy Complexity of Broadcast. CoRR abs/1710.01800 (2017) - [i4]Yi-Jun Chang, Wenzheng Li, Seth Pettie:
An Optimal Distributed (Δ+1)-Coloring Algorithm? CoRR abs/1711.01361 (2017) - 2016
- [c7]Yi-Jun Chang:
Hardness of RNA Folding Problem With Four Symbols. CPM 2016: 13:1-13:12 - [c6]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. FOCS 2016: 615-624 - [c5]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. PODC 2016: 195-197 - [i3]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. CoRR abs/1602.08166 (2016) - [i2]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
How to Elect a Low-energy Leader. CoRR abs/1609.08486 (2016) - 2015
- [j1]Yi-Jun Chang, Hsu-Chun Yen:
Constrained floorplans in 2D and 3D. Theor. Comput. Sci. 607: 320-336 (2015) - [c4]Yi-Jun Chang, Hsu-Chun Yen:
Unfolding Orthogonal Polyhedra with Linear Refinement. ISAAC 2015: 415-425 - [c3]Yi-Jun Chang, Hsu-Chun Yen:
A New Approach for Contact Graph Representations and Its Applications. WADS 2015: 166-177 - [i1]Yi-Jun Chang:
Conditional Lower Bound for RNA Folding Problem. CoRR abs/1511.04731 (2015) - 2014
- [c2]Yi-Jun Chang, Hsu-Chun Yen:
Rectilinear Duals Using Monotone Staircase Polygons. COCOA 2014: 86-100 - 2013
- [c1]Yi-Jun Chang, Hsu-Chun Yen:
On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract). GD 2013: 400-411
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
