dblp.uni-trier.dewww.uni-trier.de

Yen-Chun Lin Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
32EEYen-Chun Lin, Li-Ling Hung: Straightforward construction of depth-size optimal, parallel prefix circuits with fan-out 2. ACM Trans. Design Autom. Electr. Syst. 14(1): (2009)
31EEYen-Chun Lin, Li-Ling Hung: Fast problem-size-independent parallel prefix circuits. J. Parallel Distrib. Comput. 69(4): 382-388 (2009)
2006
30EEYen-Chun Lin, Chen-Chuan Pan, Jhih-En Kuo: Multiuser interior design over the internet. Winter Simulation Conference 2006: 569-575
2005
29EEYen-Chun Lin, Chin-Yu Su: Faster optimal parallel prefix circuits: New algorithmic construction. J. Parallel Distrib. Comput. 65(12): 1585-1595 (2005)
2004
28EEYen-Chun Lin, Jun-Wei Hsiao: A new approach to constructing optimal parallel prefix circuits with small depth. J. Parallel Distrib. Comput. 64(1): 97-107 (2004)
2003
27EEYen-Chun Lin, Ching-Sung Yeh: Optimal Parallel Prefix on the Postal Model. J. Inf. Sci. Eng. 19(1): 75-83 (2003)
26EEYen-Chun Lin, Hong Shen: Foreword. The Journal of Supercomputing 24(3): 227-228 (2003)
25EEYen-Chun Lin, Yao-Hsien Hsu, Chun-Keng Liu: Constructing H4, a Fast Depth-Size Optimal Parallel Prefix Circuit. The Journal of Supercomputing 24(3): 279-304 (2003)
2002
24EEYen-Chun Lin, Jun-Wei Hsiao: A New Approach to Constructing Optimal Prefix Circuits with Small Depth. ISPAN 2002: 99-104
23 Yen-Chun Lin, Cheng-Hsien Chuang: A Parallel Prefix Circuit with Minimum Layout Cost. PDPTA 2002: 1521-1527
22EEYen-Chun Lin, Jih-Wei Yeh: A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem. J. Inf. Sci. Eng. 18(4): 519-532 (2002)
21 Yen-Chun Lin, Jih-Wei Yeh: Deriving a fast systolic algorithm for the longest common subsequence problem. Parallel Algorithms Appl. 17(1): 1-18 (2002)
2000
20EEYen-Chun Lin, C. M. Lin: Efficient Parallel Prefix Algorithms on Multicomputers. J. Inf. Sci. Eng. 16(1): 41-64 (2000)
1999
19EEYen-Chun Lin, Chun-Keng Liu: Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time. Inf. Process. Lett. 70(4): 191-195 (1999)
18EEYen-Chun Lin, Ching-Sung Yeh: Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems. Inf. Process. Lett. 71(2): 91-95 (1999)
17EEYen-Chun Lin, Chao-Cheng Shih: A New Class of Depth-Size Optimal Parallel Prefix Circuits. The Journal of Supercomputing 14(1): 39-52 (1999)
1998
16 Yen-Chun Lin, Chao-Cheng Shih: A new class of depth-size optimal parallel prefix circuits. Computers and Their Applications 1998: 117-120
15EEYen-Chun Lin, Jyh-Chian Chen: An Efficient Systolic Algorithm for the Longest Common Subsequence Problem. The Journal of Supercomputing 12(4): 373-385 (1998)
1996
14 Yen-Chun Lin, C. M. Lin: A Family of Efficient Algorithms for the Prefix Operation on Message-Passing Computers. HPCN Europe 1996: 1003-1004
13EEYen-Chun Lin: Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array. Inf. Process. Lett. 60(4): 183-187 (1996)
1994
12 Yen-Chun Lin: New Systolic Arrays for the Longest Common Subsequence Problem. Parallel Computing 20(9): 1323-1334 (1994)
1993
11 Yen-Chun Lin, Horng-Yi Lai: Generation of Long Sorted Runs on a Unidirectional Array. ICPP 1993: 184-191
10EEYen-Chun Lin: On Balancing Sorting on a Linear Array. IEEE Trans. Parallel Distrib. Syst. 4(5): 566-571 (1993)
9 Yen-Chun Lin: Perfectly Overlapped Generation of Long Runs for Sorting Large Files. J. Parallel Distrib. Comput. 19(2): 136-142 (1993)
1992
8 Yen-Chun Lin: Perfectly Overlapped Sorting on a Linear Array. ICPP (3) 1992: 285-288
7 Juin-Hwey Chen, Richard V. Cox, Yen-Chun Lin, Nikil Jayant, Melvin J. Melchner: A Low-Delay CELP Coder for the CCITT 16 kb/s Speech Coding Standard. IEEE Journal on Selected Areas in Communications 10(5): 830-849 (1992)
6 Yen-Chun Lin, Yu-Ho Cheng: Automatic Generation of Parallel Occam Programs for Transputer Rings. J. Parallel Distrib. Comput. 16(2): 121-133 (1992)
1991
5 Yen-Chun Lin: An FP-based tool for the synthesis of regular array algorithms. Parallel Computing 17(4-5): 457-470 (1991)
4 Yen-Chun Lin: Array size anomaly of problem-size independent systolic arrays for matrix-vector multiplication. Parallel Computing 17(4-5): 515-522 (1991)
1990
3EEYen-Chun Lin, Ferng-Ching Lin: Three-Level FP Programs and the Derivation of Problem-Size-Dependent/Independent Systolic Algorithms. J. Inf. Sci. Eng. 6(2): 117-137 (1990)
2 Yen-Chun Lin, Ferng-Ching Lin: Parallel sorting with cooperating heaps in a linear array of processors. Parallel Computing 16(2-3): 273-278 (1990)
1988
1EEYen-Chun Lin, Ferng-Ching Lin: The use of aFP to design regular array algorithms. ICCL 1988: 388-395

Coauthor Index

1Juin-Hwey Chen [7]
2Jyh-Chian Chen [15]
3Yu-Ho Cheng [6]
4Cheng-Hsien Chuang [23]
5Richard V. Cox [7]
6Jun-Wei Hsiao [24] [28]
7Yao-Hsien Hsu [25]
8Li-Ling Hung [31] [32]
9Nikil Jayant [7]
10Jhih-En Kuo [30]
11Horng-Yi Lai [11]
12C. M. Lin [14] [20]
13Ferng-Ching Lin [1] [2] [3]
14Chun-Keng Liu [19] [25]
15Melvin J. Melchner [7]
16Chen-Chuan Pan [30]
17Hong Shen [26]
18Chao-Cheng Shih [16] [17]
19Chin-Yu Su [29]
20Ching-Sung Yeh [18] [27]
21Jih-Wei Yeh [21] [22]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)