瀏覽 的方式: 作者 Hsu, LH

跳到: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
或是輸入前幾個字:  
顯示 1 到 20 筆資料,總共 52 筆  下一頁 >
公開日期標題作者
19981-fault tolerant design for token ringsWang, JJ; Hung, CN; Hsu, LH; 資訊工程學系; Department of Computer Science
2002Adaptive path-based multicast on wormhole-routed hypercubesWang, CM; Hou, YM; Hsu, LH; 資訊工程學系; Department of Computer Science
28-九月-2001Additive multiplicative increasing functions on nonnegative square matrices and multidigraphsChang, CH; Chuang, YC; Hsu, LH; 資訊工程學系; Department of Computer Science
31-七月-2003Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubesLi, TK; Tsai, CH; Tan, JJM; Hsu, LH; 資訊工程學系; Department of Computer Science
1998Broadcasting on wormhole-routed 2D tori with arbitrary sizeHou, YM; Wang, CM; Tsai, MJ; Hsu, LH; 資訊工程學系; Department of Computer Science
15-六月-2003Brother trees: A family of optimal 1(p)-hamiltonian and 1-edge hamiltonian graphsKao, SS; Hsu, LH; 資訊工程學系; Department of Computer Science
29-十月-1999Christmas tree: A versatile 1-fault-tolerant design for token ringsHung, CN; Hsu, LH; Sung, TY; 資訊工程學系; Department of Computer Science
1-三月-1996A classification of graph capacity functionsHsu, LH; 交大名義發表; 資訊工程學系; National Chiao Tung University; Department of Computer Science
1-二月-2005Conditional diagnosability measures for large multiprocessor systemsLai, PL; Tan, JJM; Chang, CP; Hsu, LH; 資訊工程學系; Department of Computer Science
1-五月-2000Construction schemes for fault-tolerant Hamiltonian graphsWang, JJ; Hung, CN; Tan, JJM; Hsu, LH; Sung, TY; 資訊工程學系; Department of Computer Science
26-十一月-1999The correct diameter of trivalent Cayley graphsTsai, CH; Hung, CN; Hsu, LH; Chang, CH; 資訊工程學系; Department of Computer Science
2005Cycles in highly faulty hypercubesYang, MC; Tan, JJM; Hsu, LH; 資訊工程學系; Department of Computer Science
1-十二月-2004Diagnosability of t-connected networks and product networks under the comparison diagnosis modelChang, CP; Lai, PL; Tan, JJM; Hsu, LH; 資訊工程學系; Department of Computer Science
1-十二月-2004Diagnosability of t-connected networks and product networks under the comparison diagnosis modelChang, CP; Lai, PL; Tan, JJM; Hsu, LH; 資訊工程學系; Department of Computer Science
1-八月-2004The diagnosability of the matching composition network under the comparison diagnosis modelLai, PL; Tan, JJM; Tsai, CH; Hsu, LH; 資訊工程學系; Department of Computer Science
1-一月-2000Edge congestion and topological properties of crossed cubesChang, CP; Sung, TY; Hsu, LH; 資訊工程學系; Department of Computer Science
28-二月-1997Faithful 1-edge fault tolerant graphsWang, SY; Hsu, LH; Sung, TY; 資訊工程學系; Department of Computer Science
28-二月-1997Faithful 1-edge fault tolerant graphsWang, SY; Hsu, LH; Sung, TY; 資訊工程學系; Department of Computer Science
1-七月-2001A family of trivalent 1-hamiltonian graphs with diameter O(log n)Wang, JJ; Sung, TY; Hsu, LH; 資訊工程學系; Department of Computer Science
1-十二月-2003Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphsHsu, HC; Hsieh, YL; Tan, JJM; Hsu, LH; 資訊工程學系; Department of Computer Science