Richard C. T. Lee
Affiliations: National Tsing Hua University, Department of Computer Science, Hsinchu, Taiwan
According to our database^{1},
Richard C. T. Lee
authored at least 134 papers
between 1969 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on viaf.org

on id.loc.gov

on dnb.info

on isni.org
On csauthors.net:
Bibliography
2021
Theor. Comput. Sci., 2021
2015
A Systematical and Parallel Approach to Solve Problems Involving Special Properties of BitVectors.
Comput. J., 2015
2014
Inf. Sci., 2014
Comput. J., 2014
Proceedings of the Intelligent Systems and Applications, 2014
2013
Theor. Comput. Sci., 2013
2010
Inf. Sci., 2010
2008
Finding a longest common subsequence between a runlengthencoded string and an uncompressed string.
J. Complex., 2008
2007
Inf. Process. Lett., 2007
2005
The approximability of the weighted Hamiltonian path completion problem on a tree.
Theor. Comput. Sci., 2005
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
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004
2003
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
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
2000
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs.
Discret. Appl. Math., 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
Inf. Process. Lett., 1999
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999
1998
Inf. Process. Lett., 1998
1997
IEEE Trans. Knowl. Data Eng., 1997
J. Inf. Sci. Eng., 1997
An Optimal EREW Parallel Algorithm for Computing BreadthFirst Search Trees on Permutation Graphs.
Inf. Process. Lett., 1997
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997
1996
Redundant MKH Files Design among Multiple Disks for Concurrent Partial Match Retrieval.
J. Syst. Softw., 1996
Discret. Appl. Math., 1996
Proceedings of the COMPSAC '96, 1996
A Temporal Join Mechanism Based on TrieRanking Data Structure.
Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, 1996
1995
IEEE Trans. Computers, 1995
Pattern Recognit. Lett., 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
Inf. Sci., 1994
Inf. Sci., 1994
Inf. Sci., 1994
Inf. Process. Lett., 1994
An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1Spiral Polygons.
Inf. Process. Lett., 1994
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
J. Inf. Sci. Eng., 1993
Inf. Syst., 1993
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
Inf. Sci., 1992
Hierarchy representations based on arithmetic coding for dynamic information protection systems.
Inf. Sci., 1992
Inf. Syst., 1992
Inf. Process. Lett., 1992
Parallel algorithms for computing the closest visible vertex pair between two polygons.
Int. J. Comput. Geom. Appl., 1992
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2Relative Neighborhood Graphs.
Discret. Appl. Math., 1992
Comput. J., 1992
Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and <i>N</i>Step 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
1991
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991
IEEE Trans. Computers, 1991
J. Graph Theory, 1991
Inf. Sci., 1991
Inf. Syst., 1991
On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks.
Inf. Syst., 1991
Int. J. Comput. Geom. Appl., 1991
Int. J. Comput. Geom. Appl., 1991
Discret. Appl. Math., 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
Proceedings of the 19th annual conference on Computer Science, 1991
1990
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990
IEEE Trans. Computers, 1990
IEEE Trans. Computers, 1990
IEEE Trans. Computers, 1990
Parallel Comput., 1990
Parallel Comput., 1990
Parallel Comput., 1990
J. Inf. Sci. Eng., 1990
Inf. Process. Lett., 1990
Discret. Appl. Math., 1990
Algorithmica, 1990
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
1989
IEEE Trans. Computers, 1989
J. Inf. Sci. Eng., 1989
Inf. Process. Lett., 1989
Comput. Vis. Graph. Image Process., 1989
A branchandbound algorithm to solve the equalexecutiontime job scheduling problem with precedence constraint and profile.
Comput. Oper. Res., 1989
Optimal Parallel CircleCover and Independent Set Algorithms for CircularArc Graphs.
Proceedings of the International Conference on Parallel Processing, 1989
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.
Comput. Oper. Res., 1988
1987
Int. J. Pattern Recognit. Artif. Intell., 1987
Commun. ACM, 1987
BIT, 1987
1986
Parallel Comput., 1986
Comput. J., 1986
An <i>O</i>(<i>N</i> log <i>N</i>) Minimal Spanning Tree Algorithm for <i>N</i> Points in the Plane.
BIT, 1986
Proceedings of the VLDB'86 Twelfth International Conference on Very Large Data Bases, 1986
1985
J. Inf. Sci. Eng., 1985
Inf. Syst., 1985
Int. J. Parallel Program., 1985
1984
IEEE Trans. Software Eng., 1984
Optimal speeding up of parallel algorithms based upon the divideandconquer strategy.
Inf. Sci., 1984
BIT, 1984
BIT, 1984
BIT, 1984
1983
Inf. Sci., 1983
1982
Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries.
IEEE Trans. Software Eng., 1982
1980
IEEE Trans. Pattern Anal. Mach. Intell., 1980
Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data, 1980
1979
IEEE Trans. Software Eng., 1979
1978
IEEE Trans. Software Eng., 1978
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 <i>N</i>Space to TwoSpace.
IEEE Trans. Computers, 1977
IEEE Trans. Computers, 1977
1976
IEEE Trans. Software Eng., 1976
Proceedings of the 2nd International Conference on Software Engineering, 1976
1975
D. Michie, On Machine Intelligence.
Artif. Intell., 1975
1974
Pattern Recognit., 1974
Commun. ACM, 1974
Proceedings of the ACM SIGPLAN Symposium on Very High Level Languages, 1974
1973
IEEE Trans. Syst. Man Cybern., 1973
SIAM J. Comput., 1973
Symbolic logic and mechanical theorem proving.
Computer science classics, Academic Press, ISBN: 9780121703509, 1973
1972
J. ACM, 1972
An algorithm to generate prime implicants and its application to the selection problem.
Inf. Sci., 1972
1971
Inf. Control., December, 1971
J. ACM, 1971
Commun. ACM, 1971
1970
IEEE Trans. Computers, 1970
1969
Proceedings of the 1st International Joint Conference on Artificial Intelligence, 1969
Proceedings of the 1st International Joint Conference on Artificial Intelligence, 1969