| 2005 |
|---|
| 25 | EE | T. C. Hu,
Lawrence L. Larmore,
J. David Morgenthaler:
Optimal Integer Alphabetic Trees in Linear Time.
ESA 2005: 226-237 |
| 1997 |
|---|
| 24 | EE | T. C. Hu:
Physical design: mathematical models and methods.
ISPD 1997: 207-210 |
| 1995 |
|---|
| 23 | | T. C. Hu,
J. David Morgenthaler:
Optimum Alphabetic Binary Trees.
Combinatorics and Computer Science 1995: 234-243 |
| 22 | | Lung-Tien Liu,
Ming-Ter Kuo,
Chung-Kuan Cheng,
T. C. Hu:
Performance-Driven Partitioning Using a Replication Graph Approach.
DAC 1995: 206-210 |
| 21 | EE | 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) |
| 20 | EE | 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) |
| 1994 |
|---|
| 19 | EE | 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) |
| 18 | EE | 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) |
| 1993 |
|---|
| 17 | | 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 |
|---|
| 16 | EE | So-Zen Yao,
Nan-Chi Chou,
Chung-Kuan Cheng,
T. C. Hu:
An optimal probe testing algorthm for the connectivity verification of MCM substrates.
ICCAD 1992: 264-267 |
| 15 | | Chung-Kuan Cheng,
T. C. Hu:
Maximum Concurrent Flows and Minimum Cuts.
Algorithmica 8(3): 233-249 (1992) |
| 1991 |
|---|
| 14 | | Chung-Kuan Cheng,
S. Z. Yao,
T. C. Hu:
The Orientation of Modules Based on Graph Decomposition.
IEEE Trans. Computers 40(6): 774-780 (1991) |
| 1990 |
|---|
| 13 | | Chung-Kuan Cheng,
T. C. Hu:
Ancestor Tree for Arbitrary Multi-Terminal Cut Functions.
IPCO 1990: 115-127 |
| 1987 |
|---|
| 12 | | T. C. Hu,
Michelle L. Wachs:
Binary Search on a Tape.
SIAM J. Comput. 16(3): 573-590 (1987) |
| 1985 |
|---|
| 11 | EE | Y. S. Kuo,
C. Chen,
T. C. Hu:
A heuristic algorithm for PLA block folding.
DAC 1985: 744-747 |
| 1984 |
|---|
| 10 | | T. C. Hu,
M. T. Shing:
Computation of Matrix Chain Products. Part II.
SIAM J. Comput. 13(2): 228-251 (1984) |
| 1983 |
|---|
| 9 | | T. C. Hu,
M. T. Shing:
Multiterminal Flows in Outerplanar Networks.
J. Algorithms 4(3): 241-261 (1983) |
| 1982 |
|---|
| 8 | | T. C. Hu,
M. T. Shing:
Computation of Matrix Chain Products. Part I.
SIAM J. Comput. 11(2): 362-373 (1982) |
| 1981 |
|---|
| 7 | | 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 |
|---|
| 6 | | T. C. Hu,
M. T. Shing:
Some Theorems about Matrix Multiplication (Extended Abstract)
FOCS 1980: 28-35 |
| 1979 |
|---|
| 5 | | 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 |
|---|
| 4 | | Frank Ruskey,
T. C. Hu:
Generating Binary Trees Lexicographically.
SIAM J. Comput. 6(4): 745-758 (1977) |
| 1974 |
|---|
| 3 | | T. C. Hu:
Optimum Communication Spanning Trees.
SIAM J. Comput. 3(3): 188-195 (1974) |
| 1972 |
|---|
| 2 | | T. C. Hu,
K. C. Tan:
Least Upper Bound on the Cost of Optimum Binary Search Trees
Acta Inf. 1: 307-310 (1972) |
| 1 | | T. C. Hu:
A Comment on the Double-Chained Tree.
Commun. ACM 15(4): 276 (1972) |
