( en | de | ru )

 

Disambiguation of "Chang, Yi-Jun"

Author of the publication

copydeleteadd this publication to your clipboard
The distributed complexity of locally checkable problems on paths is decidable.

, , , , , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

ng-jun Yi

Jun-yi Zhu

Byung-Jun Yi

Yi-Jun Xiao

Bong Jun Chang

 

Other publications of authors with the same name

The energy complexity of diameter and minimum cut computation in bounded-genus networks.. Theor. Comput. Sci., (January 2024)Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics., , , , , and . CoRR, (2021)Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs., and . CoRR, (2023)Locally checkable problems in rooted trees., , , , , , and . Distributed Comput., 36 (3): 277-311 (September 2023)Distributed Triangle Detection via Expander Decomposition., , and . CoRR, (2018)The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs., and . PODC, page 32-43. ACM, (2023)Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization., and . FOCS, page 377-388. IEEE, (2020)Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics., , , , , and . ITCS, volume 215 of LIPIcs, page 29:1-29:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs., and . SODA, page 4410-4450. SIAM, (2024)Tight Distributed Listing of Cliques., , , and . SODA, page 2878-2891. SIAM, (2021)