Richard C. T. Lee
According to our database^{1},
Richard C. T. Lee
authored at least 132 papers
between 1969 and 2015.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at viaf.org

at id.loc.gov

at isni.org
On csauthors.net:
Bibliography
2015
A Systematical and Parallel Approach to Solve Problems Involving Special Properties of BitVectors.
Comput. J., 2015
2014
A reversible acoustic data hiding method based on analog modulation.
Inf. Sci., 2014
BitParallel Algorithms for Exact Circular String Matching.
Comput. J., 2014
An Efficient Algorithm to Solve the Nearest Neighbor Searching Problem.
Proceedings of the Intelligent Systems and Applications, 2014
2013
A new filtration method and a hybrid strategy for approximate string matching.
Theor. Comput. Sci., 2013
2010
Data hiding methods based upon DNA sequences.
Inf. Sci., 2010
2008
Finding a longest common subsequence between a runlengthencoded string and an uncompressed string.
J. Complexity, 2008
2007
Edit distance for a runlengthencoded string and an uncompressed string.
Inf. Process. Lett., 2007
2005
The approximability of the weighted Hamiltonian path completion problem on a tree.
Theor. Comput. Sci., 2005
Some Optimal Parallel Algorithms on Interval and Circulararc Graphs.
J. Inf. Sci. Eng., 2005
2004
The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction.
J. Comb. Optim., 2004
Application of Visual Display Techniques to Solve Some Biological Problems.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004
Sorting by Transpositions Based on the First Increasing Substring Concept.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004
2003
The full Steiner tree problem.
Theor. Comput. Sci., 2003
WebBased Synchronized Multimedia System Design for Teaching/Learning Chinese as a Foreign Language.
Proceedings of the KnowledgeBased Intelligent Information and Engineering Systems, 2003
2002
The Full Steiner Tree Problem in Phylogeny.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
2000
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
1999
An Optimal Embedding of Cycles into Incomplete Hypercubes.
Inf. Process. Lett., 1999
An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999
1998
The NPOCompleteness of the Longest Hamiltonian Cycle Problem.
Inf. Process. Lett., 1998
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998
1997
Optimal Bucket Allocation Design of kary MKH Files for Partial Match Retrieval.
IEEE Trans. Knowl. Data Eng., 1997
Multidisk Smaller Sized MKH file Allocation for Partial Match Retrieval.
J. Inf. Sci. Eng., 1997
An Optimal EREW Parallel Algorithm for Computing BreadthFirst Search Trees on Permutation Graphs.
Inf. Process. Lett., 1997
Approximation Algorithms.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997
1996
Redundant MKH Files Design among Multiple Disks for Concurrent Partial Match Retrieval.
Journal of Systems and Software, 1996
The Weighted Perfect Domination Problem and Its Variants.
Discrete Applied Mathematics, 1996
Optimal Linear Hashing Files for Orthogonal Range Retrieval.
Proceedings of the COMPSAC '96, 1996
A Temporal Join Mechanism Based on TrieRanking Data Structure.
CODAS, 1996
1995
New PublicKey Cipher System Based Upon the Diophantine Equations.
IEEE Trans. Computers, 1995
A near patternmatching scheme based upon principal component analysis.
Pattern Recognition Letters, 1995
A Generalized Mapping of 2d Array Processor to Linear Array Processor and its Applications.
Parallel Algorithms Appl., 1995
1994
Characteristics of the Hopfield associative memory utilizing isomorphism relations.
IEEE Trans. Neural Networks, 1994
Optimal Multiple Key Hashing Files for Orthogonal Range Queries.
Inf. Sci., 1994
Single Step Searching in Weighted Block Graphs.
Inf. Sci., 1994
Recognizing ShortestPath Trees in Linear Time.
Inf. Process. Lett., 1994
An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1Spiral Polygons.
Inf. Process. Lett., 1994
A parallel algorithm for the single step searching problem.
Proceedings of the International Symposium on Parallel Architectures, 1994
1993
Optimal Parallel Preprocessing Algorithms for Testing Weak Visibility of Polygons from Segments.
Parallel Algorithms Appl., 1993
A Different Approach for Solving the Specified Diameter Partition Problem.
J. Inf. Sci. Eng., 1993
Optimal MMI file systems for orthogonal range retrieval.
Inf. Syst., 1993
The Slab Dividing Approach To Solve the Euclidean PCenter Problem.
Algorithmica, 1993
The Searching over Separators Strategy To Solve Some NPHard Problems in Subexponential Time.
Algorithmica, 1993
Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
An Optimal Algorithm for Solving the Restricted Minimal Convex Nested Polygonal Separation Problem.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
The Minimum Cooperative Guards Problem on Kspiral Polygons.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
Computing the convex hull in a hammock.
Inf. Sci., 1992
Hierarchy representations based on arithmetic coding for dynamic information protection systems.
Inf. Sci., 1992
A conference key broadcasting system using sealed locks.
Inf. Syst., 1992
Special Subgraphs of Weighted Visibility Graphs.
Inf. Process. Lett., 1992
Parallel algorithms for computing the closest visible vertex pair between two polygons.
Int. J. Comput. Geometry Appl., 1992
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2Relative Neighborhood Graphs.
Discrete Applied Mathematics, 1992
A RecordOriented Cryptosystem for Database Sharing (Short Note).
Comput. J., 1992
Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and NStep SCAN.
BIT, 1992
An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving.
Ann. Math. Artif. Intell., 1992
Solving the Euclidean Bottleneck Matching Problem by kRelative Neighborhood Graphs.
Algorithmica, 1992
The Application of the Searching over Separators Strategy to Solve Some NPComplete Problems on Planar Graphs.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
Generating All Maximal Independent Sets on Trees in Lexicographic Order.
Proceedings of the Computing and Information, 1992
1991
A transformational approach to synthesizing combinational circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1991
Minimum Spanning Trees of Moving Points in the Plane.
IEEE Trans. Computers, 1991
On weighted rectilinear 2center and 3center problems.
Inf. Sci., 1991
Password authentication using Newton's interpolating polynomials.
Inf. Syst., 1991
On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks.
Inf. Syst., 1991
Covering convex rectilinear polygons in linear time.
Int. J. Comput. Geometry Appl., 1991
Transformation completeness properties of SVPC transformation sets.
Discrete Applied Mathematics, 1991
An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm.
Proceedings of the ISA '91 Algorithms, 1991
ConflictFree Sorting Algorithms Under SingleChannel and MultiChannel Broadcast Communication Models.
Proceedings of the Advances in Computing and Information, 1991
A unified approach for solving bottleneck kbipartition problems.
Proceedings of the 19th annual conference on Computer Science, 1991
1990
Minimum rectangular partition problem for simple rectilinear polygons.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1990
Parallel Graph Algorithms Based Upon Broadcast Communications.
IEEE Trans. Computers, 1990
An Efficient Channel Routing Algorithm to Yield an Optimal Solution.
IEEE Trans. Computers, 1990
A Parallel Algorithm for Solving Sparse Triangular Systems.
IEEE Trans. Computers, 1990
Solving the set cover problem on a supercomputer.
Parallel Computing, 1990
The vectorization of the partition problem.
Parallel Computing, 1990
A parallel algorithm for finding congruent regions.
Parallel Computing, 1990
A Dynamic Access Control Mechanism in Information Protection Systems.
J. Inf. Sci. Eng., 1990
The Weighted Perfect Domination Problem.
Inf. Process. Lett., 1990
On the continuous working problem.
Discrete Applied Mathematics, 1990
An Optimal Approximation Algorithm for the Rectilinear mCenter Problem.
Algorithmica, 1990
20Relative Neighborhood Graphs Are Hamiltonian.
Proceedings of the Algorithms, 1990
On the state transition graph of Hopfield net model.
Proceedings of the IJCNN 1990, 1990
An Optimal Parallel Algorithm for Minimum Coloring of Intervals.
Proceedings of the 1990 International Conference on Parallel Processing, 1990
Voronoi Diagrams of Moving Points in the Plane.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990
1989
The Number of Intersections Between Two Rectangular Paths.
IEEE Trans. Computers, 1989
A FaultTolerance Strategy for Pyramid Architecture.
J. Inf. Sci. Eng., 1989
Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel.
Inf. Process. Lett., 1989
A systolic algorithm for extracting regions from a planar graph.
Computer Vision, Graphics, and Image Processing, 1989
A branchandbound algorithm to solve the equalexecutiontime job scheduling problem with precedence constraint and profile.
Computers & OR, 1989
Optimal Parallel CircleCover and Independent Set Algorithms for CircularArc Graphs.
Proceedings of the International Conference on Parallel Processing, 1989
Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989
1988
Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs.
Inf. Process. Lett., 1988
On a scheduling problem where a job can be executed only by a limited number of processors.
Computers & OR, 1988
1987
A Parallel nonlinear Mapping Algorithm.
IJPRAI, 1987
Systolic Algorithms to Examine All Pairs of Elements.
Commun. ACM, 1987
A New Systolic Architecture for Convex Hull and HalfPlane Intersection Problems.
BIT, 1987
1986
The mapping of 2D array processors to 1D array processors.
Parallel Computing, 1986
A LetterOriented Minimal Perfect Hashing Scheme.
Comput. J., 1986
An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane.
BIT, 1986
The Idea of DeClustering and its Applications.
Proceedings of the VLDB'86 Twelfth International Conference on Very Large Data Bases, 1986
1985
The Optimality of the Number of kSorters of a Parallel Merging Algorithm.
J. Inf. Sci. Eng., 1985
On the complexity of some multiattribute file design problems.
Inf. Syst., 1985
A parallel sorting scheme whose basic operation sortsN elements.
International Journal of Parallel Programming, 1985
1984
Performance Analyses of Cartesian Product Files and Random Files.
IEEE Trans. Software Eng., 1984
Optimal speeding up of parallel algorithms based upon the divideandconquer strategy.
Inf. Sci., 1984
A Parallel Algorithm to Solve the Stable Marriage Problem.
BIT, 1984
A New Parallel Sorting Algorithm Based Upon MinMidMax Operations.
BIT, 1984
On the Average Length of Delaunay Triangulations.
BIT, 1984
1983
The hierarchical ordering in multiattribute files.
Inf. Sci., 1983
1982
Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries.
IEEE Trans. Software Eng., 1982
1980
Symbolic Gray Code as a Multikey Hashing Function.
IEEE Trans. Pattern Anal. Mach. Intell., 1980
Some Properties of Cartesian Product Files.
Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data, 1980
1979
Common Properties of Some Multiattribute File Systems.
IEEE Trans. Software Eng., 1979
1978
Towards Automatic Auditing of Records.
IEEE Trans. Software Eng., 1978
A nearest neighbor search technique with short zeroin time.
Proceedings of the IEEE Computer Society's Second International Computer Software and Applications Conference, 1978
1977
A Triangulation Method for the Sequential Mapping of Points from NSpace to TwoSpace.
IEEE Trans. Computers, 1977
Storage Reduction Through Minimal Spanning Trees and Spanning Forests.
IEEE Trans. Computers, 1977
1976
Application of Principal Component Analysis to Multikey Searching.
IEEE Trans. Software Eng., 1976
Application of Clustering to Estimate Missing Data and Improve Data Integrity.
Proceedings of the 2nd International Conference on Software Engineering, 1976
1975
D. Michie, On Machine Intelligence.
Artif. Intell., 1975
1974
Experiments with some cluster analysis algorithms.
Pattern Recognition, 1974
An Improved ProgramSynthesizing Algorithm and Its Correctness.
Commun. ACM, 1974
1973
A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis.
IEEE Trans. Systems, Man, and Cybernetics, 1973
The Specialization of Programs by Theorem Proving.
SIAM J. Comput., 1973
Symbolic logic and mechanical theorem proving.
Computer science classics, Academic Press, ISBN: 9780121703509, 1973
1972
An algorithm to generate prime implicants and its application to the selection problem.
Inf. Sci., 1972
1971
Some Properties of Fuzzy Logic
Information and Control, December, 1971
On the Optimal Solutions to AND/OR SeriesParallel Graphs.
J. ACM, 1971
Application of Game Tree Searching Techniques to Sequential Pattern Recognition.
Commun. ACM, 1971
Fuzzy Logic and the Resolution Principle.
Proceedings of the 2nd International Joint Conference on Artificial Intelligence. London, 1971
1970
A New Algorithm for Generating Prime Implicants.
IEEE Trans. Computers, 1970
1969
PROW: A Step Toward Automatic Program Writing.
Proceedings of the 1st International Joint Conference on Artificial Intelligence, 1969
Completeness Theorems for Semantic Resolution in ConsequenceFinding.
Proceedings of the 1st International Joint Conference on Artificial Intelligence, 1969