( en | de | ru )

 

Disambiguation of "Yang, Chang-Biau"

Author of the publication

copydeleteadd this publication to your clipboard
Routing Algorithms on the Bus-Based Hypercube Network.

, , and . IEEE Trans. Parallel Distributed Syst., 16 (4): 335-348 (2005)

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.

Yang Chang

Mei-Yang Chang

Guu-chang Yang

Bei-Chang Yang

Horng-Chang Yang

 

Other publications of authors with the same name

Broadcasting on Uni-directional Hypercubes and Its Applications., , and . J. Inf. Sci. Eng., 19 (2): 183-203 (2003)Design of An Integrated Parallel Processing System with Systolic VLSI Chips., , , , , , and . J. Inf. Sci. Eng., 7 (2): 217-235 (1991)A Minimum-First Algorithm for Dynamic Time Warping on Time Series., , and . ICS, volume 1013 of Communications in Computer and Information Science, page 449-456. Springer, (2018)The indexing for one-dimensional proportionally-scaled strings., , , and . Inf. Process. Lett., 111 (7): 318-322 (2011)Flexible Dynamic Time Warping for Time Series Classification., , , and . ICCS, volume 51 of Procedia Computer Science, page 2838-2842. Elsevier, (2015)A new efficient indexing algorithm for one-dimensional real scaled patterns., , , and . J. Comput. Syst. Sci., 78 (1): 273-278 (2012)Linear-space S-table algorithms for the longest common subsequence problem., , and . Theor. Comput. Sci., (2023)Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models., , and . ICCI, volume 497 of Lecture Notes in Computer Science, page 350-359. Springer, (1991)A diagonal-based algorithm for the longest common increasing subsequence problem., , , and . Theor. Comput. Sci., (2020)A Fast Initialization Algorithm for Single-Hop Wireless Networks., and . IEICE Trans. Commun., 88-B (11): 4285-4292 (2005)