Prof. R.C.T Lee's Publications

(A) Journal Articles and Chapters (1) Chapters
  1. Lee, R. C. T., ``Clustering Analysis and its Applications,'' Advances in Information System Science, (edited by J. T. Tou) Plenum Press, N.Y. 1981, pp.169-287.
  2. Lee, R. C. T., Shen, C. W. and Chang, S. C., ``Compilers,'' Handbook of Software Engineering, (edited by C. R. Vick and C. V. Ramamoorthy), Van Nostrand Reinhold, N.Y., 1982, pp.201-233.
(2) Papers published in well refereed journals
    ~~~~On symbolic logic, fuzzy logic and mechanical theorem proving:

  1. Slagle, J. R., Chang, C. L. and Lee, R. C. T., ``A New Algorithm for Generating Prime Implicants,'' IEEE Trans. on Computers, v.C-19, no. 4, 1970, pp.304-310.
  2. Lee, R. C. T. and Chang, C. L., ``Some Properties of Fuzzy Logic,'' Information and Control, v.19, no. 5, 1971, pp.417-431.
  3. Lee, R. C. T., ``Fuzzy Logic and the Resolution Principle,'' Journal of the ACM, v.19, no. 1, 1972, pp.109-119.
  4. Lee, R. C. T., ``An Algorithm to Generate Prime Implicants and its Applications to the Selection Problem,'' Information Sciences, v.4, 1972, pp.251-259.
  5. Chang, C. L., Lee, R. C. T. and Dixon, J. K., ``The Specialization of Programs by Theorem Proving'', SIAM J. on Computing, v. 2, no. 1, 1973, pp.7-15.
  6. Lee,R.C.T., Chang, C. L. and Waldinger, R. J., ``An Improved Program Synthesis Algorithm and its Correctness'', Comm. of the ACM., April 1974, pp.211-217.

    ~~~~On pattern recognition and clustering analysis:

  7. Lee, R. C. T., ``Application of Information Theory to Select Relevant Variables'', Mathematical Biosciences, v.11, 1971, pp.153-161.
  8. Slagle, J. R. and Lee, R. C. T., ``Application of Game Tree Searching to Sequential Pattern Recognition'', Comm. of the ACM, v.14, no.2, 1971, pp.103-110.
  9. Ting, K. L. H., Lee, R. C. T., Milne, G. W. A., Shapiro, M. and Guarino, A. M., ``Applications of Artificial Intelligence, Relationships between Mass Spectra and Pharmacological Activity of Drugs'', Science, v. 180, 1973, pp.417-420.
  10. Chang, C. L. and Lee, R. C. T., ``A Heuristic Method for Non-linear Mapping in Cluster Analysis'', IEEE Trans. on Systems, Man and Cybernetics, v. SMC-3, no. 1, 1973,pp.197-200.
  11. Lee, R. C. T., ``Experiments with Some Clustering Analysis Algorithms'', Pattern Recognition, v.6, 1974, pp.181-187.
  12. Lee, R. C. T., Chin, Y. H. and Chang, S. C., ``Application of Principle Component Analysis to Multikey Searching'', IEEE Trans. on Software Engr., v. SE-2, no. 3, 1976, pp.185-193.
  13. Lee, R. C. T., Slagle, J. R. and Blum, H., ``A Triangulation Method for the Sequential Mapping of Points from N-Space to 2-Space'', IEEE Trans. on Computers, v. C-26, no. 3, 1977, pp.288-292.

    ~~~~On graph theory problem:

  14. Simon, S. and Lee, R. C. T., ``On the Optimal Solution to AND/OR Series Parallel Graphs'', Journal of the ACM, v.18, no.3,1979, pp. 354-357.

    ~~~~On data base design:

  15. Kang, A. N. C., Lee, R. C. T., Chang, C. L and Chang, S. K., ``Storage Reduction through Minimal Spanning Trees and Spanning Forests'', IEEE Trans. on Computers, v. C-26, no. 5, 1977, pp.425-434.
  16. Lee, R. C. T., Mong, S. T. and Slagle, J. R., ``Towards Automatic Auditing of Records'', IEEE Trans. on Software Engr., v. SE-4, no.5, 1978, pp.441-448.
  17. Lee, R. C. T. and Tseng, S. H., ``Multi-key Sorting'', Policy Analysis and Information Systems, v.3, no.2, 1979, pp.1-20.
  18. Lin, W. C., Lee, R. C. T. and Du, H. C., ``Common Properties of Some Multi-attribute File Systems'', IEEE Trans. on Software Engr., v. SE-5, no. 2, 1979, pp.160-174.
  19. Du, H. C. and Lee, R. C. T., ``Symbolic Gray Code as a Multi-key HashingFunction'', IEEE Trans. on Pattern Analysis and Machine Intelligence, v. PAMI-2, no.1, 1980, pp.83-90.
  20. Chang, C. C., Lee, R. C. T. and Du, M. W., ``Symbolic Gray Code as a Perfect Multi-attribute Hashing Scheme for Partial Match Queries'', IEEE Trans. on Software Engr., v. SE-8, no. 3, 1982, pp.235-249.
  21. Chang, C. C., Du, M. W. and Lee, R. C. T., ``Performance Analysis of Cartesian Product Files and Random Files'', IEEE Trans. on Software Engr., v. SE-10, no. 10, 1984, pp.88-99.
  22. Chang, C. C. and Lee, R. C. T., ``A Letter Oriented Minimal Perfect Hashing Scheme'', The Computer Journal, v.29, no.3, 1986, pp.277-281.
  23. Chang, C. C., Du, M. W. and Lee, R. C. T., ``The Hierarchical Ordering in Multi-attribute Files'', Information Sciences, v.31, no.1, 1983, pp.41-75.

    ~~~~On sequential algorithm design:

  24. Chang, R. C. and Lee, R. C. T., ``The Average Performance Analysis of a Closest-Pair Algorithm'', International Journal of Computer Mathematics, v. 16, 1984, pp.125-130.
  25. Chang, R. C. and Lee, R. C. T., ``The Average Length of Delaunay Triangulations'', BIT. v.24, 1984, pp.269-273.
  26. Tang, C. Y., Buehrer, D. and Lee, R. C. T., ``On the Complexity of Some Multi-attribute File Design Problems'', Information Systems, v.10, no. 1, 1985, pp.21-25.
  27. Chang, R. C. and Lee, R. C. T., ``An O(NlogN) Minimal Spanning Tree Algorithm for N Points in the Plane'', BIT. v.26,1986, pp.7-16.
  28. Chang, R. S. and Lee, R. C. T. ``On a Scheduling Problem where a Job Can Be Executed Only by a imited Number of Processors'', Computers and Operations Research, v.15, no.5, 1988, pp.471-478.
  29. Wang, Y. L., Lee, R. C. T. and Chang, J. S., ``The Number of Intersections between Two Rectangular Paths'', IEEE Trans. on Computers, vol. 38, no. 11, Nov. 1989, pp.1564-1571.
  30. Ko, M. T., Lee, R. C. T. and Chang, J. S., ``An Approximation Algorithm for the Rectilinear M-Center Problem'', Algorithmica, Vol. 5, 1990, pp.341-352.
  31. Yang, C. I., Wang, J. S. and Lee, R. C. T., ``A Branch-and-Bound Algorithm to Solve the Equal-Execution-Time Job Scheduling Problem with Precedence Constraint and Profile'', Computers and Operations Research, vol. 16, no. 3, 1989, pp.257-269.
  32. Ko, M. T. and Lee, R. C. T., ``On Weighted 2-Center and 3-Center Problems'', accepted by Information Sciences.
  33. Wang, J. S. and Lee, R. C. T., ``An Efficient Channel Routing Algorithm to Yield an Optimal Solution'', IEEE Transactions on Computers, Vol. 39, No. 7, July 1990 pp. 957-962.
  34. Wang, Y. L., Lee, R. C. T. and Chang, J. S., ``Computing the Convex Hull in a Hammock'', accepted by Information Sciences.
  35. Chang, R. S. and Lee, R. C. T., ``On the Continuous Working Problem'', Discrete Applied Mathematics, Vol. 28, 1990, pp.93-109.
  36. Fu, J. J. and Lee, R. C. T., ``Minimum Spanning Trees of Moving Points in the Plane'', IEEE Transactions on Computers, Vol. 40, No. 1, Jan. 1991, pp.113-118
  37. Liou, W. T., Tan, J. J. M. and Lee, R. C. T., ``Minimum Rectangular Partition Problem for Simple Rectilinear Polygons'', IEEE Trans. on Computer-Aided Design on Integrated Circuits and Systems, Vol. 9, No. 7, July 1990, pp.720-733.
  38. Ko, M. T., Lee, R. C. T. and Chang, C. S., ``Rectilinear m-Center Problem'', Naval Research Logistics, Vol. 37, 1990, pp.419-427.
  39. Chang, K. L., Lin, F. C. and Lee, R. C. T., ``A Fault-Tolerance Strategy for Pyramid Architecture'', Journal of Information Science and Engineering, Vol. 5, 1989, pp.105-121.
  40. Tai, S. C., Du, M. W. and Lee, R. C. T., ``Transformation Completeness Properties of SVPC Transformation Sets'', Discrete Applied Mathematics, Vol. 32, 1991, pp.263-273.
  41. Yen, C. C. and Lee, R. C. T., ``The Weighted Perfect Domination Problem'', Information Processing Letters, Vol. 35, 1990, pp.295-299.
  42. Tai, S. C., Du, M. W. and Lee, R. C. T., ``A Transformational Approach to Synthesizing Combinational Circuits'', IEEE Transactions on Computer-Aided-Design on Integrated Circuits and Systems, vol. 10, No. 3, March 1991, pp.286-295.
  43. Hwang, R. Z., Lee, R. C. T. and Chang, R. C., ``The Slab Dividing Approach to Solve the Euclidean P-Center Problem'', accepted by Algorithmica.
  44. Chang, M. S., Tang, C. Y. and Lee, R. C. T., ``Solving the Euclidean Bottleneck Matching Problem by K-Relative Neighborhood Graphs'', Algorithmica, Vol. 8, 1992, pp.177-194.
  45. Chang, M. S., Tang, C. Y. and Lee, R. C. T., ``Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs'', Discrete Applied Mathematics, Vol. 39, 1992, pp.1-12.
  46. Chang, M. S., Tang, C. Y. and Lee, R. C. T., ``20-Relative Neighborhood Graphs Are Hamiltonian'', Journal of Graph Theory, Vol. 15, No. 5, 1991, pp.543-557.
  47. Fu, J. J. and Lee, R. C. T., ``Voronoi Diagrams of Moving Points in the Plane'', International Journal of Computational Geometry and Applications, Vol.1, No. 1, March 1991, pp.23-32.
  48. Hu, T. H., Tang, C. Y. and Lee, R. C. T., ``An Average Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving'', Annals of Mathematics and Artificial Intelligence, Vol. 6, 1992, pp.235-252.
  49. Hwang, R. Z., Chang, R. C. and Lee, R. C. T., ``The Searching over Separators Strategy to Solve Some NP-hard Problems in Sub-exponential Time'', accepted by Algorithmica.
  50. Liou, W. T., Tang, C. Y. and Lee, R. C. T., `` Covering Convex Rectilinear Polygons in Linear Time'', International Journal of Computational Geometry and Applications, Vol. 1, No. 2, 1991, pp.137-185.
  51. Hsu, F. R., Lee, R. C. T. and Chnag, R. C., ``Special Subgraphs of Weighted Visibility Graphs'', Information Processing Letters, Vol. 43, 1992, pp.69-75.
  52. Yen, C. C. and Lee, R. C. T., ``A Linear Algorithm to Solve the Weighted Perfect Domination Problem in Series-Parallel Graphs'', accepted by European Journal of Operational Research.

    ~~~~On parallel algorithm design:

  53. Tang, C. Y. and Lee, R. C. T., ``Optimal Speed-up of Parallel Algorithms Based upon the Divide-and-Conquer Strategy'', Information Sciences, v. 32, 1984, pp.173-186.
  54. Tseng, S. S. and Lee, R. C. T., ``A Parallel Algorithm to Solve the Stable Marriage Problem'', BIT. v.24, 1984, pp.308-316.
  55. Tseng, S. S. and Lee, R. C. T., ``A New Parallel Sorting Algorithm Based upon Min-Mid-Max Operations'', BIT. vol. 24, 1984, pp.187-195.
  56. Tseng, S. S. and Lee, R. C. T., ``A Parallel Sorting Scheme where Basic Operations Sort N Elements'', International Journal of Computer and Information Sciences, v.14, no.6, 1985, pp.455-467.
  57. Tseng, S. S. and Lee, R. C. T., ``A Review of Parallel Sorting Algorithms'', Proceedings of NSC-Part A, Oct. 1985, pp.277-295.
  58. Yang, C. B. and Lee, R. C. T., ``The Mapping of 2-D Array Processors to 1-D Array Processors'', Parallel Computing, v.3, 1986, pp.217-229.
  59. Chen, G. H., Chern, M. S. and Lee, R. C. T., ``A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems'', BIT. v.27, 1987, pp.141-147.
  60. Shih, Z. C., Chen, G. H. and Lee, R. C. T., ``Systolic Algorithms to Examine All Pairs of Elements'', Comm. of the ACM, v.30, no.2, Feb. 1987,pp.161-167.
  61. Shen, C. W., Lee, R. C. T. and Chin, Y. H., ``A Parallel Nonlinear Mapping Algorithm'', International Journal of Pattern Recognition and Artificial Intelligence, v.1, no.1, 1987, pp.53-69.
  62. Yang, C. B. and Lee, R. C. T., ``Systolic Algorithms for the Longest Common Subsequence Problem'', Journal of the Chinese Institute of Engineers, v.10, no.6, 1987,pp.691-697.
  63. Ho, C. W. and Lee, R. C. T., ``Efficient Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs'', Information Processing Letters, Vol. 28,, Aug. 1988, pp.301-309.
  64. Ho, C. W. and Lee, R. C. T., ``A Parallel Algorithm for Solving Sparse Triangular Systems'', IEEE Transactions on Computers, Vol. 39, No. 6, June 1990, pp. 848-852.
  65. Shih, Z. C., Lee, R. C. T. and Yang, S. N., ``A Systolic Algorithm for Extracting Regions for a Planar Graph'', Computer Vision, Graphics and Image Processing, Vol. 47, 1989, pp.227-242.
  66. Shih, Z. C., Lee, R. C. T. and Yang, S. N. A, ``Parallel Algorithm for Finding Congruent Regions'', Parallel Computing, Vol. 13, No. 2, 1990, pp.135-142
  67. Ho, C. W. and Lee, R. C. T., ``Counting Clique Trees and Computing Elimination Schemes in Parallel'', Information Processing Letters, vol. 31, 1989, pp.61-68.
  68. Shyu, S. J. and Lee, R. C. T., ``Solving the Set Cover Problem on a Supercomputer'', Parallel Computing, Vol. 13, 1990, pp.295-300.
  69. Yang, C. B., Lee, R. C. T. and Chen, W. T., ``Parallel Graph Algorithms Based upon Broadcast Communications'', IEEE Transactions on Computers, vol. 39, no. 12, Dec. 1990, pp. 1468-1472.
  70. Shyu, S. J. and Lee, R. C. T., ``The Vectorization of the Partition Problem'', Parallel Computing, Vol. 16, 1990, pp.343-350.
  71. Tseng, D. L. Y. and Lee, R. C. T. ``Problems that Are Unlikely to Have Efficient Parallel Algorithms'', Advances in Parallel Computing, (D. J. Evans editor), JAI Press, London, Vol. 1, 1990, pp.1223-147.
  72. Hsu, F. R., Chang, R. C. and Lee, R. C. T., ``Parallel Algorithms for Computing the Minimum Visible Vertex Distance between Two Polygons'', International Journal of Computational Geometry and Applications, Special Issue: Parallel Computaional Geometry, Vol. 2, No. 2, 1992, pp.135-162.
(B) Books
  1. Chang, C. L. and Lee, R. C. T. Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.