T. C. Hu - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 46 from 46

2018

Theory and Algorithms of Physical DesignChung-Kuan Cheng, T. C. Hu, Andrew B. Kahng. ispd 2018: 130-131 [doi]

2008

The Unbounded Knapsack ProblemT. C. Hu, Leo Landa, Man-tak Shing. bonnco 2009: 201-217 [doi]

2005

Optimal Integer Alphabetic Trees in Linear TimeT. C. Hu, Lawrence L. Larmore, J. David Morgenthaler. esa 2005: 226-237 [doi]

1997

Physical design: mathematical models and methodsT. C. Hu. ispd 1997: 207-210 [doi]

1995

1994

A multi-probe approach for MCM substrate testingSo-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu. tcad, 13(1):110-121, 1994. [doi]

Block-oriented programmable design with switching network interconnectChingwei Yeh, Lung-Tien Liu, Chung-Kuan Cheng, T. C. Hu, S. Ahmed, M. Liddel. tvlsi, 2(1):45-53, 1994. [doi]

1993

A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-driven Global RoutingCharles J. Alpert, T. C. Hu, Jen-Hsin Huang, Andrew B. Kahng. iscas 1993: 1869-1872

Optimal robust path planning in general environmentsT. C. Hu, Andrew B. Kahng, Gabriel Robins. trob, 9(6):775-784, 1993. [doi]

1992

Maximum Concurrent Flows and Minimum CutsChung-Kuan Cheng, T. C. Hu. algorithmica, 8(3):233-249, 1992.

An optimal probe testing algorthm for the connectivity verification of MCM substratesSo-Zen Yao, Nan-Chi Chou, Chung-Kuan Cheng, T. C. Hu. iccad 1992: 264-267 [doi]

1991

Ancestor tree for arbitrary multi-terminal cut functionsChung-Kuan Cheng, T. C. Hu. anor, 33(3):199-213, 1991. [doi]

The Orientation of Modules Based on Graph DecompositionChung-Kuan Cheng, S. Z. Yao, T. C. Hu. TC, 40(6):774-780, 1991.

1990

Ancestor Tree for Arbitrary Multi-Terminal Cut FunctionsChung-Kuan Cheng, T. C. Hu. ipco 1990: 115-127

Every Tree is Graceful (But Some are More Graceful than Others)T. C. Hu, Andrew B. Kahng. dimacs 1991: 355-358

1987

Binary Search on a TapeT. C. Hu, Michelle L. Wachs. SICOMP, 16(3):573-590, 1987.

Graph folding and programmable logic arrayT. C. Hu, Yue-Sun Kuo. networks, 17(1):19-37, 1987. [doi]

Some Optimum Algorithms for Scheduling Problems with Changeover CostsT. C. Hu, Yue-Sun Kuo, Frank Ruskey. ior, 35(1):94-99, 1987. [doi]

An effective algorithm for optimal PLA column foldingYue-Sun Kuo, T. C. Hu. integration, 5(3-4):217-230, 1987. [doi]

1986

A decomposition algorithm for multi-terminal networks flowsM. T. Shing, T. C. Hu. DAM, 13(2-3):165-181, 1986. [doi]

1985

Triangulations (tilings) and certain block triangular matricesGeorge B. Dantzig, Alan J. Hoffman, T. C. Hu. mp, 31(1):1-14, 1985. [doi]

A heuristic algorithm for PLA block foldingY. S. Kuo, C. Chen, T. C. Hu. dac 1985: 744-747 [doi]

1984

Computation of Matrix Chain Products. Part IIT. C. Hu, M. T. Shing. SICOMP, 13(2):228-251, 1984.

1983

Multiterminal Flows in Outerplanar NetworksT. C. Hu, M. T. Shing. jal, 4(3):241-261, 1983.

Optimum reduction of programmable logic arrayT. C. Hu, Yue-Sun Kuo. dac 1983: 553-558 [doi]

1982

Computation of Matrix Chain Products. Part IT. C. Hu, M. T. Shing. SICOMP, 11(2):362-373, 1982.

1981

An O(n) Algorithm to Find a Near-Optimum Partition of a Convex PolygonT. C. Hu, M. T. Shing. jal, 2(2):122-138, 1981.

1980

Some Theorems about Matrix Multiplication (Extended Abstract)T. C. Hu, M. T. Shing. focs 1980: 28-35

Circular Cuts in a NetworkT. C. Hu, Frank Ruskey. mor, 5(3):422-434, 1980. [doi]

1979

Assignment of Task in a Distributed Processor System with Limited MemoryGururaj S. Rao, Harold S. Stone, T. C. Hu. TC, 28(4):291-299, 1979.

1977

Tree decomposition algorithm for large networksW. J. Blewett, T. C. Hu. networks, 7(4):289-296, 1977. [doi]

Generating Binary Trees LexicographicallyFrank Ruskey, T. C. Hu. SICOMP, 6(4):745-758, 1977.

Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing ProblemB. N. Tien, T. C. Hu. ior, 25(3):404-418, 1977. [doi]

1976

Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack ProblemsT. C. Hu, Melanie L. Lenard. ior, 24(1):193-196, 1976. [doi]

1975

Shortest string containing all permutationsP. J. Koutas, T. C. Hu. DM, 11(2):125-132, 1975. [doi]

1974

Optimum Communication Spanning TreesT. C. Hu. SICOMP, 3(3):188-195, 1974.

1973

Two-commodity cut-packing problemT. C. Hu. mp, 4(1):108-109, 1973. [doi]

1972

Least Upper Bound on the Cost of Optimum Binary Search TreesT. C. Hu, K. C. Tan. ACTA, 1:307-310, 1972.

A Comment on the Double-Chained TreeT. C. Hu. CACM, 15(4):276, 1972.

1971

Some problems in discrete optimizationT. C. Hu. mp, 1(1):102-112, 1971. [doi]

1968

A Decomposition Algorithm for Shortest Paths in a NetworkT. C. Hu. ior, 16(1):91-102, 1968. [doi]

1967

Laplace's Equation and Network FlowsT. C. Hu. ior, 15(2):348-356, 1967. [doi]

Sign in or sign up to see more results.

runs on WebDSL