Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
2004 | An Adaptive PID-Type Iterative Learning Controller for Unknown Nonlinear Systems | Wang, Y. C.; Chien, C. J.; Lee, D. T. | | | | |
2003 | An Advanced Traveler Information System with Emerging Network Technologies | Wu, Chun-Hsin; Su, Da-Chun; Chang, Justin; Wei, Chia-Chen; Ho, Jan-Ming; Lin, Kwei-Jay; Lee, D. T. | | | | |
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 | | | |
2014 | An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips | Chun-Xun Lin; Chih-Hung Liu; I-Che Chen; D.T. Lee ; Tsung-Yi Ho | | | | |
1987 | An efficient new algorithm for 2-D line clipping: Its development and analysis | Nicholl, T. M.; Lee, D. T. ; Nicholl, R. A. | ACM SIGGRAPH Computer Graphics 21(4), 253-262 | | | |
1982 | An Improved Algorithm for the Rectangle Enclosure Problem | Lee, D. T. ; Preparata, F. P. | Journal of Algorithms 3(3), 218-224 | | | |
2006 | An iterative distributed algorithm for multi-constraint multicast routing | Huang, T. L.; Lee, D. T. | Computer Communications 29(17), 3647-3661 | | | |
1980 | An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Engineering Optimization 4, 179-192 | | | |
1981 | An O(n log n) Heuristic for Steiner Minimal Tree Problems on the Euclidean Metric | Smith, J. M.; Lee, D. T. ; Liebman, J. S. | Networks 11, 23-29 | | | |
1981 | An On-Chip Compare/Steer Bubble Sorter | Lee, D. T. ; Chang, H.; Wong, C. K. | IEEE Trans. Comput. 30, 396-405 | | | |
1979 | An Optimal Algorithm for Finding the Kernel of a polygon | Lee, D. T. ; Preparata, F. P. | J. ACM 26, 415-421 | | | |
1995 | An Optimal Algorithm for Roundness Determination on Convex Polygons | Swanson, K.; Lee, D. T. ; Wu, V. L. | Computational Geometry: Theory and Applications 5, 225-235 | | | |
1995 | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-arc Graphs with Applications | Atallah, M. J.; Chen, D. Z.; Lee, D. T. | Algorithmica 14, 429-441 | | | |
1992 | An Optimal Algorithm for the Maximum Two-Chain Problem | Lou, R. D.; Sarrafzadeh, M.; Lee, D. T. | SIAM J. Discrete Algorithms 5, 285-304 | | | |
1982 | An Optimal Illumination Region Algorithm for Convex Polygons | Lee, D. T. ; Silio Jr, C. B. | IEEE Transactions on Computers 31(12), 225-1227 | | | |
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 | | | |
1984 | An Optimal Time and Minimal Space Algorithm for Rectangle Intersection Problems | Lee, D. T. | International Journal of Computer & Information Sciences 13, 23-32 | | | |
2008 | An Output Recurrent Fuzzy Neural Network Based Iterative Learning Control for Nonlinear Systems | Wang, Y. -C.; Chien, C. -J.; Lee, D. -T. | | | | |
2011 | An Output-Sensitive Approach for the L_1/L_infinity k Nearest Neighbor Voronoi Diagram | Liu, Chih-Hung; Papadopoulou, Evanthia; Lee, D. T. | | | | |
2009 | Analyzing the breakpoint regions of genomic rearrangement events at nucleotide level by sequence alignment | Chu, Te-Chin; Liu, Tsunglin; Lee, D. T. ; Lee, Greg C.; Shih, Arthur Chun-Chieh | | | | |