The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yen-Chun Lin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Yen-Chun Lin, Ferng-Ching Lin
    The use of aFP to design regular array algorithms. [Citation Graph (0, 0)][DBLP]
    ICCL, 1988, pp:388-395 [Conf]
  3. Yen-Chun Lin, Horng-Yi Lai
    Generation of Long Sorted Runs on a Unidirectional Array. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:184-191 [Conf]
  4. Yen-Chun Lin
    Perfectly Overlapped Sorting on a Linear Array. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1992, pp:285-288 [Conf]
  5. Yen-Chun Lin, Jun-Wei Hsiao
    A New Approach to Constructing Optimal Prefix Circuits with Small Depth. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:99-104 [Conf]
  6. Yen-Chun Lin, Cheng-Hsien Chuang
    A Parallel Prefix Circuit with Minimum Layout Cost. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2002, pp:1521-1527 [Conf]
  7. Yen-Chun Lin, Chen-Chuan Pan, Jhih-En Kuo
    Multiuser interior design over the internet. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2006, pp:569-575 [Conf]
  8. 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]
  9. Yen-Chun Lin, Chun-Keng Liu
    Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:4, pp:191-195 [Journal]
  10. Yen-Chun Lin, Ching-Sung Yeh
    Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:2, pp:91-95 [Journal]
  11. Yen-Chun Lin, C. M. Lin
    Efficient Parallel Prefix Algorithms on Multicomputers. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2000, v:16, n:1, pp:41-64 [Journal]
  12. 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]
  13. 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]
  14. Yen-Chun Lin, Ching-Sung Yeh
    Optimal Parallel Prefix on the Postal Model. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2003, v:19, n:1, pp:75-83 [Journal]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1992, v:10, n:5, pp:830-849 [Journal]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. Yen-Chun Lin, Ferng-Ching Lin
    Parallel sorting with cooperating heaps in a linear array of processors. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:16, n:2-3, pp:273-278 [Journal]
  25. Yen-Chun Lin, Jyh-Chian Chen
    An Efficient Systolic Algorithm for the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 1998, v:12, n:4, pp:373-385 [Journal]
  26. Yen-Chun Lin, Yao-Hsien Hsu, Chun-Keng Liu
    Constructing H4, a Fast Depth-Size Optimal Parallel Prefix Circuit. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2003, v:24, n:3, pp:279-304 [Journal]
  27. Yen-Chun Lin, Hong Shen
    Foreword. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2003, v:24, n:3, pp:227-228 [Journal]
  28. Yen-Chun Lin, Chao-Cheng Shih
    A New Class of Depth-Size Optimal Parallel Prefix Circuits. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 1999, v:14, n:1, pp:39-52 [Journal]
  29. 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]
  30. Yen-Chun Lin, Chao-Cheng Shih
    A new class of depth-size optimal parallel prefix circuits. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 1998, pp:117-120 [Conf]

  31. Web-based image matting. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.280secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002