T. C. Hu

According to our database1, T. C. Hu
  • authored at least 45 papers between 1967 and 2014.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2014
Optimal Alphabetic Ternary Trees.
CoRR, 2014

2008
The Unbounded Knapsack Problem.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2005
Optimal Integer Alphabetic Trees in Linear Time.
Proceedings of the Algorithms, 2005

1997
Physical design: mathematical models and methods.
Proceedings of the 1997 International Symposium on Physical Design, 1997

1995
A replication cut for two-way partitioning.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1995

Prim-Dijkstra tradeoffs for improved performance-driven routing tree design.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1995

Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods.
INFORMS Journal on Computing, 1995

Performance-Driven Partitioning Using a Replication Graph Approach.
Proceedings of the 32st Conference on Design Automation, 1995

Optimum Alphabetic Binary Trees.
Proceedings of the Combinatorics and Computer Science, 1995

1994
Block-oriented programmable design with switching network interconnect.
IEEE Trans. VLSI Syst., 1994

A multi-probe approach for MCM substrate testing.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1994

1993
Optimal robust path planning in general environments.
IEEE Trans. Robotics and Automation, 1993

A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-driven Global Routing.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

1992
Maximum Concurrent Flows and Minimum Cuts.
Algorithmica, 1992

An optimal probe testing algorithm for the connectivity verification of MCM substrates.
Proceedings of the 1992 IEEE/ACM International Conference on Computer-Aided Design, 1992

1991
The Orientation of Modules Based on Graph Decomposition.
IEEE Trans. Computers, 1991

1990
Ancestor Tree for Arbitrary Multi-Terminal Cut Functions.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

Every Tree is Graceful (But Some are More Graceful than Others).
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1987
Binary Search on a Tape.
SIAM J. Comput., 1987

Graph folding and programmable logic array.
Networks, 1987

Some Optimum Algorithms for Scheduling Problems with Changeover Costs.
Operations Research, 1987

An effective algorithm for optimal PLA column folding.
Integration, 1987

1986
A decomposition algorithm for multi-terminal networks flows.
Discrete Applied Mathematics, 1986

1985
Triangulations (tilings) and certain block triangular matrices.
Math. Program., 1985

A heuristic algorithm for PLA block folding.
Proceedings of the 22nd ACM/IEEE conference on Design automation, 1985

1984
Computation of Matrix Chain Products. Part II.
SIAM J. Comput., 1984

1983
Multiterminal Flows in Outerplanar Networks.
J. Algorithms, 1983

Optimum reduction of programmable logic array.
Proceedings of the 20th Design Automation Conference, 1983

1982
Computation of Matrix Chain Products. Part I.
SIAM J. Comput., 1982

1981
An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon.
J. Algorithms, 1981

1980
Circular Cuts in a Network.
Math. Oper. Res., 1980

Some Theorems about Matrix Multiplication (Extended Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
Assignment of Task in a Distributed Processor System with Limited Memory.
IEEE Trans. Computers, 1979

1977
Generating Binary Trees Lexicographically.
SIAM J. Comput., 1977

Tree decomposition algorithm for large networks.
Networks, 1977

Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem.
Operations Research, 1977

1976
Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems.
Operations Research, 1976

1975
Shortest string containing all permutations.
Discrete Mathematics, 1975

1974
Optimum Communication Spanning Trees.
SIAM J. Comput., 1974

1973
Two-commodity cut-packing problem.
Math. Program., 1973

1972
A Comment on the Double-Chained Tree.
Commun. ACM, 1972

Least Upper Bound on the Cost of Optimum Binary Search Trees.
Acta Inf., 1972

1971
Some problems in discrete optimization.
Math. Program., 1971

1968
A Decomposition Algorithm for Shortest Paths in a Network.
Operations Research, 1968

1967
Laplace's Equation and Network Flows.
Operations Research, 1967


  Loading...