Richard C. T. Lee

Publication Activity (10 Years)

Years Active: 1969-2015
Publications (10 Years): 0

Top Venues

ICS

Inf. Sci.

Theor. Comput. Sci.

Comput. J.

Publications

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) (2015)
Yi Kung Shieh, Richard C. T. Lee
An Efficient Algorithm to Solve the Nearest Neighbor Searching Problem. ICS (2014)
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 (2014)
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 (2013)
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) (2010)
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) (2008)
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) (2007)
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) (2005)
Richard C. T. Lee
Application of Visual Display Techniques to Solve Some Biological Problems. BIBE (2004)
M. C. Chen, Richard C. T. Lee
Sorting by Transpositions Based on the First Increasing Substring Concept. BIBE (2004)
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) (2004)
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)
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) (2000)
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)
Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee
An Optimal Embedding of Cycles into Incomplete Hypercubes. Inf. Process. Lett. 72 (5-6) (1999)
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)
Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee
The NPO-Completeness of the Longest Hamiltonian Cycle Problem. Inf. Process. Lett. 65 (3) (1998)
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)
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) (1997)
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) (1997)
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) (1997)
Richard C. T. Lee
Approximation Algorithms. ISPAN (1997)
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) (1996)
C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee, D. C. Lin
Optimal Linear Hashing Files for Orthogonal Range Retrieval. COMPSAC (1996)
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)
Chain-Chin Yen, Richard C. T. Lee
The Weighted Perfect Domination Problem and Its Variants. Discret. Appl. Math. 66 (2) (1996)
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) (1995)
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) (1995)
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) (1994)
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) (1994)
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) (1994)
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) (1994)
J. S. Lin, Fang-Rong Hsu, Richard C. T. Lee
A parallel algorithm for the single step searching problem. ISPAN (1994)
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) (1994)
Chen-Hsing Peng, Jia-Shung Wang, Richard C. T. Lee
Recognizing Shortest-Path Trees in Linear Time. Inf. Process. Lett. 52 (2) (1994)
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) (1993)
D. P. Wang, Richard C. T. Lee
An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem. CCCG (1993)
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) (1993)
C. Y. Chen, Chin-Chen Chang, Richard C. T. Lee
Optimal MMI file systems for orthogonal range retrieval. Inf. Syst. 18 (1) (1993)
R. Z. Hwang, Richard C. T. Lee, R. C. Chang
The Slab Dividing Approach To Solve the Euclidean P-Center Problem. Algorithmica 9 (1) (1993)
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)
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) (1993)
Bern-Cherng Liaw, N. F. Huang, Richard C. T. Lee
The Minimum Cooperative Guards Problem on K-spiral Polygons. CCCG (1993)
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) (1992)
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) (1992)
Y. H. Chang, Jia-Shung Wang, Richard C. T. Lee
Generating All Maximal Independent Sets on Trees in Lexicographic Order. ICCI (1992)
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) (1992)
Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee
A Record-Oriented Cryptosystem for Database Sharing (Short Note). Comput. J. 35 (6) (1992)
Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang
Computing the convex hull in a hammock. Inf. Sci. 59 (1-2) (1992)
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)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs. Algorithmica 8 (3) (1992)
Fang-Rong Hsu, Richard C. T. Lee, R. C. Chang
Special Subgraphs of Weighted Visibility Graphs. Inf. Process. Lett. 43 (2) (1992)
Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee
-Step SCAN. BIT 32 (4) (1992)
Chu-Hsing Lin, Chin-Chen Chang, Richard C. T. Lee
A conference key broadcasting system using sealed locks. Inf. Syst. 17 (4) (1992)
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) (1992)
Shen-Chuan Tai, M. W. Du, Richard C. T. Lee
Transformation completeness properties of SVPC transformation sets. Discret. Appl. Math. 32 (3) (1991)
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)
W. T. Liou, Chuan Yi Tang, Richard C. T. Lee
Covering convex rectilinear polygons in linear time. Int. J. Comput. Geom. Appl. 1 (2) (1991)
Jyh-Jong Fu, Richard C. T. Lee
Minimum Spanning Trees of Moving Points in the Plane. IEEE Trans. Computers 40 (1) (1991)
Chu-Hsing Lin, Chin-Chen Chang, Tzong-Chen Wu, Richard C. T. Lee
Password authentication using Newton's interpolating polynomials. Inf. Syst. 16 (1) (1991)
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) (1991)
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)
Jyh-Jong Fu, Richard C. T. Lee
Voronoi diagrams of moving points in the plane. Int. J. Comput. Geom. Appl. 1 (1) (1991)
Ming-Tat Ko, Richard C. T. Lee
On weighted rectilinear 2-center and 3-center problems. Inf. Sci. 54 (1-2) (1991)
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)
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) (1991)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
20-relative neighborhood graphs are hamiltonian. J. Graph Theory 15 (5) (1991)
Chain-Chin Yen, Richard C. T. Lee
The Weighted Perfect Domination Problem. Inf. Process. Lett. 35 (6) (1990)
Ming-Tat Ko, Richard C. T. Lee, Jyun-Sheng Chang
An Optimal Approximation Algorithm for the Rectilinear m-Center Problem. Algorithmica 5 (3) (1990)
Shyong Jian Shyu, Richard C. T. Lee
Solving the set cover problem on a supercomputer. Parallel Comput. 13 (3) (1990)
Zen-Cheung Shih, Richard C. T. Lee, S. N. Yang
A parallel algorithm for finding congruent regions. Parallel Comput. 13 (2) (1990)
Chin-Wen Ho, Richard C. T. Lee
A Parallel Algorithm for Solving Sparse Triangular Systems. IEEE Trans. Computers 39 (6) (1990)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
20-Relative Neighborhood Graphs Are Hamiltonian. SIGAL International Symposium on Algorithms (1990)
C. Y. Lee, Jia-Shung Wang, Richard C. T. Lee
On the state transition graph of Hopfield net model. IJCNN (1990)
Shyong Jian Shyu, Richard C. T. Lee
The vectorization of the partition problem. Parallel Comput. 16 (2-3) (1990)
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) (1990)
Jyh-Jong Fu, Richard C. T. Lee
Voronoi Diagrams of Moving Points in the Plane. FSTTCS (1990)
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) (1990)
Jia-Shung Wang, Richard C. T. Lee
An Efficient Channel Routing Algorithm to Yield an Optimal Solution. IEEE Trans. Computers 39 (7) (1990)
Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen
Parallel Graph Algorithms Based Upon Broadcast Communications. IEEE Trans. Computers 39 (12) (1990)
Ming-Shing Yu, C. L. Chen, Richard C. T. Lee
An Optimal Parallel Algorithm for Minimum Coloring of Intervals. ICPP (3) (1990)
Ruay Shiung Chang, Richard C. T. Lee
On the continuous working problem. Discret. Appl. Math. 28 (2) (1990)
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)
Kuo-Liang Chung, Ferng-Ching Lin, Richard C. T. Lee
A Fault-Tolerance Strategy for Pyramid Architecture. J. Inf. Sci. Eng. 5 (2) (1989)
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) (1989)
Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang
The Number of Intersections Between Two Rectangular Paths. IEEE Trans. Computers 38 (11) (1989)
Chin-Wen Ho, Richard C. T. Lee
Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel. Inf. Process. Lett. 31 (2) (1989)
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) (1988)
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) (1988)
C. W. Shen, Richard C. T. Lee, Y. H. Chin
A Parallel nonlinear Mapping Algorithm. Int. J. Pattern Recognit. Artif. Intell. 1 (1) (1987)
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) (1987)
Zen-Cheung Shih, Gen-Huey Chen, Richard C. T. Lee
Systolic Algorithms to Examine All Pairs of Elements. Commun. ACM 30 (2) (1987)
Chang-Biau Yang, Richard C. T. Lee
The mapping of 2-D array processors to 1-D array processors. Parallel Comput. 3 (3) (1986)
M. T. Fang, Richard C. T. Lee, Chin-Chen Chang
The Idea of De-Clustering and its Applications. VLDB (1986)
R. C. Chang, Richard C. T. Lee
Points in the Plane. BIT 26 (1) (1986)
Chin-Chen Chang, Richard C. T. Lee
A Letter-Oriented Minimal Perfect Hashing Scheme. Comput. J. 29 (3) (1986)
Chuan Yi Tang, D. J. Fuehrer, Richard C. T. Lee
On the complexity of some multi-attribute file design problems. Inf. Syst. 10 (1) (1985)
S. S. Tseng, Richard C. T. Lee
elements. Int. J. Parallel Program. 14 (6) (1985)
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) (1985)
Chuan Yi Tang, Richard C. T. Lee
Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy. Inf. Sci. 32 (3) (1984)

Richard C. T. Lee.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard C. T. Lee