Yen-Chun Lin, C. M. Lin A Family of Efficient Algorithms for the Prefix Operation on Message-Passing Computers. [Citation Graph (0, 0)][DBLP] HPCN Europe, 1996, pp:1003-1004 [Conf]
Yen-Chun Lin Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:60, n:4, pp:183-187 [Journal]
Yen-Chun Lin, Ferng-Ching Lin Three-Level FP Programs and the Derivation of Problem-Size-Dependent/Independent Systolic Algorithms. [Citation Graph (0, 0)][DBLP] J. Inf. Sci. Eng., 1990, v:6, n:2, pp:117-137 [Journal]
Yen-Chun Lin, Jih-Wei Yeh A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP] J. Inf. Sci. Eng., 2002, v:18, n:4, pp:519-532 [Journal]
Yen-Chun Lin Perfectly Overlapped Generation of Long Runs for Sorting Large Files. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1993, v:19, n:2, pp:136-142 [Journal]
Yen-Chun Lin, Yu-Ho Cheng Automatic Generation of Parallel Occam Programs for Transputer Rings. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1992, v:16, n:2, pp:121-133 [Journal]
Yen-Chun Lin, Jun-Wei Hsiao A new approach to constructing optimal parallel prefix circuits with small depth. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2004, v:64, n:1, pp:97-107 [Journal]
Yen-Chun Lin, Chin-Yu Su Faster optimal parallel prefix circuits: New algorithmic construction. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2005, v:65, n:12, pp:1585-1595 [Journal]
Yen-Chun Lin, Jih-Wei Yeh Deriving a fast systolic algorithm for the longest common subsequence problem. [Citation Graph (0, 0)][DBLP] Parallel Algorithms Appl., 2002, v:17, n:1, pp:1-18 [Journal]
Yen-Chun Lin An FP-based tool for the synthesis of regular array algorithms. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:457-470 [Journal]
Yen-Chun Lin Array size anomaly of problem-size independent systolic arrays for matrix-vector multiplication. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1991, v:17, n:4-5, pp:515-522 [Journal]
Yen-Chun Lin New Systolic Arrays for the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1994, v:20, n:9, pp:1323-1334 [Journal]
Yen-Chun Lin On Balancing Sorting on a Linear Array. [Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:5, pp:566-571 [Journal]