Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
T. C. Hu
2000 – 2009
- 2008
[c11]T. C. Hu, Leo Landa, Man-tak Shing: The Unbounded Knapsack Problem. Bonn Workshop of Combinatorial Optimization 2008: 201-217- 2005
- [c10]T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler: Optimal Integer Alphabetic Trees in Linear Time. ESA 2005: 226-237
1990 – 1999
- 1997
- [c9]
- 1995
- [j19]T. C. Hu, Andrew B. Kahng, Chung-Wen Albert Tsao: Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods. INFORMS Journal on Computing 7(4): 417-425 (1995)
- [j18]Lung-Tien Liu, Ming-Ter Kuo, Chung-Kuan Cheng, T. C. Hu: A replication cut for two-way partitioning. IEEE Trans. on CAD of Integrated Circuits and Systems 14(5): 623-630 (1995)
- [j17]Charles J. Alpert, T. C. Hu, Dennis J.-H. Huang, Andrew B. Kahng, David R. Karger: Prim-Dijkstra tradeoffs for improved performance-driven routing tree design. IEEE Trans. on CAD of Integrated Circuits and Systems 14(7): 890-896 (1995)
- [c8]T. C. Hu, J. David Morgenthaler: Optimum Alphabetic Binary Trees. Combinatorics and Computer Science 1995: 234-243
- [c7]Lung-Tien Liu, Ming-Ter Kuo, Chung-Kuan Cheng, T. C. Hu: Performance-Driven Partitioning Using a Replication Graph Approach. DAC 1995: 206-210
- 1994
- [j16]So-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu: A multi-probe approach for MCM substrate testing. IEEE Trans. on CAD of Integrated Circuits and Systems 13(1): 110-121 (1994)
- [j15]Chingwei Yeh, Lung-Tien Liu, Chung-Kuan Cheng, T. C. Hu, S. Ahmed, M. Liddel: Block-oriented programmable design with switching network interconnect. IEEE Trans. VLSI Syst. 2(1): 45-53 (1994)
- 1993
- [c6]Charles J. Alpert, T. C. Hu, Jen-Hsin Huang, Andrew B. Kahng: A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-driven Global Routing. ISCAS 1993: 1869-1872
- 1992
- [j14]Chung-Kuan Cheng, T. C. Hu: Maximum Concurrent Flows and Minimum Cuts. Algorithmica 8(3): 233-249 (1992)
- [c5]So-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu: An optimal probe testing algorithm for the connectivity verification of MCM substrates. ICCAD 1992: 264-267
- 1991
- [j13]Chung-Kuan Cheng, So-Zen Yao, T. C. Hu: The Orientation of Modules Based on Graph Decomposition. IEEE Trans. Computers 40(6): 774-780 (1991)
- 1990
- [c4]Chung-Kuan Cheng, T. C. Hu: Ancestor Tree for Arbitrary Multi-Terminal Cut Functions. IPCO 1990: 115-127
1980 – 1989
- 1987
- [j12]
- [j11]
- 1985
- [c3]
- 1984
- [j10]T. C. Hu, M. T. Shing: Computation of Matrix Chain Products. Part II. SIAM J. Comput. 13(2): 228-251 (1984)
- 1983
- [j9]T. C. Hu, M. T. Shing: Multiterminal Flows in Outerplanar Networks. J. Algorithms 4(3): 241-261 (1983)
- [c2]
- 1982
- [j8]T. C. Hu, M. T. Shing: Computation of Matrix Chain Products. Part I. SIAM J. Comput. 11(2): 362-373 (1982)
- 1981
- [j7]T. C. Hu, M. T. Shing: An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon. J. Algorithms 2(2): 122-138 (1981)
- 1980
- [c1]T. C. Hu, M. T. Shing: Some Theorems about Matrix Multiplication (Extended Abstract). FOCS 1980: 28-35
1970 – 1979
- 1979
- [j6]Gururaj S. Rao, Harold S. Stone, T. C. Hu: Assignment of Task in a Distributed Processor System with Limited Memory. IEEE Trans. Computers 28(4): 291-299 (1979)
- 1977
- [j5]W. J. Blewett, T. C. Hu: Tree decomposition algorithm for large networks. Networks 7(4): 289-296 (1977)
- [j4]Frank Ruskey, T. C. Hu: Generating Binary Trees Lexicographically. SIAM J. Comput. 6(4): 745-758 (1977)
- 1974
- [j3]
- 1972
- [j2]T. C. Hu, K. C. Tan: Least Upper Bound on the Cost of Optimum Binary Search Trees. Acta Inf. 1: 307-310 (1972)
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-29 21:50 CET by the dblp team