| 公開日期 | 題名 | 作者 | 關聯 | scopus | WOS | 全文 |
1 | 1979 | Location of Multiple Points in Planar Subdivision | Lee, D. T. ; Yang, C. C. | Information Processing Letters 9(4), 190-193 | | | |
2 | 1979 | An Optimal Solution for the Channel-Assignment Problem | Gupta, U. I.; Lee, D. T. ; Leung, J. Y. T. | IEEE Trans. Comput. 28, 807-810 | | | |
3 | 1979 | An Optimal Algorithm for Finding the Kernel of a polygon | Lee, D. T. ; Preparata, F. P. | J. ACM 26, 415-421 | | | |
4 | 1979 | A Note on the All Nearest Neighbor Problem for Convex Polygons | Yang, C. C.; Lee, D. T. | Information Processing Letters 8(4), 193-194 | | | |
5 | 1978 | The All Nearest Neighbor Problem for Convex Polygons | Lee, D. T. ; Preparata, F. P. | Info. Processing Letters 7, 189-192 | | | |
6 | 1977 | Location of a Point in a Planar Subdivision and Its Applications | Lee, D. T. ; Preparata, F. P. | SIAM J. Computing 6, 594-606 | | | |
7 | 1977 | Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees | Lee, D. T. ; Wong, C. K. | Acta Informatica 9, 23-29 | | | |
8 | 1976 | An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function | Lee, D. T. ; Hong, S. J. | IEEE Trans. Comput. 25, 1117-1123 | | | |