The SCEAS System
| |||||||

## Search the dblp DataBase
Chang-Biau Yang:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Shyue-Horng Shiau, Chang-Biau Yang
**A Fast Maximum Finding Algorithm on Broadcast Communication.**[Citation Graph (0, 0)][DBLP] COCOON, 1995, pp:472-481 [Conf] - Shyue-Horng Shiau, Chang-Biau Yang
**A Fast Sorting Algorithm and Its Generalization on Broadcast Communications.**[Citation Graph (0, 0)][DBLP] COCOON, 2000, pp:252-261 [Conf] - Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen
**Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models.**[Citation Graph (0, 0)][DBLP] ICCI, 1991, pp:350-359 [Conf] - Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen
**Fault-Tolerant Routing on the Star Graph with Safety Vectors.**[Citation Graph (0, 0)][DBLP] ISPAN, 2002, pp:301-0 [Conf] - Kuo-Si Huang, Kuo-Tsung Tseng, Chang-Biau Yang
**The Better Alignment Among Output Alignments.**[Citation Graph (0, 0)][DBLP] METMBS, 2005, pp:31-40 [Conf] - Hsu-Shen Lin, Chang-Biau Yang, Kuo-Tsung Tseng
**1-Fair Alternator Designs for the de Bruijn Network.**[Citation Graph (0, 0)][DBLP] PDCAT, 2006, pp:488-491 [Conf] - Jyh-Wen Mao, Chang-Biau Yang
**A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks.**[Citation Graph (0, 0)][DBLP] PDPTA, 2003, pp:1872-1878 [Conf] - Yaw-Wen Chang, Chang-Biau Yang
**A Parallel Algorithm for Circulant Tridiagonal Linear Systems.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:65, n:6, pp:331-337 [Journal] - Shyue-Horng Shiau, Chang-Biau Yang
**A Fast Maximum Finding Algorithm on Broadcast Communication.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:60, n:2, pp:81-89 [Journal] - Chang-Biau Yang
**Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:40, n:6, pp:295-302 [Journal] - Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann
**Dynamic programming algorithms for the mosaic longest common subsequence problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:2-3, pp:99-103 [Journal] - Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang
**Tree edge decomposition with an application to minimum ultrametric tree approximation.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:12, n:3, pp:217-230 [Journal] - Wen-Tsuen Chen, Jia-Shung Wang, Chia-Cheng Liu, Shi-Jinn Horng, Chang-Biau Yang, Ruey-Zone Huang, Bern-Cherng Liaw
**Design of An Integrated Parallel Processing System with Systolic VLSI Chips.**[Citation Graph (0, 0)][DBLP] J. Inf. Sci. Eng., 1991, v:7, n:2, pp:217-235 [Journal] - Huang-Ming Huang, Chang-Biau Yang, Kuo-Tsung Tseng
**Broadcasting on Uni-directional Hypercubes and Its Applications.**[Citation Graph (0, 0)][DBLP] J. Inf. Sci. Eng., 2003, v:19, n:2, pp:183-203 [Journal] - Chang-Biau Yang
**Computational Geometry on the Broadcast Communication Model.**[Citation Graph (0, 0)][DBLP] J. Inf. Sci. Eng., 1999, v:15, n:3, pp:383-395 [Journal] - Shih-Hsien Sheu, Chang-Biau Yang
**Multicast Algorithms for Hypercube Multiprocessors.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2001, v:61, n:1, pp:137-149 [Journal] - Jyh-Wen Mao, Chang-Biau Yang
**Shortest path routing and fault-tolerant routing on de Bruijn networks.**[Citation Graph (0, 0)][DBLP] Networks, 2000, v:35, n:3, pp:207-215 [Journal] - Chang-Biau Yang, Richard C. T. Lee
**The mapping of 2-D array processors to 1-D array processors.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1986, v:3, n:3, pp:217-229 [Journal] - Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen
**Parallel Graph Algorithms Based Upon Broadcast Communications.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1990, v:39, n:12, pp:1468-1472 [Journal] - Lee-Juan Fan, Chang-Biau Yang, Shyue-Horng Shiau
**Routing Algorithms on the Bus-Based Hypercube Network.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 2005, v:16, n:4, pp:335-348 [Journal] **Efficient Sparse Dynamic Programming for the Merged LCS Problem.**[Citation Graph (, )][DBLP]**Fast Algorithms for Computing the Constrained LCS of Run-Length Encoded Strings.**[Citation Graph (, )][DBLP]**Wormhole Routing on the Star Graph Interconnection Network.**[Citation Graph (, )][DBLP]**A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-Star Graph.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |