公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2005 | An Optimal Algorithm for Online Square Detection. | Chen, Gen-Huey; Hong, Jin-Ju; HSUEH-I LU | Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings | | | |
2005 | An optimal algorithm for the maximum-density segment problem | Chung, Kai-Min; Lu, Hsueh-I | | 39 | 31 | |
2004 | An Optimal Algorithm for the Maximum-Density Segment Problem | Chung, Kai-min; Lu, Hsueh-I | SIAM Journal on Computing | 38 | 31 | |
2003 | An Optimal Algorithm for the Maximum-Density Segment Problem. | Chung, Kai-Min; HSUEH-I LU | Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings | 5 | 0 | |
2000 | Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. | Chen, Yuyu; Kao, Ming-Yang; HSUEH-I LU | Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings | | | |
2009 | An Optimal Labeling for Node Connectivity. | Hsu, Tai-Hsin; HSUEH-I LU | Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings | | | |
2005 | Orderly Spanning Trees with Applications | CHIANG, YI-TING; LIN, CHING-CHI; LU, HSUEH-I | SIAM Journal on Computing | 44 | 39 | |
2005 | Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices. | Chen, Jian-Jia; Kuo, Tei-Wei; HSUEH-I LU | Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings | | | |
1996 | Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). | Klein, Philip N.; Lu, Hsueh-I; Netzer, Robert H. B.; HSUEH-I LU | Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings | | | |
2012 | Randomly coloring regular bipartite graphs and graphs with bounded common neighbors | Kuo, C.-C.; HSUEH-I LU | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | | | |
2012 | Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors. | Kuo, Ching-Chen; HSUEH-I LU | Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings | | | |
2013 | Rating equity funds against return of random traders | Hung, T.-W.; Wu, M.-E.; Lu, H.-I.; HSUEH-I LU | Proceedings - SocialCom/PASSAT/BigData/EconCom/BioMedCom 2013 | 1 | 0 | |
2014 | Replacement paths via row minima of concise matrices | Lee, C.-W.; HSUEH-I LU | SIAM Journal on Discrete Mathematics | | | |
1999 | Segmented bus design for low-power systems | Chen, J.Y.; Jone, W.B.; Wang, J.S.; Lu, H.-I.; Chen, T.F.; HSUEH-I LU | IEEE Transactions on Very Large Scale Integration (VLSI) Systems | | | |
2023 | A Simple 2 -Approximation for Maximum-Leaf Spanning Tree | Liao, I. Cheng; HSUEH-I LU | International Journal of Foundations of Computer Science | 0 | 0 | |
2002 | Some applications of orderly spanning trees in graph drawing | CHEN HO-LIN ; Liao, C.-C.; HSUEH-I LU ; HSU-CHUN YEN | Lecture Notes in Computer Science | 11 | | |
1998 | Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. | Klein, Philip N.; HSUEH-I LU | Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings | | | |
2020 | Three-in-a-tree in near linear time | Lai, K.-Y.; Thorup, M.; HSUEH-I LU | Proceedings of the Annual ACM Symposium on Theory of Computing | 9 | 0 | |
2011 | Two-dimensional homing sort | Wang, B.-Y.; HSUEH-I LU | Information Processing Letters | | | |
2009 | Visibility representations of four-connected plane graphs with near optimal heights | Chen, C.-Y.; Hung, Y.-F.; HSUEH-I LU | Computational Geometry: Theory and Applications | 0 | 0 | |