Browsing by Author Hwang, FK

Jump to: 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
or enter first few letters:  
Showing results 1 to 20 of 92  next >
Issue DateTitleAuthor(s)
16-May-2005An almost-linear time and linear space algorithm for the longest common subsequence problemGuo, JY; Hwang, FK; 應用數學系; Department of Applied Mathematics
1998Characterizing bit permutation networksChang, GJ; Hwang, FK; Tong, LD; 應用數學系; Department of Applied Mathematics
1-Jul-1999Characterizing bit permutation networksChang, GJ; Hwang, FK; Tong, LD; 應用數學系; Department of Applied Mathematics
1-Aug-2001Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networksHwang, FK; Yen, CH; 應用數學系; Department of Applied Mathematics
1-Apr-1998Choosing the best log(k)(N,m,P) strictly nonblocking networksHwang, FK; 應用數學系; Department of Applied Mathematics
1-Jun-2000Comments on "Reliability and component importance of a consecutive-k-out-of-n system" by ZuoHwang, FK; Cui, LR; Chang, JC; Lin, WD; 應用數學系; 資訊工程學系; Department of Applied Mathematics; Department of Computer Science
1-Jan-1998Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercubeHwang, FK; Yao, YC; 應用數學系; Department of Applied Mathematics
1-Jan-1998Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercubeHwang, FK; Yao, YC; 應用數學系; Department of Applied Mathematics
15-Jun-2005A competitive algorithm to find all defective edges in a graphHwang, FK; 應用數學系; Department of Applied Mathematics
28-Jul-2001A complementary survey on double-loop networksHwang, FK; 應用數學系; Department of Applied Mathematics
1-May-1999The consecutive-4 digraphs are HamiltonianChang, GJ; Hwang, FK; Tong, LD; 應用數學系; Department of Applied Mathematics
1-Feb-2004Decomposing complete graphs into K-r x K-c'sFu, HL; Hwang, FK; Jimbo, M; Mutoh, Y; Shiue, CL; 應用數學系; Department of Applied Mathematics
1-Dec-1997Detecting corrupted pages in M replicated large filesHwang, FK; Zang, WN; 應用數學系; Department of Applied Mathematics
1-Dec-1997Detecting corrupted pages in M replicated large filesHwang, FK; Zang, WN; 應用數學系; Department of Applied Mathematics
1-Jan-2003An efficient algorithm for the reliability of consecutive-k-n networksChang, JC; Chen, RJ; Hwang, FK; 應用數學系; 資訊工程學系; Department of Applied Mathematics; Department of Computer Science
1-Jan-1998Enumerating consecutive and nested partitions for graphsHwang, FK; Chang, GJ; 應用數學系; Department of Applied Mathematics
1-Jan-1998Enumerating consecutive and nested partitions for graphsHwang, FK; Chang, GJ; 應用數學系; Department of Applied Mathematics
1-Dec-2005Equivalence of buddy networks with arbitrary number of stagesChen, CY; Hwang, FK; Lan, JK; 應用數學系; Department of Applied Mathematics
2004Equivalence of the 1-rate model to the classical model on strictly nonblocking switching networksChen, WR; Hwang, FK; Zhu, XD; 應用數學系; Department of Applied Mathematics
1-Dec-2000Equivalent double-loop networksHuang, SH; Hwang, FK; Liu, YH; 應用數學系; Department of Applied Mathematics