T. C. Hu

47 papers A* 4A 2B 1C 1Journal 34Unranked 5
YearRankTypeTitle / Venue / Authors
2018 — conf
Theory and Algorithms of Physical Design.
ISPD
Chung-Kuan Cheng, T. C. Hu, Andrew B. Kahng
2014 J jnl
Optimal Alphabetic Ternary Trees.
CoRR
J. David Morgenthaler, T. C. Hu
2008 — conf
The Unbounded Knapsack Problem.
Bonn Workshop of Combinatorial Optimization
T. C. Hu, Leo Landa, Man-tak Shing
2005 A conf
Optimal Integer Alphabetic Trees in Linear Time.
ESA
T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler
1997 — conf
Physical design: mathematical models and methods.
ISPD
T. C. Hu
1995 J jnl
A replication cut for two-way partitioning.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Lung-Tien Liu, Ming-Ter Kuo, Chung-Kuan Cheng, T. C. Hu
1995 J jnl
Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods.
INFORMS J. Comput.
T. C. Hu, Andrew B. Kahng, Chung-Wen Albert Tsao
1995 — conf
Optimum Alphabetic Binary Trees.
Combinatorics and Computer Science
T. C. Hu, J. David Morgenthaler
1995 A* conf
Performance-Driven Partitioning Using a Replication Graph Approach.
DAC
Lung-Tien Liu, Ming-Ter Kuo, Chung-Kuan Cheng, T. C. Hu
1995 J jnl
Prim-Dijkstra tradeoffs for improved performance-driven routing tree design.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Charles J. Alpert, T. C. Hu, Dennis J.-H. Huang, Andrew B. Kahng, David R. Karger
1994 J jnl
A multi-probe approach for MCM substrate testing.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
So-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu
1994 J jnl
Block-oriented programmable design with switching network interconnect.
IEEE Trans. Very Large Scale Integr. Syst.
Chingwei Yeh, Lung-Tien Liu, Chung-Kuan Cheng, T. C. Hu, S. Ahmed, M. Liddel
1993 C conf
A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-driven Global Routing.
ISCAS
Charles J. Alpert, T. C. Hu, Jen-Hsin Huang, Andrew B. Kahng
1993 J jnl
Optimal robust path planning in general environments.
IEEE Trans. Robotics Autom.
T. C. Hu, Andrew B. Kahng, Gabriel Robins
1992 A conf
An optimal probe testing algorithm for the connectivity verification of MCM substrates.
ICCAD
So-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu
1992 J jnl
Maximum Concurrent Flows and Minimum Cuts.
Algorithmica
Chung-Kuan Cheng, T. C. Hu
1991 J jnl
Ancestor tree for arbitrary multi-terminal cut functions.
Ann. Oper. Res.
Chung-Kuan Cheng, T. C. Hu
1991 J jnl
The Orientation of Modules Based on Graph Decomposition.
IEEE Trans. Computers
Chung-Kuan Cheng, So-Zen Yao, T. C. Hu
1990 B conf
Ancestor Tree for Arbitrary Multi-Terminal Cut Functions.
IPCO
Chung-Kuan Cheng, T. C. Hu
1990 — conf
Every Tree is Graceful (But Some are More Graceful than Others).
Applied Geometry And Discrete Mathematics
T. C. Hu, Andrew B. Kahng
1987 J jnl
An effective algorithm for optimal PLA column folding.
Integr.
Yue-Sun Kuo, T. C. Hu
1987 J jnl
Binary Search on a Tape.
SIAM J. Comput.
T. C. Hu, Michelle L. Wachs
1987 J jnl
Graph folding and programmable logic array.
Networks
T. C. Hu, Yue-Sun Kuo
1987 J jnl
Some Optimum Algorithms for Scheduling Problems with Changeover Costs.
Oper. Res.
T. C. Hu, Yue-Sun Kuo, Frank Ruskey
1986 J jnl
A decomposition algorithm for multi-terminal networks flows.
Discret. Appl. Math.
M. T. Shing, T. C. Hu
1985 A* conf
A heuristic algorithm for PLA block folding.
DAC
Yue-Sun Kuo, C. Chen, T. C. Hu
1985 J jnl
Triangulations (tilings) and certain block triangular matrices.
Math. Program.
George B. Dantzig, Alan J. Hoffman, T. C. Hu
1984 J jnl
Computation of Matrix Chain Products. Part II.
SIAM J. Comput.
T. C. Hu, M. T. Shing
1983 J jnl
Multiterminal Flows in Outerplanar Networks.
J. Algorithms
T. C. Hu, M. T. Shing
1983 A* conf
Optimum reduction of programmable logic array.
DAC
T. C. Hu, Yue-Sun Kuo
1982 J jnl
Computation of Matrix Chain Products. Part I.
SIAM J. Comput.
T. C. Hu, M. T. Shing
1981 J jnl
An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon.
J. Algorithms
T. C. Hu, M. T. Shing
1980 J jnl
Circular Cuts in a Network.
Math. Oper. Res.
T. C. Hu, Frank Ruskey
1980 A* conf
Some Theorems about Matrix Multiplication (Extended Abstract)
FOCS
T. C. Hu, M. T. Shing
1979 J jnl
Assignment of Task in a Distributed Processor System with Limited Memory.
IEEE Trans. Computers
Gururaj S. Rao, Harold S. Stone, T. C. Hu
1977 J jnl
Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem.
Oper. Res.
B. N. Tien, T. C. Hu
1977 J jnl
Generating Binary Trees Lexicographically.
SIAM J. Comput.
Frank Ruskey, T. C. Hu
1977 J jnl
Tree decomposition algorithm for large networks.
Networks
W. J. Blewett, T. C. Hu
1976 J jnl
Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems.
Oper. Res.
T. C. Hu, Melanie L. Lenard
1975 J jnl
Shortest string containing all permutations.
Discret. Math.
P. J. Koutas, T. C. Hu
1974 J jnl
Optimum Communication Spanning Trees.
SIAM J. Comput.
T. C. Hu
1973 J jnl
Two-commodity cut-packing problem.
Math. Program.
T. C. Hu
1972 J jnl
A Comment on the Double-Chained Tree.
Commun. ACM
T. C. Hu
1972 J jnl
Least Upper Bound on the Cost of Optimum Binary Search Trees.
Acta Informatica
T. C. Hu, Kay Chen Tan
1971 J jnl
Some problems in discrete optimization.
Math. Program.
T. C. Hu
1968 J jnl
A Decomposition Algorithm for Shortest Paths in a Network.
Oper. Res.
T. C. Hu
1967 J jnl
Laplace's Equation and Network Flows.
Oper. Res.
T. C. Hu