T. C. Hu

Publication Activity (10 Years)

Years Active: 1967-2018
Publications (10 Years): 1

Top Topics

Physical Design

Binary Search Trees

Top Venues

Publications

Chung-Kuan Cheng, T. C. Hu, Andrew B. Kahng
Theory and Algorithms of Physical Design. ISPD (2018)
J. David Morgenthaler, T. C. Hu
Optimal Alphabetic Ternary Trees. CoRR (2014)
T. C. Hu, Leo Landa, Man-tak Shing
The Unbounded Knapsack Problem. Bonn Workshop of Combinatorial Optimization (2008)
T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler
Optimal Integer Alphabetic Trees in Linear Time. ESA (2005)
T. C. Hu
Physical design: mathematical models and methods. ISPD (1997)
T. C. Hu, J. David Morgenthaler
Optimum Alphabetic Binary Trees. Combinatorics and Computer Science (1995)
Lung-Tien Liu, Ming-Ter Kuo, Chung-Kuan Cheng, T. C. Hu
A replication cut for two-way partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14 (5) (1995)
Lung-Tien Liu, Ming-Ter Kuo, Chung-Kuan Cheng, T. C. Hu
Performance-Driven Partitioning Using a Replication Graph Approach. DAC (1995)
T. C. Hu, Andrew B. Kahng, Chung-Wen Albert Tsao
Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods. INFORMS J. Comput. 7 (4) (1995)
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. Comput. Aided Des. Integr. Circuits Syst. 14 (7) (1995)
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. Very Large Scale Integr. Syst. 2 (1) (1994)
So-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu
A multi-probe approach for MCM substrate testing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13 (1) (1994)
T. C. Hu, Andrew B. Kahng, Gabriel Robins
Optimal robust path planning in general environments. IEEE Trans. Robotics Autom. 9 (6) (1993)
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)
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)
Chung-Kuan Cheng, T. C. Hu
Maximum Concurrent Flows and Minimum Cuts. Algorithmica 8 (3) (1992)
Chung-Kuan Cheng, So-Zen Yao, T. C. Hu
The Orientation of Modules Based on Graph Decomposition. IEEE Trans. Computers 40 (6) (1991)
Chung-Kuan Cheng, T. C. Hu
Ancestor tree for arbitrary multi-terminal cut functions. Ann. Oper. Res. 33 (3) (1991)
T. C. Hu, Andrew B. Kahng
Every Tree is Graceful (But Some are More Graceful than Others). Applied Geometry And Discrete Mathematics (1990)
Chung-Kuan Cheng, T. C. Hu
Ancestor Tree for Arbitrary Multi-Terminal Cut Functions. IPCO (1990)
T. C. Hu, Michelle L. Wachs
Binary Search on a Tape. SIAM J. Comput. 16 (3) (1987)
Yue-Sun Kuo, T. C. Hu
An effective algorithm for optimal PLA column folding. Integr. 5 (3-4) (1987)
T. C. Hu, Yue-Sun Kuo
Graph folding and programmable logic array. Networks 17 (1) (1987)
T. C. Hu, Yue-Sun Kuo, Frank Ruskey
Some Optimum Algorithms for Scheduling Problems with Changeover Costs. Oper. Res. 35 (1) (1987)
M. T. Shing, T. C. Hu
A decomposition algorithm for multi-terminal networks flows. Discret. Appl. Math. 13 (2-3) (1986)
George B. Dantzig, Alan J. Hoffman, T. C. Hu
Triangulations (tilings) and certain block triangular matrices. Math. Program. 31 (1) (1985)
Yue-Sun Kuo, C. Chen, T. C. Hu
A heuristic algorithm for PLA block folding. DAC (1985)
T. C. Hu, M. T. Shing
Computation of Matrix Chain Products. Part II. SIAM J. Comput. 13 (2) (1984)
T. C. Hu, Yue-Sun Kuo
Optimum reduction of programmable logic array. DAC (1983)
T. C. Hu, M. T. Shing
Multiterminal Flows in Outerplanar Networks. J. Algorithms 4 (3) (1983)
T. C. Hu, M. T. Shing
Computation of Matrix Chain Products. Part I. SIAM J. Comput. 11 (2) (1982)
T. C. Hu, M. T. Shing
An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon. J. Algorithms 2 (2) (1981)
T. C. Hu, Frank Ruskey
Circular Cuts in a Network. Math. Oper. Res. 5 (3) (1980)
T. C. Hu, M. T. Shing
Some Theorems about Matrix Multiplication (Extended Abstract) FOCS (1980)
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) (1979)
B. N. Tien, T. C. Hu
Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem. Oper. Res. 25 (3) (1977)
Frank Ruskey, T. C. Hu
Generating Binary Trees Lexicographically. SIAM J. Comput. 6 (4) (1977)
W. J. Blewett, T. C. Hu
Tree decomposition algorithm for large networks. Networks 7 (4) (1977)
T. C. Hu, Melanie L. Lenard
Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems. Oper. Res. 24 (1) (1976)
P. J. Koutas, T. C. Hu
Shortest string containing all permutations. Discret. Math. 11 (2) (1975)
T. C. Hu
Optimum Communication Spanning Trees. SIAM J. Comput. 3 (3) (1974)
T. C. Hu
Two-commodity cut-packing problem. Math. Program. 4 (1) (1973)
T. C. Hu, K. C. Tan
Least Upper Bound on the Cost of Optimum Binary Search Trees. Acta Informatica 1 (1972)
T. C. Hu
A Comment on the Double-Chained Tree. Commun. ACM 15 (4) (1972)
T. C. Hu
Some problems in discrete optimization. Math. Program. 1 (1) (1971)
T. C. Hu
A Decomposition Algorithm for Shortest Paths in a Network. Oper. Res. 16 (1) (1968)
T. C. Hu
Laplace's Equation and Network Flows. Oper. Res. 15 (2) (1967)