( en | de | ru )

 

Disambiguation of "Lee, Richard C. T."

Author of the publication

copydeleteadd this publication to your clipboard
A parallel algorithm for finding congruent regions.

, , and . Parallel Comput., 13 (2): 135-142 (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Irene C T Loos

Gabriela C t noiu

Richard C Domek

Richard C Trexler

Richard C Müller

 

Other publications of authors with the same name

The NPO-Completeness of the Longest Hamiltonian Cycle Problem., , and . Inf. Process. Lett., 65 (3): 119-123 (1998)A systolic algorithm for extracting regions from a planar graph., , and . Computer Vision, Graphics, and Image Processing, 47 (2): 227-242 (1989)Generating All Maximal Independent Sets on Trees in Lexicographic Order., , and . ICCI, page 34-37. IEEE Computer Society, (1992)Optimal Multiple Key Hashing Files for Orthogonal Range Queries., , , and . Inf. Sci., 79 (1-2): 145-158 (1994)Storage Reduction Through Minimal Spanning Trees and Spanning Forests., , , and . IEEE Trans. Computers, 26 (5): 425-434 (1977)Web-Based Synchronized Multimedia System Design for Teaching/Learning Chinese as a Foreign Language., , and . KES, volume 2774 of Lecture Notes in Computer Science, page 201-207. Springer, (2003)Completeness Theorems for Semantic Resolution in Consequence-Finding., , and . IJCAI, page 281-286. William Kaufmann, (1969)A parallel algorithm for finding congruent regions., , and . Parallel Comput., 13 (2): 135-142 (1990)20-Relative Neighborhood Graphs Are Hamiltonian., , and . SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, page 53-65. Springer, (1990)Covering convex rectilinear polygons in linear time., , and . Int. J. Comput. Geom. Appl., 1 (2): 137-185 (1991)