1. You are Here：

Browsing by Author LEE, RCT

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 19 of 19
Issue DateTitleAuthor(s)
1992AMORTIZED ANALYSIS OF SOME DISK SCHEDULING ALGORITHMS - SSTF, SCAN, AND N-STEP SCANCHEN, TS; YANG, WP; LEE, RCT; 資訊工程學系; Department of Computer Science
1984THE AVERAGE PERFORMANCE ANALYSIS OF A CLOSEST-PAIR ALGORITHMCHANG, RC; LEE, RCT; 資訊工程學系; Department of Computer Science
1983THE HIERARCHICAL ORDERING IN MULTIATTRIBUTE FILESCHANG, CC; DU, MW; LEE, RCT; 資訊工程學系; Department of Computer Science
1-Jul-1990MINIMUM RECTANGULAR PARTITION PROBLEM FOR SIMPLE RECTILINEAR POLYGONSLIOU, WT; TAN, JJM; LEE, RCT; 資訊工程學系; Department of Computer Science
1-Jan-1984A NEW PARALLEL SORTING ALGORITHM BASED UPON MIN-MID-MAX OPERATIONSTSENG, SS; LEE, RCT; 資訊工程學系; Department of Computer Science
1-Jan-1984A NEW PARALLEL SORTING ALGORITHM BASED UPON MIN-MID-MAX OPERATIONSTSENG, SS; LEE, RCT; 資訊工程學系; Department of Computer Science
1986AN O(N LOG N) MINIMAL SPANNING TREE ALGORITHM FOR N-POINTS IN THE PLANECHANG, RC; LEE, RCT; 交大名義發表; National Chiao Tung University
1984ON THE AVERAGE LENGTH OF DELAUNAY TRIANGULATIONSCHANG, RC; LEE, RCT; 資訊工程學系; Department of Computer Science
1984OPTIMAL SPEEDING UP OF PARALLEL ALGORITHMS BASED UPON THE DIVIDE-AND-CONQUER STRATEGYTANG, CY; LEE, RCT; 資訊工程學系; Department of Computer Science
1-Feb-1990A PARALLEL ALGORITHM FOR FINDING CONGRUENT REGIONSSHIH, ZC; LEE, RCT; YANG, SN; 資訊工程學系; Department of Computer Science
1984A PARALLEL ALGORITHM TO SOLVE THE STABLE MARRIAGE PROBLEMTSENG, SS; LEE, RCT; 工學院; 資訊工程學系; College of Engineering; Department of Computer Science
1-Dec-1985A PARALLEL SORTING SCHEME WHOSE BASIC OPERATION SORTS N ELEMENTSTSENG, SS; LEE, RCT; 資訊工程學系; Department of Computer Science
1991PASSWORD AUTHENTICATION USING NEWTON INTERPOLATING POLYNOMIALSLIN, CH; CHANG, CC; WU, TC; LEE, RCT; 資訊科學與工程研究所; Institute of Computer Science and Engineering
1984PERFORMANCE ANALYSES OF CARTESIAN PRODUCT FILES AND RANDOM FILESCHANG, CC; DU, MW; LEE, RCT; 資訊工程學系; Department of Computer Science
1-Apr-1993THE SEARCHING OVER SEPARATORS STRATEGY TO SOLVE SOME NP-HARD PROBLEMS IN SUBEXPONENTIAL TIMEHWANG, RZ; CHANG, RC; LEE, RCT; 資訊工程學系; Department of Computer Science
1-Jan-1993THE SLAB DIVIDING APPROACH TO SOLVE THE EUCLIDEAN P-CENTER PROBLEMHWANG, RZ; LEE, RCT; CHANG, RC; 資訊工程學系; Department of Computer Science
24-Aug-1992SPECIAL SUBGRAPHS OF WEIGHTED VISIBILITY GRAPHSHSU, FR; LEE, RCT; CHANG, RC; 資訊科學與工程研究所; Institute of Computer Science and Engineering
1982SYMBOLIC GRAY CODE AS A PERFECT MULTIATTRIBUTE HASHING SCHEME FOR PARTIAL MATCH QUERIESCHANG, CC; LEE, RCT; DU, MW; 資訊工程學系; Department of Computer Science
1-Aug-1989A SYSTOLIC ALGORITHM FOR EXTRACTING REGIONS FROM A PLANAR GRAPHSHIH, ZC; LEE, RCT; YANG, SN; 資訊工程學系; Department of Computer Science
Showing results 1 to 19 of 19