Richard C. T. Lee

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2013
115A new filtration method and a hybrid strategy for approximate string matching. Chia Wei Lu, Chin Lung Lu, Richard C. T. Lee. Theor. Comput. Sci. (481): 9-17 (2013). Web SearchBibTeXDownload
2010
114Data hiding methods based upon DNA sequences. H. J. Shiu, Ka-Lok Ng, Jywe-Fei Fang, Richard C. T. Lee, Chien-Hung Huang. Inf. Sci. (180): 2196-2208 (2010). Web SearchBibTeXDownload
2008
113Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee. J. Complexity (24): 173-184 (2008). Web SearchBibTeXDownload
2007
112Edit distance for a run-length-encoded string and an uncompressed string. Jia Jie Liu, Guan-Shieng Huang, Yue-Li Wang, Richard C. T. Lee. Inf. Process. Lett. (105): 12-16 (2007). Web SearchBibTeXDownload
2005
111Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs. Fang-Rong Hsu, M. K. Shan, H. S. Chao, Richard C. T. Lee. J. Inf. Sci. Eng. (21): 627-642 (2005). Web SearchBibTeXDownload
2004
110Sorting by Transpositions Based on the First Increasing Substring Concept. M. C. Chen, Richard C. T. Lee. BIBE 2004, 553-560. Web SearchBibTeXDownload
109Application of Visual Display Techniques to Solve Some Biological Problems. Richard C. T. Lee. BIBE 2004, 493-496. Web SearchBibTeXDownload
108The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction. Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee. J. Comb. Optim. (8): 453-468 (2004). Web SearchBibTeXDownload
2003
107Web-Based Synchronized Multimedia System Design for Teaching/Learning Chinese as a Foreign Language. Natalius Huang, Herng-Yow Chen, Richard C. T. Lee. KES 2003, 201-207. Web SearchBibTeXDownload
2000
106An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee. Discrete Applied Mathematics (102): 159-173 (2000). Web SearchBibTeXDownload
105An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree. Q. S. Wu, Chin Lung Lu, Richard C. T. Lee. ISAAC 2000, 156-167. Web SearchBibTeXDownload
1999
104An Optimal Embedding of Cycles into Incomplete Hypercubes. Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee. Inf. Process. Lett. (72): 213-218 (1999). Web SearchBibTeXDownload
103An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes. Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee, Jywe-Fei Fang. ISPAN 1999, 80-87. Web SearchBibTeXDownload
1998
102An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee. COCOON 1998, 309-318. Web SearchBibTeXDownload
101The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee. Inf. Process. Lett. (65): 119-123 (1998). Web SearchBibTeXDownload
1997
100Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval. C. Y. Chen, H. F. Lin, Chin-Chen Chang, Richard C. T. Lee. IEEE Trans. Knowl. Data Eng. (9): 148-160 (1997). Web SearchBibTeXDownload
99An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs. H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee. Inf. Process. Lett. (61): 311-316 (1997). Web SearchBibTeXDownload
98Approximation Algorithms. Richard C. T. Lee. ISPAN 1997, 232. Web SearchBibTeXDownload
97Multidisk Smaller Sized MKH file Allocation for Partial Match Retrieval. C. Y. Chen, H. F. Lin, Chin-Chen Chang, Richard C. T. Lee. J. Inf. Sci. Eng. (13): 125-141 (1997). Web SearchBibTeXDownload
1996
96A Temporal Join Mechanism Based on Trie-Ranking Data Structure. C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D. C. Lin. CODAS 1996, 428-435. Web SearchBibTeX
95Optimal Linear Hashing Files for Orthogonal Range Retrieval. C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D. C. Lin. COMPSAC 1996, 406-413. Web SearchBibTeXDownload
94The Weighted Perfect Domination Problem and Its Variants. Chain-Chin Yen, Richard C. T. Lee. Discrete Applied Mathematics (66): 147-160 (1996). Web SearchBibTeXDownload
1995
93New Public-Key Cipher System Based Upon the Diophantine Equations. Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee. IEEE Trans. Computers (44): 13-19 (1995). Web SearchBibTeXDownload
92A Generalized Mapping of 2-d Array Processor to Linear Array Processor and its Applications. Kuo-Liang Chung, Richard C. T. Lee, Yu-Chih Lin. Parallel Algorithms Appl. (6): 241-257 (1995). Web SearchBibTeXDownload
91A near pattern-matching scheme based upon principal component analysis. C. Y. Chen, Chin-Chen Chang, Richard Chia-Tung Lee. Pattern Recognition Letters (16): 339-345 (1995). Web SearchBibTeXDownload
1994
90Recognizing Shortest-Path Trees in Linear Time. Chen-Hsing Peng, Jia-Shung Wang, Richard C. T. Lee. Inf. Process. Lett. (52): 77-85 (1994). Web SearchBibTeXDownload
89An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons. Bern-Cherng Liaw, Richard C. T. Lee. Inf. Process. Lett. (52): 69-75 (1994). Web SearchBibTeXDownload
88Generating All Maximal Independent Sets on Trees in Lexicographic Order. Y. H. Chang, Jia-Shung Wang, Richard C. T. Lee. Inf. Sci. (76): 279-296 (1994). Web SearchBibTeXDownload
87Optimal Multiple Key Hashing Files for Orthogonal Range Queries. J. Liang, Chin-Chen Chang, Ron McFadyen, Richard C. T. Lee. Inf. Sci. (79): 145-158 (1994). Web SearchBibTeXDownload
86Single Step Searching in Weighted Block Graphs. Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang, Richard C. T. Lee. Inf. Sci. (81): 1-29 (1994). Web SearchBibTeXDownload
1993
85The Slab Dividing Approach To Solve the Euclidean P-Center Problem. R. Z. Hwang, Richard C. T. Lee, R. C. Chang. Algorithmica (9): 1-22 (1993). Web SearchBibTeXDownload
84The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. R. Z. Hwang, R. C. Chang, Richard C. T. Lee. Algorithmica (9): 398-423 (1993). Web SearchBibTeXDownload
83The Minimum Cooperative Guards Problem on K-spiral Polygons. Bern-Cherng Liaw, N. F. Huang, Richard C. T. Lee. CCCG 1993, 97-102. Web SearchBibTeX
82An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem. D. P. Wang, Richard C. T. Lee. CCCG 1993, 334-339. Web SearchBibTeX
81Optimal MMI file systems for orthogonal range retrieval. C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee. Inf. Syst. (18): 37-54 (1993). Web SearchBibTeXDownload
80Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications. D. P. Wang, N. F. Huang, H. S. Chao, Richard C. T. Lee. ISAAC 1993, 515-522. Web SearchBibTeXDownload
79A Different Approach for Solving the Specified Diameter Partition Problem. Chiou-Kuo Liang, Chuan Yi Tang, Richard C. T. Lee. J. Inf. Sci. Eng. (9): 337-357 (1993). Web SearchBibTeXDownload
78Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments. Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee. Parallel Algorithms Appl. (1): 83-98 (1993). Web SearchBibTeXDownload
1992
77Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs. Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee. Algorithmica (8): 177-194 (1992). Web SearchBibTeXDownload
76An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving. T. H. Hu, Chuan Yi Tang, Richard C. T. Lee. Ann. Math. Artif. Intell. (6): 235-251 (1992). Web SearchBibTeXDownload
75Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and N-Step SCAN. Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee. BIT (32): 546-558 (1992). Web SearchBibTeX
74A Record-Oriented Cryptosystem for Database Sharing (Short Note). Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee. Comput. J. (35): 658-660 (1992). Web SearchBibTeXDownload
73Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs. Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee. Discrete Applied Mathematics (39): 1-12 (1992). Web SearchBibTeXDownload
72Generating All Maximal Independent Sets on Trees in Lexicographic Order. Y. H. Chang, Jia-Shung Wang, Richard C. T. Lee. ICCI 1992, 34-37. Web SearchBibTeX
71Special Subgraphs of Weighted Visibility Graphs. Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang. Inf. Process. Lett. (43): 69-75 (1992). Web SearchBibTeXDownload
70Hierarchy representations based on arithmetic coding for dynamic information protection systems. Chin-Chen Chang, Chu-Hsing Lin, Richard C. T. Lee. Inf. Sci. (64): 35-48 (1992). Web SearchBibTeXDownload
69Computing the convex hull in a hammock. Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang. Inf. Sci. (59): 103-119 (1992). Web SearchBibTeXDownload
68A conference key broadcasting system using sealed locks. Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee. Inf. Syst. (17): 323-328 (1992). Web SearchBibTeXDownload
67Parallel algorithms for computing the closest visible vertex pair between two polygons. Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee. Int. J. Comput. Geometry Appl. (2): 135-162 (1992). Web SearchBibTeXDownload
66The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. R. Z. Hwang, Richard C. T. Lee. ISAAC 1992, 51-60. Web SearchBibTeXDownload
1991
65Transformation completeness properties of SVPC transformation sets. Shen-Chuan Tai, M. W. Du, Richard C. T. Lee. Discrete Applied Mathematics (32): 263-273 (1991). Web SearchBibTeXDownload
64Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models. Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen. ICCI 1991, 350-359. Web SearchBibTeXDownload
63Minimum Spanning Trees of Moving Points in the Plane. Jyh-Jong Fu, Richard C. T. Lee. IEEE Trans. Computers (40): 113-118 (1991). Web SearchBibTeXDownload
62A transformational approach to synthesizing combinational circuits. Shen-Chuan Tai, M. W. Du, Richard C. T. Lee. IEEE Trans. on CAD of Integrated Circuits and Systems (10): 286-295 (1991). Web SearchBibTeXDownload
61On weighted rectilinear 2-center and 3-center problems. Ming-Tat Ko, Richard C. T. Lee. Inf. Sci. (54): 169-190 (1991). Web SearchBibTeXDownload
60On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks. C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee. Inf. Syst. (16): 613-625 (1991). Web SearchBibTeXDownload
59Password authentication using Newton's interpolating polynomials. Chu-Hsing Lin, Chin-Chen Chang, Tzong-Chen Wu, Richard C. T. Lee. Inf. Syst. (16): 97-102 (1991). Web SearchBibTeXDownload
58Voronoi diagrams of moving points in the plane. Jyh-Jong Fu, Richard C. T. Lee. Int. J. Comput. Geometry Appl. (1): 23-32 (1991). Web SearchBibTeXDownload
57Covering convex rectilinear polygons in linear time. W. T. Liou, Chuan Yi Tang, Richard C. T. Lee. Int. J. Comput. Geometry Appl. (1): 137-185 (1991). Web SearchBibTeXDownload
56An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm. T. H. Hu, Chuan Yi Tang, Richard C. T. Lee. ISA 1991, 116-126. Web SearchBibTeXDownload
1990
55An Optimal Approximation Algorithm for the Rectilinear m-Center Problem. Ming-Tat Ko, Richard C. T. Lee, Jyun-Sheng Chang. Algorithmica (5): 341-352 (1990). Web SearchBibTeXDownload
54On the continuous working problem. Ruay Shiung Chang, Richard C. T. Lee. Discrete Applied Mathematics (28): 93-109 (1990). Web SearchBibTeXDownload
53Voronoi Diagrams of Moving Points in the Plane. Jyh-Jong Fu, Richard C. T. Lee. FSTTCS 1990, 238-254. Web SearchBibTeXDownload
52An Optimal Parallel Algorithm for Minimum Coloring of Intervals. Ming-Shing Yu, C. L. Chen, Richard C. T. Lee. ICPP (3) 1990, 162-168. Web SearchBibTeX
51An Efficient Channel Routing Algorithm to Yield an Optimal Solution. Jia-Shung Wang, Richard C. T. Lee. IEEE Trans. Computers (39): 957-962 (1990). Web SearchBibTeXDownload
50A Parallel Algorithm for Solving Sparse Triangular Systems. Chin-Wen Ho, Richard C. T. Lee. IEEE Trans. Computers (39): 848-852 (1990). Web SearchBibTeXDownload
49Parallel Graph Algorithms Based Upon Broadcast Communications. Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen. IEEE Trans. Computers (39): 1468-1472 (1990). Web SearchBibTeXDownload
48Minimum rectangular partition problem for simple rectilinear polygons. W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee. IEEE Trans. on CAD of Integrated Circuits and Systems (9): 720-733 (1990). Web SearchBibTeXDownload
47The Weighted Perfect Domination Problem. Chain-Chin Yen, Richard C. T. Lee. Inf. Process. Lett. (35): 295-299 (1990). Web SearchBibTeXDownload
46A Dynamic Access Control Mechanism in Information Protection Systems. Chu-Hsing Lin, Richard C. T. Lee, Chin-Chen Chang. J. Inf. Sci. Eng. (6): 25-35 (1990). Web SearchBibTeXDownload
45The vectorization of the partition problem. Shyong Jian Shyu, Richard C. T. Lee. Parallel Computing (16): 343-350 (1990). Web SearchBibTeXDownload
44Solving the set cover problem on a supercomputer. Shyong Jian Shyu, Richard C. T. Lee. Parallel Computing (13): 295-300 (1990). Web SearchBibTeXDownload
43A parallel algorithm for finding congruent regions. Chin-Laung Lei, Richard C. T. Lee, S. N. Yang. Parallel Computing (13): 135-142 (1990). Web SearchBibTeXDownload
4220-Relative Neighborhood Graphs Are Hamiltonian. Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee. SIGAL International Symposium on Algorithms 1990, 53-65. Web SearchBibTeXDownload
1989
41A systolic algorithm for extracting regions from a planar graph. Zen-Chung Shih, Richard C. T. Lee, S. N. Yang. Computer Vision, Graphics, and Image Processing (47): 227-242 (1989). Web SearchBibTeXDownload
40The Number of Intersections Between Two Rectangular Paths. Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang. IEEE Trans. Computers (38): 1564-1571 (1989). Web SearchBibTeXDownload
39Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel. Chin-Wen Ho, Richard C. T. Lee. Inf. Process. Lett. (31): 61-68 (1989). Web SearchBibTeXDownload
38A Fault-Tolerance Strategy for Pyramid Architecture. Kuo-Liang Chung, Ferng-Ching Lin, Richard C. T. Lee. J. Inf. Sci. Eng. (5): 105-121 (1989). Web SearchBibTeXDownload
37Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time. W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee. Symposium on Computational Geometry 1989, 344-353. Web SearchBibTeXDownload
1988
36On a scheduling problem where a job can be executed only by a limited number of processors. R. S. Chang, Richard C. T. Lee. Computers & OR (15): 471-478 (1988). Web SearchBibTeXDownload
35Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs. Chin-Wen Ho, Richard C. T. Lee. Inf. Process. Lett. (28): 301-309 (1988). Web SearchBibTeXDownload
1987
34A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems. Gen-Huey Chen, Maw-Sheng Chern, Richard C. T. Lee. BIT (27): 141-147 (1987). Web SearchBibTeX
33Systolic Algorithms to Examine All Pairs of Elements. Zen-Cheung Shih, Gen-Huey Chen, Richard C. T. Lee. Commun. ACM (30): 161-167 (1987). Cited by 19Web SearchBibTeXDownload
1986
32An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane. R. C. Chang, Richard C. T. Lee. BIT (26): 7-16 (1986). Web SearchBibTeX
31A Letter-Oriented Minimal Perfect Hashing Scheme. Chin-Chen Chang, Richard C. T. Lee. Comput. J. (29): 277-281 (1986). Web SearchBibTeXDownload
30The mapping of 2-D array processors to 1-D array processors. Chang-Biau Yang, Richard C. T. Lee. Parallel Computing (3): 217-229 (1986). Web SearchBibTeXDownload
29The Idea of De-Clustering and its Applications. M. T. Fang, Richard C. T. Lee, Chin-Chen Chang. VLDB 1986, 181-188. Web SearchBibTeXDownload
1985
28On the complexity of some multi-attribute file design problems. Chuan Yi Tang, D. J. Fuehrer, Richard C. T. Lee. Inf. Syst. (10): 21-25 (1985). Web SearchBibTeXDownload
27A parallel sorting scheme whose basic operation sortsN elements. S. S. Tseng, Richard C. T. Lee. International Journal of Parallel Programming (14): 455-467 (1985). Web SearchBibTeXDownload
26The Optimality of the Number of k-Sorters of a Parallel Merging Algorithm. S. S. Tseng, Richard C. T. Lee. J. Inf. Sci. Eng. (1): 59-71 (1985). Web SearchBibTeXDownload
1984
25A Parallel Algorithm to Solve the Stable Marriage Problem. S. S. Tseng, Richard C. T. Lee. BIT (24): 308-316 (1984). Web SearchBibTeX
24On the Average Length of Delaunay Triangulations. R. C. Chang, Richard C. T. Lee. BIT (24): 269-273 (1984). Web SearchBibTeX
23A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations. S. S. Tseng, Richard C. T. Lee. BIT (24): 187-195 (1984). Web SearchBibTeX
22Performance Analyses of Cartesian Product Files and Random Files. Chin-Chen Chang, M. W. Du, Richard C. T. Lee. IEEE Trans. Software Eng. (10): 88-99 (1984). Web SearchBibTeXDownload
21Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy. Chuan Yi Tang, Richard C. T. Lee. Inf. Sci. (32): 173-186 (1984). Web SearchBibTeXDownload
1983
20The hierarchical ordering in multiattribute files. Chin-Chen Chang, M. W. Du, Richard C. T. Lee. Inf. Sci. (31): 41-75 (1983). Web SearchBibTeXDownload
1982
19Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries. Chin-Chen Chang, Richard C. T. Lee, M. W. Du. IEEE Trans. Software Eng. (8): 235-249 (1982). Web SearchBibTeXDownload
1980
18Some Properties of Cartesian Product Files. Chin-Chen Chang, Richard C. T. Lee, David Hung-Chang Du. SIGMOD Conference 1980, 157-168. Web SearchBibTeXDownload
1979
17Common Properties of Some Multiattribute File Systems. W. C. Lin, Richard C. T. Lee, David Hung-Chang Du. IEEE Trans. Software Eng. (5): 160-174 (1979). Web SearchBibTeXDownload
1978
16Towards Automatic Auditing of Records. Richard C. T. Lee, James R. Slagle, C. T. Mong. IEEE Trans. Software Eng. (4): 441-448 (1978). Web SearchBibTeXDownload
1977
15A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space. Richard C. T. Lee, James R. Slagle, H. Blum. IEEE Trans. Computers (26): 288-292 (1977). Web SearchBibTeXDownload
14Storage Reduction Through Minimal Spanning Trees and Spanning Forests. Andy N. C. Kang, Richard C. T. Lee, Chin-Liang Chang, Shi-Kuo Chang. IEEE Trans. Computers (26): 425-434 (1977). Web SearchBibTeXDownload
1976
13Application of Clustering to Estimate Missing Data and Improve Data Integrity. Richard C. T. Lee, James R. Slagle, C. T. Mong. ICSE 1976, 539-544. Web SearchBibTeXDownload
12Application of Principal Component Analysis to Multikey Searching. Richard C. T. Lee, Y. H. Chin, S. C. Chang. IEEE Trans. Software Eng. (2): 185-193 (1976). Web SearchBibTeXDownload
1975
11D. Michie, On Machine Intelligence. Richard C. T. Lee. Artif. Intell. (6): 213-214 (1975). Web SearchBibTeX
1974
10An Improved Program-Synthesizing Algorithm and Its Correctness. Richard C. T. Lee, Chin-Liang Chang, Richard J. Waldinger. Commun. ACM (17): 211-217 (1974). Web SearchBibTeXDownload
9Experiments with some cluster analysis algorithms. James R. Slagle, Chin-Liang Chang, Richard C. T. Lee. Pattern Recognition (6): 181-187 (1974). Web SearchBibTeXDownload
1973
8The Specialization of Programs by Theorem Proving. Chin-Liang Chang, Richard C. T. Lee, John K. Dixon. SIAM J. Comput. (2): 7-15 (1973). Web SearchBibTeXDownload
1972
7Fuzzy Logic and the Resolution Principle. Richard C. T. Lee. J. ACM (19): 109-119 (1972). Web SearchBibTeXDownload
1971
6Application of Game Tree Searching Techniques to Sequential Pattern Recognition. James R. Slagle, Richard C. T. Lee. Commun. ACM (14): 103-110 (1971). Web SearchBibTeXDownload
5Fuzzy Logic and the Resolution Principle. Richard C. T. Lee. IJCAI 1971, 560-567. Web SearchBibTeX
4Some Properties of Fuzzy Logic. Richard C. T. Lee, Chin-Liang Chang. Information and Control (19): 417-431 (1971). Web SearchBibTeXDownload
3On the Optimal Solutions to AND/OR Series-Parallel Graphs. Richard Simon, Richard C. T. Lee. J. ACM (18): 354-372 (1971). Web SearchBibTeXDownload
1969
2PROW: A Step Toward Automatic Program Writing. Richard J. Waldinger, Richard C. T. Lee. IJCAI 1969, 241-252. Web SearchBibTeX
1Completeness Theorems for Semantic Resolution in Consequence-Finding. James R. Slagle, Chin-Liang Chang, Richard C. T. Lee. IJCAI 1969, 281-286. Web SearchBibTeX
from DBLP and Google Scholar
  • Also known as: Richard Chia-Tung Lee
Developed by the Database Group at the University of Wisconsin and Yahoo! Research