![]() | ![]() |
2008 | ||
---|---|---|
10 | EE | Cho-Chin Lin: On Message Sequences for Incremental Network Computing. J. Inf. Sci. Eng. 24(4): 1023-1040 (2008) |
9 | EE | Cho-Chin Lin, Hao-Yun Yin: On the assessment of input streams for incremental network computing. J. Parallel Distrib. Comput. 68(9): 1297-1304 (2008) |
2007 | ||
8 | EE | Cho-Chin Lin: A Dominant Input Stream for LUD Incremental Computing on a Contention Network. ICA3PP 2007: 403-414 |
7 | EE | Cho-Chin Lin, Hao-Yun Yin: Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences. Inf. Process. Lett. 102(1): 35-40 (2007) |
6 | EE | Cho-Chin Lin: A Framework for Solving Sequence Problem of Multiple Input Streams. Int. J. Found. Comput. Sci. 18(5): 1043-1064 (2007) |
2005 | ||
5 | EE | Cho-Chin Lin, Hao-Yun Yin: Bounds on the Multi-Client Incremental Computing. ACIS-ICIS 2005: 653-658 |
2004 | ||
4 | EE | Cho-Chin Lin: Strategies for Achieving High Performance Incremental Computing on a Network Environment. AINA (1) 2004: 113-118 |
2003 | ||
3 | EE | Cho-Chin Lin: A Novel Message Scheduling Paradigm for Developing Algorithms in Network Computing Platform. AINA 2003: 650-655 |
1995 | ||
2 | Cho-Chin Lin, Viktor K. Prasanna: Bounds on the Diameter of One-Dimensional PEC Networks. J. Parallel Distrib. Comput. 29(1): 1-16 (1995) | |
1992 | ||
1 | Cho-Chin Lin, Viktor K. Prasanna: A Tight Bound on the Diameter of One-Dimensional PEC Networks. SPDP 1992: 368-375 |
1 | Viktor K. Prasanna (V. K. Prasanna Kumar) | [1] [2] |
2 | Hao-Yun Yin | [5] [7] [9] |