The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Richard C. T. Lee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  106. Transformation completeness properties of SVPC transformation sets. [Citation Graph (, )][DBLP]


  107. On the continuous working problem. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002