default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDT. C. Hu
Person information
- affiliation: University of California, San Diego, Department of Computer Science and Engineering
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c13]Chung-Kuan Cheng, T. C. Hu, Andrew B. Kahng:
Theory and Algorithms of Physical Design. ISPD 2018: 130-131- 2014
- [i1]J. David Morgenthaler
, T. C. Hu:
Optimal Alphabetic Ternary Trees. CoRR abs/1402.3036 (2014)
2000 – 2009
- 2008
- [c12]T. C. Hu, Leo Landa, Man-tak Shing:
The Unbounded Knapsack Problem. Bonn Workshop of Combinatorial Optimization 2008: 201-217 - 2005
- [c11]T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler:
Optimal Integer Alphabetic Trees in Linear Time. ESA 2005: 226-237
1990 – 1999
- 1997
- [c10]T. C. Hu:
Physical design: mathematical models and methods. ISPD 1997: 207-210 - 1995
- [j33]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): 417-425 (1995) - [j32]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): 623-630 (1995) - [j31]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): 890-896 (1995) - [c9]T. C. Hu, J. David Morgenthaler:
Optimum Alphabetic Binary Trees. Combinatorics and Computer Science 1995: 234-243 - [c8]Lung-Tien Liu, Ming-Ter Kuo, Chung-Kuan Cheng, T. C. Hu:
Performance-Driven Partitioning Using a Replication Graph Approach. DAC 1995: 206-210 - 1994
- [j30]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): 110-121 (1994) - [j29]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): 45-53 (1994) - 1993
- [j28]T. C. Hu, Andrew B. Kahng, Gabriel Robins:
Optimal robust path planning in general environments. IEEE Trans. Robotics Autom. 9(6): 775-784 (1993) - [c7]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
- [j27]Chung-Kuan Cheng, T. C. Hu:
Maximum Concurrent Flows and Minimum Cuts. Algorithmica 8(3): 233-249 (1992) - [c6]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: 264-267 - 1991
- [j26]Chung-Kuan Cheng, T. C. Hu:
Ancestor tree for arbitrary multi-terminal cut functions. Ann. Oper. Res. 33(3): 199-213 (1991) - [j25]Chung-Kuan Cheng, So-Zen Yao, T. C. Hu:
The Orientation of Modules Based on Graph Decomposition. IEEE Trans. Computers 40(6): 774-780 (1991) - 1990
- [c5]T. C. Hu, Andrew B. Kahng:
Every Tree is Graceful (But Some are More Graceful than Others). Applied Geometry And Discrete Mathematics 1990: 355-358 - [c4]Chung-Kuan Cheng, T. C. Hu:
Ancestor Tree for Arbitrary Multi-Terminal Cut Functions. IPCO 1990: 115-127
1980 – 1989
- 1987
- [j24]Yue-Sun Kuo, T. C. Hu:
An effective algorithm for optimal PLA column folding. Integr. 5(3-4): 217-230 (1987) - [j23]T. C. Hu, Yue-Sun Kuo, Frank Ruskey:
Some Optimum Algorithms for Scheduling Problems with Changeover Costs. Oper. Res. 35(1): 94-99 (1987) - [j22]T. C. Hu, Yue-Sun Kuo:
Graph folding and programmable logic array. Networks 17(1): 19-37 (1987) - [j21]T. C. Hu, Michelle L. Wachs:
Binary Search on a Tape. SIAM J. Comput. 16(3): 573-590 (1987) - 1986
- [j20]M. T. Shing, T. C. Hu:
A decomposition algorithm for multi-terminal networks flows. Discret. Appl. Math. 13(2-3): 165-181 (1986) - 1985
- [j19]George B. Dantzig, Alan J. Hoffman, T. C. Hu:
Triangulations (tilings) and certain block triangular matrices. Math. Program. 31(1): 1-14 (1985) - [c3]Yue-Sun Kuo, C. Chen, T. C. Hu:
A heuristic algorithm for PLA block folding. DAC 1985: 744-747 - 1984
- [j18]T. C. Hu, M. T. Shing:
Computation of Matrix Chain Products. Part II. SIAM J. Comput. 13(2): 228-251 (1984) - 1983
- [j17]T. C. Hu, M. T. Shing:
Multiterminal Flows in Outerplanar Networks. J. Algorithms 4(3): 241-261 (1983) - [c2]T. C. Hu, Yue-Sun Kuo:
Optimum reduction of programmable logic array. DAC 1983: 553-558 - 1982
- [j16]T. C. Hu, M. T. Shing:
Computation of Matrix Chain Products. Part I. SIAM J. Comput. 11(2): 362-373 (1982) - 1981
- [j15]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
- [j14]T. C. Hu, Frank Ruskey:
Circular Cuts in a Network. Math. Oper. Res. 5(3): 422-434 (1980) - [c1]T. C. Hu, M. T. Shing:
Some Theorems about Matrix Multiplication (Extended Abstract). FOCS 1980: 28-35
1970 – 1979
- 1979
- [j13]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
- [j12]B. N. Tien, T. C. Hu:
Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem. Oper. Res. 25(3): 404-418 (1977) - [j11]W. J. Blewett, T. C. Hu:
Tree decomposition algorithm for large networks. Networks 7(4): 289-296 (1977) - [j10]Frank Ruskey, T. C. Hu:
Generating Binary Trees Lexicographically. SIAM J. Comput. 6(4): 745-758 (1977) - 1976
- [j9]T. C. Hu, Melanie L. Lenard:
Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems. Oper. Res. 24(1): 193-196 (1976) - 1975
- [j8]P. J. Koutas, T. C. Hu:
Shortest string containing all permutations. Discret. Math. 11(2): 125-132 (1975) - 1974
- [j7]T. C. Hu:
Optimum Communication Spanning Trees. SIAM J. Comput. 3(3): 188-195 (1974) - 1973
- [j6]T. C. Hu:
Two-commodity cut-packing problem. Math. Program. 4(1): 108-109 (1973) - 1972
- [j5]T. C. Hu, Kay Chen Tan:
Least Upper Bound on the Cost of Optimum Binary Search Trees. Acta Informatica 1: 307-310 (1972) - [j4]T. C. Hu:
A Comment on the Double-Chained Tree. Commun. ACM 15(4): 276 (1972) - 1971
- [j3]T. C. Hu:
Some problems in discrete optimization. Math. Program. 1(1): 102-112 (1971)
1960 – 1969
- 1968
- [j2]T. C. Hu:
A Decomposition Algorithm for Shortest Paths in a Network. Oper. Res. 16(1): 91-102 (1968) - 1967
- [j1]T. C. Hu:
Laplace's Equation and Network Flows. Oper. Res. 15(2): 348-356 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
