Richard C. T. Lee

发表

Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs

Fang-Rong Hsu, M. K. Shan, H. S. Chao, 2005, J. Inf. Sci. Eng..

Common Properties of Some Multiattribute File Systems

Richard C. T. Lee, W. C. Lin, David Hung-Chang Du, 1979, IEEE Transactions on Software Engineering.

An optimal embedding of incomplete binary trees onto incomplete hypercubes

Richard C. T. Lee, Chien-Hung Huang, Ju Yuan Hsiao, 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

A transformational approach to synthesizing combinational circuits

Richard C. T. Lee, Shen-Chuan Tai, M. W. Du, 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Edit distance for a run-length-encoded string and an uncompressed string

Richard C. T. Lee, Yue-Li Wang, Guan-Shieng Huang, 2007, Inf. Process. Lett..

A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis

Richard C. T. Lee, Chin-Liang Chang, Chin-Liang Chang, 1973, IEEE Trans. Syst. Man Cybern..

Performance Analyses of Cartesian Product Files and Random Files

Chin-Chen Chang, Richard C. T. Lee, M. W. Du, 1984, IEEE Transactions on Software Engineering.

The searching over separators strategy to solve some NP-hard problems in subexponential time

Richard C. T. Lee, R. Z. Hwang, R. C. Chang, 1993, Algorithmica.

An improved program-synthesizing algorithm and its correctness

Richard C. T. Lee, Richard J. Waldinger, Chin-Liang Chang, 1974, CACM.

An algorithm to generate prime implicants and its application to the selection problem

Richard C. T. Lee, 1972, Inf. Sci..

D. Michie, On Machine Intelligence

Richard C. T. Lee, 1975, Artif. Intell..

Proceedings of the 2nd International Symposium on Algorithms

Richard C. T. Lee, Wen-Lian Hsu, W. Hsu, 1991 .

On the average length of Delaunay triangulations

Richard C. T. Lee, R. C. Chang, R. Chang, 1984, BIT.

An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs

Fang-Rong Hsu, H. S. Chao, Richard C. T. Lee, 1998, COCOON.

An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs

Fang-Rong Hsu, H. S. Chao, Richard C. T. Lee, 1997, Inf. Process. Lett..

A parallel algorithm to solve the stable marriage problem

Richard C. T. Lee, S. S. Tseng, S. Tseng, 1984, BIT.

Chapter 7 – Linear Resolution

Richard C. T. Lee, Chin-Liang Chang, 1973 .

Generating All Maximal Independent Sets on Trees in Lexicographic Order

Richard C. T. Lee, Jia-Shung Wang, Y. H. Chang, 1992, Inf. Sci..

The hierarchical ordering in multiattribute files

Chin-Chen Chang, Richard C. T. Lee, M. W. Du, 1983, Inf. Sci..

Introduction to the Design and Analysis of Algorithms

Richard C. T. Lee, R. C. Chang, S. S. Tseng, 2005 .

A Different Approach for Solving the Specified Diameter Partition Problem

Chuan Yi Tang, Richard C. T. Lee, Chiou-Kuo Liang, 1993, J. Inf. Sci. Eng..

An efficient access control scheme for files protection

Chin-Chen Chang, Richard C. T. Lee, Chu-Hsing Lin, 1991 .

Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel

Richard C. T. Lee, Chin-Wen Ho, Chin-Wen Ho, 1989, Inf. Process. Lett..

The mapping of 2-D array processors to 1-D array processors

Richard C. T. Lee, Chang-Biau Yang, Chang-Biau Yang, 1986, Parallel Comput..

An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem

Richard C. T. Lee, D. P. Wang, 1993, CCCG.

Experiments with some cluster analysis algorithms

Richard C. T. Lee, James R. Slagle, Chin-Liang Chang, 1974, Pattern Recognit..

Completeness Theorems for Semantic Resolution in Consequence-Finding

Richard C. T. Lee, James R. Slagle, Chin-Liang Chang, 1969, IJCAI.

Parallel algorithms for computing the closest visible vertex pair between two polygons

Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang, 1992, Int. J. Comput. Geom. Appl..

A conference key broadcasting system using sealed locks

Chin-Chen Chang, Richard C. T. Lee, Chu-Hsing Lin, 1992, Inf. Syst..

The Weighted Perfect Domination Problem

Richard C. T. Lee, Chain-Chin Yen, 1990, Inf. Process. Lett..

Redundant MKH Files Design among Multiple Disks for Concurrent Partial Match Retrieval

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1996, J. Syst. Softw..

Application of visual display techniques to solve some biological problems

Richard C. T. Lee, 2004, Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering.

20-relative Neighborhood Graphs Are Hamiltonian

Chuan Yi Tang, Richard C. T. Lee, Maw-Shang Chang, 1991, J. Graph Theory.

The Weighted Perfect Domination Problem and Its Variants

Richard C. T. Lee, Chain-Chin Yen, Chain-Chin Yen, 1996, Discret. Appl. Math..

The Minimum Cooperative Guards Problem on K-spiral Polygons

Richard C. T. Lee, Bern-Cherng Liaw, N. F. Huang, 1993, CCCG.

A New Algorithm for Generating Prime Implicants

Richard C. T. Lee, James R. Slagle, Chin-Liang Chang, 1970, IEEE Transactions on Computers.

Parallel Graph Algorithms Based Upon Broadcast Communications

Richard C. T. Lee, Wen-Tsuen Chen, Chang-Biau Yang, 1990, IEEE Trans. Computers.

A Record-Oriented Cryptosystem for Database Sharing (Short Note)

Chin-Chen Chang, Richard C. T. Lee, Chu-Hsing Lin, 1992, Comput. J..

Minimum rectangular partition problem for simple rectilinear polygons

Jimmy J. M. Tan, Richard C. T. Lee, W. T. Liou, 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

On a scheduling problem where a job can be executed only by a limited number of processors

Richard C. T. Lee, R. S. Chang, R. Chang, 1988, Comput. Oper. Res..

The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction

Yin-Te Tsai, Richard C. T. Lee, Shyong Jian Shyu, 2004, J. Comb. Optim..

A Parallel nonlinear Mapping Algorithm

Richard C. T. Lee, Y. H. Chin, C. W. Shen, 1987, Int. J. Pattern Recognit. Artif. Intell..

Recognizing Shortest-Path Trees in Linear Time

Richard C. T. Lee, C. H. Peng, J. S. Wang, 1994, Inf. Process. Lett..

A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space

Richard C. T. Lee, James R. Slagle, H. Blum, 1977, IEEE Transactions on Computers.

A new filtration method and a hybrid strategy for approximate string matching

Richard C. T. Lee, Chin Lung Lu, Chia Wei Lu, 2013, Theor. Comput. Sci..

A parallel algorithm for the single step searching problem

Fang-Rong Hsu, Richard C. T. Lee, J. S. Lin, 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1991, Inf. Syst..

PROW: A Step Toward Automatic Program Writing

Richard C. T. Lee, Richard J. Waldinger, R. Waldinger, 1969, IJCAI.

Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work

Bertrand M. T. Lin, Richard C. T. Lee, Malgorzata Sterna, 2019 .

An Efficient Algorithm to Solve the Nearest Neighbor Searching Problem

Richard C. T. Lee, Yi Kung Shieh, Yi-Kung Shieh, 2014, ICS.

Symbolic Gray Code as a Multikey Hashing Function

Richard C. T. Lee, David Hung-Chang Du, 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models

Richard C. T. Lee, Wen-Tsuen Chen, Chang-Biau Yang, 1991, ICCI.

The approximability of the weighted Hamiltonian path completion problem on a tree

Richard C. T. Lee, Quincy Wu, Chin Lung Lu, 2005, Theor. Comput. Sci..

Minimum Spanning Trees of Moving Points in the Plane

Richard C. T. Lee, Jyh-Jong Fu, 1991, IEEE Trans. Computers.

A Letter-Oriented Minimal Perfect Hashing Scheme

Chin-Chen Chang, Richard C. T. Lee, Chinchen Chang, 1986, Comput. J..

New Public-Key Cipher System Based Upon the Diophantine Equations

Chin-Chen Chang, Richard C. T. Lee, Chu-Hsing Lin, 1995, IEEE Trans. Computers.

Bit-Parallel Algorithms for Exact Circular String Matching

Richard C. T. Lee, Guan-Shieng Huang, Kuei-Hao Chen, 2014, Comput. J..

Minimum partitioning simple rectilinear polygons in O(n log log n) - time

Jimmy J. M. Tan, Richard C. T. Lee, W. T. Liou, 1989, SCG '89.

An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm

Chuan Yi Tang, Richard C. T. Lee, T. H. Hu, 1991, ISA.

Covering convex rectilinear polygons in linear time

Chuan Yi Tang, Richard C. T. Lee, W. T. Liou, 1991, Int. J. Comput. Geom. Appl..

Application of clustering to estimate missing data and improve data integrity

Richard C. T. Lee, James R. Slagle, C. T. Mong, 1976, ICSE '76.

Web-Based Synchronized Multimedia System Design for Teaching/Learning Chinese as a Foreign Language

Richard C. T. Lee, Herng-Yow Chen, Natalius Huang, 2003, KES.

On the continuous working problem

Ruay-Shiung Chang, Richard C. T. Lee, 1990, Discret. Appl. Math..

A parallel algorithm for finding congruent regions

Richard C. T. Lee, S. N. Yang, Zen-Cheung Shih, 1990, Parallel Comput..

Some properties of Cartesian product files

Chin-Chen Chang, Richard C. T. Lee, David Hung-Chang Du, 1980, SIGMOD '80.

A Fault-Tolerance Strategy for Pyramid Architecture

Kuo-Liang Chung, Richard C. T. Lee, Ferng-Ching Lin, 1989, J. Inf. Sci. Eng..

A reversible acoustic data hiding method based on analog modulation

Richard C. T. Lee, Chien-Hung Huang, H. J. Shiu, 2014, Inf. Sci..

A systolic algorithm for extracting regions from a planar graph

Richard C. T. Lee, Zen-Chung Shih, S. N. Yang, 1989, Comput. Vis. Graph. Image Process..

The Optimality of the Number of k-Sorters of a Parallel Merging Algorithm

Richard C. T. Lee, S. S. Tseng, 1985, J. Inf. Sci. Eng..

A Systematical and Parallel Approach to Solve Problems Involving Special Properties of Bit-Vectors

Richard C. T. Lee, Chin Lung Lu, Chia Shin Ou, 2015, Comput. J..

Optimal linear hashing files for orthogonal range retrieval

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1996, Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96.

Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries

Chin-Chen Chang, Richard C. T. Lee, M. W. Du, 1982, IEEE Transactions on Software Engineering.

Application of Automatic Clustering to Emitter Identification

Richard C. T. Lee, James R. Slagle, 1976 .

Chapter 10 – Program Analysis

Richard C. T. Lee, Chin-Liang Chang, 1973 .

An Optimal Embedding of Cycles into Incomplete Hypercubes

Richard C. T. Lee, Chien-Hung Huang, Ju Yuan Hsiao, 1999, Inf. Process. Lett..

Sorting by transpositions based on the first increasing substring

Richard C. T. Lee, M. C. Chen, 2004, Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering.

Application of assignment techniques to program restructuring problems

Richard C. T. Lee, Chiun-Chieh Hsu, 1979 .

Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy

Chuan Yi Tang, Richard C. T. Lee, C. Tang, 1984, Inf. Sci..

Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments

Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang, 1993, Parallel Algorithms Appl..

The Specialization of Programs by Theorem Proving

Richard C. T. Lee, John K. Dixon, Chin-Liang Chang, 1973, SIAM J. Comput..

Single Step Searching in Weighted Block Graphs

Chuan Yi Tang, Ruay-Shiung Chang, Richard C. T. Lee, 1994, Inf. Sci..

Optimal MMI file systems for orthogonal range retrieval

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1993, Inf. Syst..

Approximation Algorithms

Richard C. T. Lee, 1997, ISPAN.

AnO(N logN) minimal spanning tree algorithm forN points in the plane

Richard C. T. Lee, R. C. Chang, 1986, BIT Comput. Sci. Sect..

Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs

Chuan Yi Tang, Richard C. T. Lee, Maw-Shang Chang, 2005, Algorithmica.

An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons

Richard C. T. Lee, Bern-Cherng Liaw, B. Liaw, 1994, Inf. Process. Lett..

Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs

Richard C. T. Lee, Ming-Shing Yu, C. L. Chen, 1989, ICPP.

20-relative Neighborhood Graphs Are Hamiltonian

Chuan Yi Tang, Richard C. T. Lee, Maw-Shang Chang, 1990, J. Graph Theory.

Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs

Chuan Yi Tang, Richard C. T. Lee, Maw-Shang Chang, 1992, Discret. Appl. Math..

Application of game tree searching techniques to sequential pattern recognition

Richard C. T. Lee, James R. Slagle, 1971, CACM.

An average case analysis of a resolution principle algorithm in mechanical theorem proving

Chuan Yi Tang, Richard C. T. Lee, T. H. Hu, 2005, Annals of Mathematics and Artificial Intelligence.

A parallel sorting scheme whose basic operation sortsN elements

Richard C. T. Lee, S. S. Tseng, 2004, International Journal of Computer & Information Sciences.

Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN-StepSCAN

Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee, 1992, BIT.

An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree

Richard C. T. Lee, Chin Lung Lu, Q. S. Wu, 2000, ISAAC.

A Temporal Join Mechanism Based on Trie-Ranking Data Structure

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1996, CODAS.

Cluster analysis and its applications

Richard C. T. Lee, 1981 .

Voronoi diagrams of moving points in the plane

Richard C. T. Lee, Jyh-Jong Fu, J. Fu, 1990, Int. J. Comput. Geom. Appl..

An optimal approximation algorithm for the rectilinearm-center problem

Richard C. T. Lee, Ming-Tat Ko, Jyun-Sheng Chang, 2005, Algorithmica.

On weighted rectilinear 2-center and 3-center problems

Richard C. T. Lee, Ming-Tat Ko, 1991, Inf. Sci..

An Efficient Channel Routing Algorithm to Yield an Optimal Solution

Richard C. T. Lee, Jia-Shung Wang, 1990, IEEE Trans. Computers.

An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs

Fang-Rong Hsu, H. S. Chao, Richard C. T. Lee, 2000, Discret. Appl. Math..

Transformation completeness properties of SVPC transformation sets

Richard C. T. Lee, Shen-Chuan Tai, M. W. Du, 1991, Discret. Appl. Math..

Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs

Richard C. T. Lee, Chin-Wen Ho, Chin-Wen Ho, 1988, Inf. Process. Lett..

Storage Reduction Through Minimal Spanning Trees and Spanning Forests

Richard C. T. Lee, Shi-Kuo Chang, Chin-Liang Chang, 1977, IEEE Transactions on Computers.

The Idea of De-Clustering and its Applications

Chin-Chen Chang, Richard C. T. Lee, M. T. Fang, 1986, VLDB.

The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs

Richard C. T. Lee, R. Z. Hwang, R. Hwang, 1992, ISAAC.

Towards Automatic Auditing of Records

Richard C. T. Lee, James R. Slagle, C. T. Mong, 1978, IEEE Transactions on Software Engineering.

A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile

Richard C. T. Lee, Jia-Shung Wang, Cheng-I Yang, 1989, Comput. Oper. Res..

Computing the convex hull in a hammock

Richard C. T. Lee, Yue-Li Wang, Jyun-Sheng Chang, 1992, Inf. Sci..

The Number of Intersections Between Two Rectangular Paths

Richard C. T. Lee, Yue-Li Wang, Jyun-Sheng Chang, 1989, IEEE Trans. Computers.

A near pattern-matching scheme based upon principal component analysis

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1995, Pattern Recognit. Lett..

On the complexity of some multi-attribute file design problems

Chuan Yi Tang, Richard C. T. Lee, D. J. Fuehrer, 1985, Inf. Syst..

Password authentication using Newton's interpolating polynomials

Richard C. T. Lee, Chu-Hsing Lin, Tzong-Chen Wu, 1991, Inf. Syst..

A Parallel Algorithm for Solving Sparse Triangular Systems

Richard C. T. Lee, Chin-Wen Ho, 1990, IEEE Trans. Computers.

The Full Steiner Tree Problem in Phylogeny

Chuan Yi Tang, Richard C. T. Lee, Chin Lung Lu, 2002, COCOON.

Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications

H. S. Chao, Richard C. T. Lee, D. P. Wang, 1993, ISAAC.

Optimal Multiple Key Hashing Files for Orthogonal Range Queries

Chin-Chen Chang, J. Liang, Richard C. T. Lee, 1994, Inf. Sci..

Application of Principal Component Analysis to Multikey Searching

Richard C. T. Lee, Y. H. Chin, S. C. Chang, 1976, IEEE Transactions on Software Engineering.

Data hiding methods based upon DNA sequences

Richard C. T. Lee, Ka-Lok Ng, Chien-Hung Huang, 2010, Inf. Sci..

The full Steiner tree problem

Chuan Yi Tang, Richard C. T. Lee, Chin Lung Lu, 2003, Theor. Comput. Sci..

The vectorization of the partition problem

Richard C. T. Lee, Shyong Jian Shyu, 1990, Parallel Comput..

Hierarchy representations based on arithmetic coding for dynamic information protection systems

Chin-Chen Chang, Richard C. T. Lee, Chu-Hsing Lin, 1992, Inf. Sci..

Voronoi Diagrams of Moving Points in the Plane

Richard C. T. Lee, Jyh-Jong Fu, 1990, FSTTCS.

The slab dividing approach to solve the EuclideanP-Center problem

Richard C. T. Lee, R. Z. Hwang, R. C. Chang, 2005, Algorithmica.

A Dynamic Access Control Mechanism in Information Protection Systems

Chin-Chen Chang, Richard C. T. Lee, Chu-Hsing Lin, 1989, Journal of information science and engineering.

Fuzzy Logic and the Resolution Principle

Richard C. T. Lee, 1971, JACM.

Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1997, IEEE Trans. Knowl. Data Eng..

Special Subgraphs of Weighted Visibility Graphs

Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang, 1992, Inf. Process. Lett..

Symbolic logic and mechanical theorem proving

Richard C. T. Lee, Chin-Liang Chang, Chin-Liang Chang, 1973, Computer science classics.

On the state transition graph of Hopfield net model

Richard C. T. Lee, Jia-Shung Wang, C. Y. Lee, 1990, 1990 IJCNN International Joint Conference on Neural Networks.

A new parallel sorting algorithm based upon min-mid-max operations

Richard C. T. Lee, S. S. Tseng, 1984, BIT Comput. Sci. Sect..

Storage Reduction Through Minimal Spanning Trees

Richard C. T. Lee, Shi-Kuo Chang, Andy N. C. Kang, 1975 .

A unified approach for solving bottleneck k-bipartition problems

Chuan Yi Tang, Richard C. T. Lee, Maw-Shang Chang, 1991, CSC '91.

Solving the set cover problem on a supercomputer

Richard C. T. Lee, Shyong Jian Shyu, S. Shyu, 1990, Parallel Comput..

Finding a longest common subsequence between a run-length-encoded string and an uncompressed string

Richard C. T. Lee, Yue-Li Wang, Jia Jie Liu, 2008, J. Complex..

Systolic algorithms to examine all pairs of elements

Richard C. T. Lee, Gen-Huey Chen, Zen-Cheung Shih, 1987, CACM.

On the Optimal Solutions to AND/OR Series-Parallel Graphs

Richard C. T. Lee, Richard Simon, R. Simon, 1971, JACM.

Multidisk Smaller Sized MKH file Allocation for Partial Match Retrieval

Chin-Chen Chang, Richard C. T. Lee, C. Y. Chen, 1997, J. Inf. Sci. Eng..

A new systolic architecture for convex hull and half-plane intersection problems

Richard C. T. Lee, Maw-Sheng Chern, Gen-Huey Chen, 1987, BIT Comput. Sci. Sect..

Some Properties of Fuzzy Logic

Richard C. T. Lee, Chin-Liang Chang, Chin-Liang Chang, 1971, Inf. Control..

Characteristics of the Hopfield associative memory utilizing isomorphism relations

Richard C. T. Lee, Jia-Shung Wang, C. Y. Lee, 1994, IEEE Trans. Neural Networks.

The NPO-Completeness of the Longest Hamiltonian Cycle Problem

Richard C. T. Lee, Kun-Mao Chao, Q. S. Wu, 1998, Inf. Process. Lett..

The exact multiple pattern matching problem solved by a reference tree approach

Richard C. T. Lee, Shyong Jian Shyu, Yi-Kung Shieh, 2021, Theor. Comput. Sci..

Clustering Analysis and Its Applications

Richard C. T. Lee, 1981 .

Embedding incomplete binary trees into incomplete hypercubes

Richard C. T. Lee, J. Hsiao, C.-H. Huang, 1998 .

Deductive Question Answering, Problem Solving, and Program Synthesis

Richard C. T. Lee, Chin-Liang Chang, 1973 .

Rectilinear m‐Center problem

Richard C. T. Lee, Ming-Tat Ko, J. S. Chang, 1990 .

Application of information theory to select relevant variables

Richard C. T. Lee, 1971 .

A New Filtration Method and a Hybrid Strategy for Approximate String Matching

Richard C. T. Lee, C. Lu, C. Lu, 2013 .

Systolic algorithms for the longest common subsequence problem

Richard C. T. Lee, Chang-Biau Yang, Chang-Biau Yang, 1987 .

The average performance analysis of a closest‐pair algorithm

Richard C. T. Lee, R. C. Chang, R. Chang, 1984 .

Herbrand's Theorem

Richard C. T. Lee, Chin-Liang Chang, 1973 .

The Propositional Logic

Richard C. T. Lee, Chin-Liang Chang, 1973 .

Exact Multiple String Matching Problem for DNA Alphabet

Richard C. T. Lee, S. Shyu, Yi-Kung Shieh, 2016 .

Semantic Resolution and Lock Resolution

Richard C. T. Lee, Chin-Liang Chang, 1973 .

Some Proof Procedures Based on Herbrand's Theorem

Richard C. T. Lee, Chin-Liang Chang, 1973 .

Chapter 12 – Concluding Remarks

Richard C. T. Lee, Chin-Liang Chang, 1973 .

Generating all maximal independent sets on trees in lexicographic order

Richard C. T. Lee, Y. Chang, Jia-Shung Wang, 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

The Equality Relation

Richard C. T. Lee, Chin-Liang Chang, 1973 .

Approximation Algorithms

Richard C. T. Lee, Mohit Singh, Kunal Talwar, 2021, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

Exact Circular Pattern Matchings Using Bit-Parallelism and q-Gram Technique ∗

Richard C. T. Lee, Guan-Shieng Huang, G. Huang, 2012 .