default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard C. T. Lee
Richard Chia-Tung Lee
Person information
- affiliation: National Tsing Hua University, Department of Computer Science, Hsinchu, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1973
[b1]Chin-Liang Chang, Richard C. T. Lee:
Symbolic logic and mechanical theorem proving. Computer science classics, Academic Press 1973, ISBN 978-0-12-170350-9, pp. I-XIII, 1-331
Journal Articles
- 2021
- [j104]Yi-Kung Shieh, Shyong Jian Shyu, Chin Lung Lu, Richard Chia-Tung Lee:
The exact multiple pattern matching problem solved by a reference tree approach. Theor. Comput. Sci. 882: 29-48 (2021) - 2015
- [j103]Chia Shin Ou, Chin Lung Lu, Richard C. T. Lee:
A Systematical and Parallel Approach to Solve Problems Involving Special Properties of Bit-Vectors. Comput. J. 58(5): 1112-1121 (2015) - 2014
- [j102]Kuei-Hao Chen, Guan-Shieng Huang, Richard Chia-Tung Lee:
Bit-Parallel Algorithms for Exact Circular String Matching. Comput. J. 57(5): 731-743 (2014) - [j101]Hung-Jr Shiu
, S. Y. Tang, Chien-Hung Huang, Richard C. T. Lee, Chin-Laung Lei:
A reversible acoustic data hiding method based on analog modulation. Inf. Sci. 273: 233-246 (2014) - 2013
- [j100]Chia Wei Lu, Chin Lung Lu, Richard C. T. Lee:
A new filtration method and a hybrid strategy for approximate string matching. Theor. Comput. Sci. 481: 9-17 (2013) - 2010
- [j99]Hung-Jr Shiu, Ka-Lok Ng, Jywe-Fei Fang, Richard C. T. Lee, Chien-Hung Huang:
Data hiding methods based upon DNA sequences. Inf. Sci. 180(11): 2196-2208 (2010) - 2008
- [j98]Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee:
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. J. Complex. 24(2): 173-184 (2008) - 2007
- [j97]Jia Jie Liu, Guan-Shieng Huang, Yue-Li Wang, Richard C. T. Lee:
Edit distance for a run-length-encoded string and an uncompressed string. Inf. Process. Lett. 105(1): 12-16 (2007) - 2005
- [j96]Fang-Rong Hsu, Man-Kwan Shan, H. S. Chao, Richard C. T. Lee:
Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs. J. Inf. Sci. Eng. 21(3): 627-642 (2005) - [j95]Quincy Wu, Chin Lung Lu, Richard Chia-Tung Lee:
The approximability of the weighted Hamiltonian path completion problem on a tree. Theor. Comput. Sci. 341(1-3): 385-397 (2005) - 2004
- [j94]Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee:
The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction. J. Comb. Optim. 8(4): 453-468 (2004) - 2003
- [j93]Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee:
The full Steiner tree problem. Theor. Comput. Sci. 306(1-3): 55-67 (2003) - 2000
- [j92]H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee:
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discret. Appl. Math. 102(3): 159-173 (2000) - 1999
- [j91]Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee:
An Optimal Embedding of Cycles into Incomplete Hypercubes. Inf. Process. Lett. 72(5-6): 213-218 (1999) - 1998
- [j90]Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee:
The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65(3): 119-123 (1998) - 1997
- [j89]H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee:
An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs. Inf. Process. Lett. 61(6): 311-316 (1997) - [j88]C. Y. Chen, H. F. Lin, Chin-Chen Chang, Richard C. T. Lee:
Multidisk Smaller Sized MKH file Allocation for Partial Match Retrieval. J. Inf. Sci. Eng. 13(1): 125-141 (1997) - [j87]C. Y. Chen, H. F. Lin, Chin-Chen Chang, Richard C. T. Lee:
Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval. IEEE Trans. Knowl. Data Eng. 9(1): 148-160 (1997) - 1996
- [j86]Chain-Chin Yen, Richard C. T. Lee:
The Weighted Perfect Domination Problem and Its Variants. Discret. Appl. Math. 66(2): 147-160 (1996) - [j85]C. Y. Chen, H. F. Lin, Richard C. T. Lee, Chin-Chen Chang:
Redundant MKH Files Design among Multiple Disks for Concurrent Partial Match Retrieval. J. Syst. Softw. 35(3): 199-207 (1996) - 1995
- [j84]Kuo-Liang Chung, Richard C. T. Lee, Yu-Chih Lin:
A Generalized Mapping of 2-d Array Processor to Linear Array Processor and its Applications. Parallel Algorithms Appl. 6(4): 241-257 (1995) - [j83]C. Y. Chen, Chin-Chen Chang, Richard Chia-Tung Lee:
A near pattern-matching scheme based upon principal component analysis. Pattern Recognit. Lett. 16(4): 339-345 (1995) - [j82]Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee:
New Public-Key Cipher System Based Upon the Diophantine Equations. IEEE Trans. Computers 44(1): 13-19 (1995) - 1994
- [j81]Bern-Cherng Liaw, Richard C. T. Lee:
An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons. Inf. Process. Lett. 52(2): 69-75 (1994) - [j80]Chen-Hsing Peng, Jia-Shung Wang, Richard C. T. Lee:
Recognizing Shortest-Path Trees in Linear Time. Inf. Process. Lett. 52(2): 77-85 (1994) - [j79]Y. H. Chang, Jia-Shung Wang, Richard C. T. Lee:
Generating All Maximal Independent Sets on Trees in Lexicographic Order. Inf. Sci. 76(3-4): 279-296 (1994) - [j78]J. Liang, Chin-Chen Chang, Ron McFadyen, Richard C. T. Lee:
Optimal Multiple Key Hashing Files for Orthogonal Range Queries. Inf. Sci. 79(1-2): 145-158 (1994) - [j77]Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang, Richard C. T. Lee:
Single Step Searching in Weighted Block Graphs. Inf. Sci. 81(1-2): 1-29 (1994) - [j76]C. Y. Lee, Jia-Shung Wang, Richard C. T. Lee:
Characteristics of the Hopfield associative memory utilizing isomorphism relations. IEEE Trans. Neural Networks 5(3): 523-526 (1994) - 1993
- [j75]R. Z. Hwang, Richard C. T. Lee, R. C. Chang:
The Slab Dividing Approach To Solve the Euclidean P-Center Problem. Algorithmica 9(1): 1-22 (1993) - [j74]R. Z. Hwang, R. C. Chang, Richard C. T. Lee:
The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. Algorithmica 9(4): 398-423 (1993) - [j73]C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee:
Optimal MMI file systems for orthogonal range retrieval. Inf. Syst. 18(1): 37-54 (1993) - [j72]Chiou-Kuo Liang, Chuan Yi Tang, Richard C. T. Lee:
A Different Approach for Solving the Specified Diameter Partition Problem. J. Inf. Sci. Eng. 9(3): 337-357 (1993) - [j71]Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee:
Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments. Parallel Algorithms Appl. 1(2): 83-98 (1993) - 1992
- [j70]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs. Algorithmica 8(3): 177-194 (1992) - [j69]T. H. Hu, Chuan Yi Tang, Richard C. T. Lee:
An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving. Ann. Math. Artif. Intell. 6(1-3): 235-251 (1992) - [j68]Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee:
Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and N-Step SCAN. BIT 32(4): 546-558 (1992) - [j67]Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee:
A Record-Oriented Cryptosystem for Database Sharing (Short Note). Comput. J. 35(6): 658-660 (1992) - [j66]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs. Discret. Appl. Math. 39(1): 1-12 (1992) - [j65]Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee:
Parallel algorithms for computing the closest visible vertex pair between two polygons. Int. J. Comput. Geom. Appl. 2(2): 135-162 (1992) - [j64]Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang:
Special Subgraphs of Weighted Visibility Graphs. Inf. Process. Lett. 43(2): 69-75 (1992) - [j63]Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee:
A conference key broadcasting system using sealed locks. Inf. Syst. 17(4): 323-328 (1992) - [j62]Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang:
Computing the convex hull in a hammock. Inf. Sci. 59(1-2): 103-119 (1992) - [j61]Chin-Chen Chang, Chu-Hsing Lin, Richard C. T. Lee:
Hierarchy representations based on arithmetic coding for dynamic information protection systems. Inf. Sci. 64(1-2): 35-48 (1992) - 1991
- [j60]Shen-Chuan Tai, M. W. Du, Richard C. T. Lee:
Transformation completeness properties of SVPC transformation sets. Discret. Appl. Math. 32(3): 263-273 (1991) - [j59]Jyh-Jong Fu, Richard C. T. Lee:
Voronoi diagrams of moving points in the plane. Int. J. Comput. Geom. Appl. 1(1): 23-32 (1991) - [j58]W. T. Liou, Chuan Yi Tang, Richard C. T. Lee:
Covering convex rectilinear polygons in linear time. Int. J. Comput. Geom. Appl. 1(2): 137-185 (1991) - [j57]Chu-Hsing Lin, Chin-Chen Chang, Tzong-Chen Wu, Richard C. T. Lee:
Password authentication using Newton's interpolating polynomials. Inf. Syst. 16(1): 97-102 (1991) - [j56]C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee:
On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks. Inf. Syst. 16(6): 613-625 (1991) - [j55]Ming-Tat Ko, Richard C. T. Lee:
On weighted rectilinear 2-center and 3-center problems. Inf. Sci. 54(1-2): 169-190 (1991) - [j54]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
20-relative neighborhood graphs are hamiltonian. J. Graph Theory 15(5): 543-557 (1991) - [j53]Jyh-Jong Fu, Richard C. T. Lee:
Minimum Spanning Trees of Moving Points in the Plane. IEEE Trans. Computers 40(1): 113-118 (1991) - [j52]Shen-Chuan Tai, M. W. Du, Richard C. T. Lee:
A transformational approach to synthesizing combinational circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(3): 286-295 (1991) - 1990
- [j51]Ming-Tat Ko, Richard C. T. Lee, Jyun-Sheng Chang:
An Optimal Approximation Algorithm for the Rectilinear m-Center Problem. Algorithmica 5(3): 341-352 (1990) - [j50]Ruay Shiung Chang, Richard C. T. Lee:
On the continuous working problem. Discret. Appl. Math. 28(2): 93-109 (1990) - [j49]Chain-Chin Yen, Richard C. T. Lee:
The Weighted Perfect Domination Problem. Inf. Process. Lett. 35(6): 295-299 (1990) - [j48]Chu-Hsing Lin, Richard C. T. Lee, Chin-Chen Chang:
A Dynamic Access Control Mechanism in Information Protection Systems. J. Inf. Sci. Eng. 6(1): 25-35 (1990) - [j47]Zen-Cheung Shih, Richard C. T. Lee, S. N. Yang:
A parallel algorithm for finding congruent regions. Parallel Comput. 13(2): 135-142 (1990) - [j46]Shyong Jian Shyu, Richard C. T. Lee:
Solving the set cover problem on a supercomputer. Parallel Comput. 13(3): 295-300 (1990) - [j45]Shyong Jian Shyu, Richard C. T. Lee:
The vectorization of the partition problem. Parallel Comput. 16(2-3): 343-350 (1990) - [j44]Chin-Wen Ho, Richard C. T. Lee:
A Parallel Algorithm for Solving Sparse Triangular Systems. IEEE Trans. Computers 39(6): 848-852 (1990) - [j43]Jia-Shung Wang, Richard C. T. Lee:
An Efficient Channel Routing Algorithm to Yield an Optimal Solution. IEEE Trans. Computers 39(7): 957-962 (1990) - [j42]Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen:
Parallel Graph Algorithms Based Upon Broadcast Communications. IEEE Trans. Computers 39(12): 1468-1472 (1990) - [j41]W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee:
Minimum rectangular partition problem for simple rectilinear polygons. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(7): 720-733 (1990) - 1989
- [j40]Cheng-I Yang, Jia-Shung Wang, Richard Chia-Tung Lee:
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile. Comput. Oper. Res. 16(3): 257-269 (1989) - [j39]Zen-Chung Shih, Richard C. T. Lee, S. N. Yang:
A systolic algorithm for extracting regions from a planar graph. Comput. Vis. Graph. Image Process. 47(2): 227-242 (1989) - [j38]Chin-Wen Ho, Richard C. T. Lee:
Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel. Inf. Process. Lett. 31(2): 61-68 (1989) - [j37]Kuo-Liang Chung, Ferng-Ching Lin, Richard C. T. Lee:
A Fault-Tolerance Strategy for Pyramid Architecture. J. Inf. Sci. Eng. 5(2): 105-121 (1989) - [j36]Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang:
The Number of Intersections Between Two Rectangular Paths. IEEE Trans. Computers 38(11): 1564-1571 (1989) - 1988
- [j35]R. S. Chang, Richard C. T. Lee:
On a scheduling problem where a job can be executed only by a limited number of processors. Comput. Oper. Res. 15(5): 471-478 (1988) - [j34]Chin-Wen Ho, Richard C. T. Lee:
Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs. Inf. Process. Lett. 28(6): 301-309 (1988) - 1987
- [j33]Gen-Huey Chen, Maw-Sheng Chern, Richard C. T. Lee:
A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems. BIT 27(2): 141-147 (1987) - [j32]Zen-Cheung Shih, Gen-Huey Chen, Richard C. T. Lee:
Systolic Algorithms to Examine All Pairs of Elements. Commun. ACM 30(2): 161-167 (1987) - [j31]C. W. Shen, Richard C. T. Lee, Y. H. Chin:
A Parallel nonlinear Mapping Algorithm. Int. J. Pattern Recognit. Artif. Intell. 1(1): 53-70 (1987) - 1986
- [j30]R. C. Chang, Richard C. T. Lee:
An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane. BIT 26(1): 7-16 (1986) - [j29]Chin-Chen Chang, Richard C. T. Lee:
A Letter-Oriented Minimal Perfect Hashing Scheme. Comput. J. 29(3): 277-281 (1986) - [j28]Chang-Biau Yang, Richard C. T. Lee:
The mapping of 2-D array processors to 1-D array processors. Parallel Comput. 3(3): 217-229 (1986) - 1985
- [j27]S. S. Tseng, Richard C. T. Lee:
A parallel sorting scheme whose basic operation sortsN elements. Int. J. Parallel Program. 14(6): 455-467 (1985) - [j26]Chuan Yi Tang, D. J. Fuehrer, Richard C. T. Lee:
On the complexity of some multi-attribute file design problems. Inf. Syst. 10(1): 21-25 (1985) - [j25]S. S. Tseng, Richard C. T. Lee:
The Optimality of the Number of k-Sorters of a Parallel Merging Algorithm. J. Inf. Sci. Eng. 1(1): 59-71 (1985) - 1984
- [j24]S. S. Tseng, Richard C. T. Lee:
A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations. BIT 24(2): 187-195 (1984) - [j23]R. C. Chang, Richard C. T. Lee:
On the Average Length of Delaunay Triangulations. BIT 24(3): 269-273 (1984) - [j22]S. S. Tseng, Richard C. T. Lee:
A Parallel Algorithm to Solve the Stable Marriage Problem. BIT 24(3): 308-316 (1984) - [j21]Chuan Yi Tang, Richard C. T. Lee:
Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy. Inf. Sci. 32(3): 173-186 (1984) - [j20]Chin-Chen Chang, M. W. Du, Richard C. T. Lee:
Performance Analyses of Cartesian Product Files and Random Files. IEEE Trans. Software Eng. 10(1): 88-99 (1984) - 1983
- [j19]Chin-Chen Chang, M. W. Du, Richard C. T. Lee:
The hierarchical ordering in multiattribute files. Inf. Sci. 31(1): 41-75 (1983) - 1982
- [j18]Chin-Chen Chang, Richard C. T. Lee, M. W. Du:
Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries. IEEE Trans. Software Eng. 8(3): 235-249 (1982) - 1980
- [j17]David H. C. Du, Richard C. T. Lee:
Symbolic Gray Code as a Multikey Hashing Function. IEEE Trans. Pattern Anal. Mach. Intell. 2(1): 83-90 (1980) - 1979
- [j16]W. C. Lin, Richard C. T. Lee, David Hung-Chang Du:
Common Properties of Some Multiattribute File Systems. IEEE Trans. Software Eng. 5(2): 160-174 (1979) - 1978
- [j15]Richard C. T. Lee, James R. Slagle, C. T. Mong:
Towards Automatic Auditing of Records. IEEE Trans. Software Eng. 4(5): 441-448 (1978) - 1977
- [j14]Richard C. T. Lee, James R. Slagle, H. Blum:
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space. IEEE Trans. Computers 26(3): 288-292 (1977) - [j13]Andy N. C. Kang, Richard C. T. Lee, Chin-Liang Chang, Shi-Kuo Chang:
Storage Reduction Through Minimal Spanning Trees and Spanning Forests. IEEE Trans. Computers 26(5): 425-434 (1977) - 1976
- [j12]Richard C. T. Lee, Y. H. Chin, S. C. Chang:
Application of Principal Component Analysis to Multikey Searching. IEEE Trans. Software Eng. 2(3): 185-193 (1976) - 1975
- [j11]Richard C. T. Lee:
D. Michie, On Machine Intelligence. Artif. Intell. 6(2): 213-214 (1975) - 1974
- [j10]Richard C. T. Lee, Chin-Liang Chang, Richard J. Waldinger:
An Improved Program-Synthesizing Algorithm and Its Correctness. Commun. ACM 17(4): 211-217 (1974) - [j9]James R. Slagle, Chin-Liang Chang, Richard C. T. Lee:
Experiments with some cluster analysis algorithms. Pattern Recognit. 6(3-4): 181-187 (1974) - 1973
- [j8]Chin-Liang Chang, Richard C. T. Lee, John K. Dixon:
The Specialization of Programs by Theorem Proving. SIAM J. Comput. 2(1): 7-15 (1973) - [j7]Chin-Liang Chang, Richard C. T. Lee:
A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis. IEEE Trans. Syst. Man Cybern. 3(2): 197-200 (1973) - 1972
- [j6]Richard C. T. Lee:
An algorithm to generate prime implicants and its application to the selection problem. Inf. Sci. 4(3-4): 251-259 (1972) - [j5]Richard C. T. Lee:
Fuzzy Logic and the Resolution Principle. J. ACM 19(1): 109-119 (1972) - 1971
- [j4]James R. Slagle, Richard C. T. Lee:
Application of Game Tree Searching Techniques to Sequential Pattern Recognition. Commun. ACM 14(2): 103-110 (1971) - [j3]Richard C. T. Lee, Chin-Liang Chang:
Some Properties of Fuzzy Logic. Inf. Control. 19(5): 417-431 (1971) - [j2]Richard Simon, Richard C. T. Lee:
On the Optimal Solutions to AND/OR Series-Parallel Graphs. J. ACM 18(2): 354-372 (1971) - 1970
- [j1]James R. Slagle, Chin-Liang Chang, Richard C. T. Lee:
A New Algorithm for Generating Prime Implicants. IEEE Trans. Computers 19(4): 304-310 (1970)
Conference and Workshop Papers
- 2014
- [c34]Yi Kung Shieh, Richard C. T. Lee:
An Efficient Algorithm to Solve the Nearest Neighbor Searching Problem. ICS 2014: 112-121 - 2004
- [c33]Richard C. T. Lee:
Application of Visual Display Techniques to Solve Some Biological Problems. BIBE 2004: 493-496 - [c32]M. C. Chen, Richard C. T. Lee:
Sorting by Transpositions Based on the First Increasing Substring Concept. BIBE 2004: 553-560 - 2003
- [c31]Natalius Huang, Herng-Yow Chen, Richard C. T. Lee:
Web-Based Synchronized Multimedia System Design for Teaching/Learning Chinese as a Foreign Language. KES 2003: 201-207 - 2002
- [c30]Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee:
The Full Steiner Tree Problem in Phylogeny. COCOON 2002: 107-116 - 2000
- [c29]Q. S. Wu, Chin Lung Lu, Richard C. T. Lee:
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree. ISAAC 2000: 156-167 - 1999
- [c28]Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee, Jywe-Fei Fang:
An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes. ISPAN 1999: 80-87 - 1998
- [c27]H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee:
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. COCOON 1998: 309-318 - 1997
- [c26]Richard C. T. Lee:
Approximation Algorithms. ISPAN 1997: 232 - 1996
- [c25]C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D. C. Lin:
A Temporal Join Mechanism Based on Trie-Ranking Data Structure. CODAS 1996: 428-435 - [c24]C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D. C. Lin:
Optimal Linear Hashing Files for Orthogonal Range Retrieval. COMPSAC 1996: 406-413 - 1994
- [c23]J. S. Lin, Fang-Rong Hsu, Richard C. T. Lee:
A parallel algorithm for the single step searching problem. ISPAN 1994: 278-285 - 1993
- [c22]Bern-Cherng Liaw, N. F. Huang, Richard C. T. Lee:
The Minimum Cooperative Guards Problem on K-spiral Polygons. CCCG 1993: 97-102 - [c21]D. P. Wang, Richard C. T. Lee:
An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem. CCCG 1993: 334-339 - [c20]D. P. Wang, N. F. Huang, H. S. Chao, Richard C. T. Lee:
Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications. ISAAC 1993: 515-522 - 1992
- [c19]Y. H. Chang, Jia-Shung Wang, Richard C. T. Lee:
Generating All Maximal Independent Sets on Trees in Lexicographic Order. ICCI 1992: 34-37 - [c18]R. Z. Hwang, Richard C. T. Lee:
The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. ISAAC 1992: 51-60 - 1991
- [c17]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
A unified approach for solving bottleneck k-bipartition problems. ACM Conference on Computer Science 1991: 39-47 - [c16]Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen:
Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models. ICCI 1991: 350-359 - [c15]T. H. Hu, Chuan Yi Tang, Richard C. T. Lee:
An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm. ISA 1991: 116-126 - 1990
- [c14]Jyh-Jong Fu, Richard C. T. Lee:
Voronoi Diagrams of Moving Points in the Plane. FSTTCS 1990: 238-254 - [c13]Ming-Shing Yu, C. L. Chen, Richard C. T. Lee:
An Optimal Parallel Algorithm for Minimum Coloring of Intervals. ICPP (3) 1990: 162-168 - [c12]C. Y. Lee, Jia-Shung Wang, Richard C. T. Lee:
On the state transition graph of Hopfield net model. IJCNN 1990: 821-826 - [c11]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
20-Relative Neighborhood Graphs Are Hamiltonian. SIGAL International Symposium on Algorithms 1990: 53-65 - 1989
- [c10]W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee:
Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time. SCG 1989: 344-353 - [c9]Ming-Shing Yu, C. L. Chen, Richard Chia-Tung Lee:
Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs. ICPP (3) 1989: 126-129 - 1986
- [c8]M. T. Fang, Richard C. T. Lee, Chin-Chen Chang:
The Idea of De-Clustering and its Applications. VLDB 1986: 181-188 - 1980
- [c7]Chin-Chen Chang, Richard C. T. Lee, David Hung-Chang Du:
Some Properties of Cartesian Product Files. SIGMOD Conference 1980: 157-168 - 1978
- [c6]C. W. Shen, Richard C. T. Lee:
A nearest neighbor search technique with short zero-in time. COMPSAC 1978: 470-475 - 1976
- [c5]Richard C. T. Lee, James R. Slagle, C. T. Mong:
Application of Clustering to Estimate Missing Data and Improve Data Integrity. ICSE 1976: 539-544 - 1974
- [c4]Richard C. T. Lee, Shi-Kuo Chang:
Structured programming and automatic program synthesis. SIGPLAN Symposium on Very High Level Languages 1974: 60-70 - 1971
- [c3]Richard C. T. Lee:
Fuzzy Logic and the Resolution Principle. IJCAI 1971: 560-567 - 1969
- [c2]Richard J. Waldinger, Richard C. T. Lee:
PROW: A Step Toward Automatic Program Writing. IJCAI 1969: 241-252 - [c1]James R. Slagle, Chin-Liang Chang, Richard C. T. Lee:
Completeness Theorems for Semantic Resolution in Consequence-Finding. IJCAI 1969: 281-286
Editorship
- 1991
- [e1]Wen-Lian Hsu, Richard C. T. Lee:
ISA '91 Algorithms, 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings. Lecture Notes in Computer Science 557, Springer 1991, ISBN 3-540-54945-5 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
