R. C. T. Lee | Academic Influence

R. C. T. Lee's AcademicInfluence.com Rankings

R. C. T. Lee

Computer Science

#455

World Rank

#473

Historical Rank

Database

#4610

World Rank

#4789

Historical Rank

computer-science Degrees

Download Badge

Computer Science

R. C. T. Lee's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Electrical Engineering National Taiwan University

Similar Degrees You Can Earn

Why Is R. C. T. Lee Influential?

(Suggest an Edit or Addition)

According to Wikipedia, R. C. T. Lee , also known as Richard C. T. Lee, received his B.Sc. degree from the Department of Electrical Engineering of National Taiwan University and Ph.D. degree from the Department of Electrical Engineering and Computer Science from University of California, Berkeley.

(See a Problem?)

R. C. T. Lee's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Symbolic logic and mechanical theorem proving (1973) (1767)
Fuzzy Logic and the Resolution Principle (1971) (324)
Data hiding methods based upon DNA sequences (2010) (170)
A New Algorithm for Generating Prime Implicants (1970) (169)
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space (1977) (161)
PROW: A Step Toward Automatic Program Writing (1969) (160)
Some Properties of Fuzzy Logic (1971) (139)
Voronoi diagrams of moving points in the plane (1990) (118)
Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel (1989) (80)
A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis (1973) (77)
Completeness Theorems for Semantic Resolution in Consequence-Finding (1969) (65)
Clustering Analysis and Its Applications (1981) (64)
The slab dividing approach to solve the EuclideanP-Center problem (2005) (64)
The Idea of De-Clustering and its Applications (1986) (62)
The Weighted Perfect Domination Problem and Its Variants (1996) (55)
The full Steiner tree problem (2003) (55)
Application of Principal Component Analysis to Multikey Searching (1976) (52)
The searching over separators strategy to solve some NP-hard problems in subexponential time (1993) (52)
Common Properties of Some Multiattribute File Systems (1979) (44)
Application of game tree searching techniques to sequential pattern recognition (1971) (37)
The Weighted Perfect Domination Problem (1990) (35)
New Public-Key Cipher System Based Upon the Diophantine Equations (1995) (35)
Storage Reduction Through Minimal Spanning Trees and Spanning Forests (1977) (35)
Minimum partitioning simple rectilinear polygons in O(n log log n) - time (1989) (34)
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (1998) (32)
Some properties of Cartesian product files (1980) (32)
Systolic algorithms for the longest common subsequence problem (1987) (29)
The Minimum Cooperative Guards Problem on K-spiral Polygons (1993) (29)
Parallel Graph Algorithms Based Upon Broadcast Communications (1990) (29)
Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN-StepSCAN (1992) (28)
Experiments with some cluster analysis algorithms (1974) (28)
An improved program-synthesizing algorithm and its correctness (1974) (28)
Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs (1988) (26)
Bit-Parallel Algorithms for Exact Circular String Matching (2014) (26)
On a scheduling problem where a job can be executed only by a limited number of processors (1988) (26)
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs (1992) (25)
Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications (1993) (25)
Performance Analyses of Cartesian Product Files and Random Files (1984) (24)
Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs (1992) (23)
Systolic algorithms to examine all pairs of elements (1987) (23)
A Letter-Oriented Minimal Perfect Hashing Scheme (1986) (23)
A near pattern-matching scheme based upon principal component analysis (1995) (22)
Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries (1982) (22)
On the average length of Delaunay triangulations (1984) (22)
A parallel algorithm to solve the stable marriage problem (1984) (22)
Minimum rectangular partition problem for simple rectilinear polygons (1990) (22)
20-relative Neighborhood Graphs Are Hamiltonian (1990) (20)
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (2008) (19)
Towards Automatic Auditing of Records (1978) (19)
An Efficient Channel Routing Algorithm to Yield an Optimal Solution (1990) (17)
Edit distance for a run-length-encoded string and an uncompressed string (2007) (17)
Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models (1991) (14)
On the complexity of some multi-attribute file design problems (1985) (14)
Application of information theory to select relevant variables (1971) (14)
Application of clustering to estimate missing data and improve data integrity (1976) (14)
A Record-Oriented Cryptosystem for Database Sharing (Short Note) (1992) (14)
An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons (1994) (13)
On weighted rectilinear 2-center and 3-center problems (1991) (13)
A conference key broadcasting system using sealed locks (1992) (13)
On the Optimal Solutions to AND/OR Series-Parallel Graphs (1971) (13)
Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs (2005) (12)
Rectilinear m‐Center problem (1990) (12)
A reversible acoustic data hiding method based on analog modulation (2014) (10)
A Dynamic Access Control Mechanism in Information Protection Systems (1989) (10)
AnO(N logN) minimal spanning tree algorithm forN points in the plane (1986) (10)
Minimum Spanning Trees of Moving Points in the Plane (1991) (10)
The mapping of 2-D array processors to 1-D array processors (1986) (10)
Herbrand's Theorem (1973) (9)
An optimal approximation algorithm for the rectilinearm-center problem (1990) (9)
Hierarchy representations based on arithmetic coding for dynamic information protection systems (1992) (9)
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (1989) (8)
A parallel algorithm for finding congruent regions (1990) (8)
A new systolic architecture for convex hull and half-plane intersection problems (1987) (8)
Optimal MMI file systems for orthogonal range retrieval (1993) (8)
An Optimal Embedding of Cycles into Incomplete Hypercubes (1999) (7)
Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy (1984) (7)
The Full Steiner Tree Problem in Phylogeny (2002) (7)
Sorting by transpositions based on the first increasing substring (2004) (6)
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work (2019) (6)
Covering convex rectilinear polygons in linear time (1991) (6)
A new filtration method and a hybrid strategy for approximate string matching (2013) (5)
An Optimal Parallel Algorithm for Minimum Coloring of Intervals (1990) (5)
Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs (1989) (5)
A new parallel sorting algorithm based upon min-mid-max operations (1984) (5)
The approximability of the weighted Hamiltonian path completion problem on a tree (2005) (5)
Password authentication using Newton's interpolating polynomials (1991) (5)
The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction (2004) (5)
Recognizing Shortest-Path Trees in Linear Time (1994) (5)
A new speech hiding scheme based upon subband coding (2003) (4)
The Number of Intersections Between Two Rectangular Paths (1989) (4)
Embedding incomplete binary trees into incomplete hypercubes (1998) (4)
A unified approach for solving bottleneck k-bipartition problems (1991) (4)
A Parallel Algorithm for Solving Sparse Triangular Systems (1990) (4)
The NPO-Completeness of the Longest Hamiltonian Cycle Problem (1998) (3)
Proceedings of the 2nd International Symposium on Algorithms (1991) (3)
The average performance analysis of a closest‐pair algorithm (1984) (3)
Exact Circular Pattern Matchings Using Bit-Parallelism and q-Gram Technique ∗ (2012) (3)
A transformational approach to synthesizing combinational circuits (1991) (3)
Parallel algorithms for computing the closest visible vertex pair between two polygons (1992) (3)
Characteristics of the Hopfield associative memory utilizing isomorphism relations (1994) (3)
Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval (1997) (3)
An algorithm to generate prime implicants and its application to the selection problem (1972) (2)
Solving the set cover problem on a supercomputer (1990) (2)
An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm (1991) (2)
An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs (1997) (2)
A Parallel nonlinear Mapping Algorithm (1987) (2)
The vectorization of the partition problem (1990) (2)
An average case analysis of a resolution principle algorithm in mechanical theorem proving (1992) (2)
A systolic algorithm for extracting regions from a planar graph (1989) (2)
Application of assignment techniques to program restructuring problems (1979) (2)
Single Step Searching in Weighted Block Graphs (1994) (2)
The Equality Relation (1973) (2)
The hierarchical ordering in multiattribute files (1983) (2)
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree (2000) (2)
Generating all maximal independent sets on trees in lexicographic order (1992) (1)
An optimal embedding of incomplete binary trees onto incomplete hypercubes (1999) (1)
Redundant MKH Files Design among Multiple Disks for Concurrent Partial Match Retrieval (1996) (1)
A Generalized Mapping of 2-d Array Processor to Linear Array Processor and its Applications (1995) (1)
Optimal Multiple Key Hashing Files for Orthogonal Range Queries (1994) (1)
Special Subgraphs of Weighted Visibility Graphs (1992) (1)
Transformation completeness properties of SVPC transformation sets (1991) (1)
Storage Reduction Through Minimal Spanning Trees (1975) (1)
A parallel sorting scheme whose basic operation sortsN elements (1985) (1)
The Specialization of Programs by Theorem Proving (1973) (1)
Web-Based Synchronized Multimedia System Design for Teaching/Learning Chinese as a Foreign Language (2003) (1)
Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments (1993) (1)
An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem (1993) (1)
Chapter 12 – Concluding Remarks (1973) (0)
Application of visual display techniques to solve some biological problems (2004) (0)
An efficient access control scheme for files protection (1991) (0)
An Efficient Algorithm to Solve the Nearest Neighbor Searching Problem (2014) (0)
Semantic Resolution and Lock Resolution (1973) (0)
A Fault-Tolerance Strategy for Pyramid Architecture (1989) (0)
A Review of Parallel Sorting Algorithms (1985) (0)
The Optimality of the Number of k-Sorters of a Parallel Merging Algorithm (1985) (0)
The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs (1992) (0)
On the continuous working problem (1990) (0)
Optimal linear hashing files for orthogonal range retrieval (1996) (0)
On the state transition graph of Hopfield net model (1990) (0)
Exact Multiple String Matching Problem for DNA Alphabet (2016) (0)
Chapter 7 – Linear Resolution (1973) (0)
The exact multiple pattern matching problem solved by a reference tree approach (2021) (0)
A Systematical and Parallel Approach to Solve Problems Involving Special Properties of Bit-Vectors (2015) (0)
Some Proof Procedures Based on Herbrand's Theorem (1973) (0)
Propositional logic (2018) (0)
The First-Order Logic (1973) (0)
A Temporal Join Mechanism Based on Trie-Ranking Data Structure (1996) (0)
Approximation Algorithms (1997) (0)
A Transformational Approach to Synthesizing (1991) (0)
Deductive Question Answering, Problem Solving, and Program Synthesis (1973) (0)
A parallel algorithm for the single step searching problem (1994) (0)
The Resolution Principle (1973) (0)
A Different Approach for Solving the Specified Diameter Partition Problem (1993) (0)
Chapter 10 – Program Analysis (1973) (0)
Application of Automatic Clustering to Emitter Identification (1976) (0)
Computing the convex hull in a hammock (1992) (0)
Multidisk Smaller Sized MKH file Allocation for Partial Match Retrieval (1997) (0)
On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks (1991) (0)

This paper list is powered by the following services:

Other Resources About R. C. T. Lee

en.wikipedia.org

What Schools Are Affiliated With R. C. T. Lee?

R. C. T. Lee is affiliated with the following schools:

Image Attributions

Image Source for R. C. T. Lee