Â鶹´«Ã½

Professor Hu is an expert on combinatorial algorithms, communications networks, computer-aided design, distributed computing, and operations research. Some of his well-known research contributions include the Gomory-Hu tree on Multi-terminal flows; the Hu-Tucker algorithm for constructing optimum alphabetic binary code; the Hu-Shing algorithm on the multiplication of matrices; as well as an algorithm on parallel processing.In 1997, he co-won the award for best paper at the IEEE Circuits and Systems Society; the paper--*The replication cut for partitioning"--was co-authored by L.T.Liu, M.T. Kuo and C.K. Cheng.

Capsule Bio:

T.C. Hu joined the UCSD faculty in 1974. Prior to that, he worked at the IBM. Research Center and the University of Wisconsin. He has served as an associated editor SIAM and ORSA an editor of IEEE Transaction on Computers. Hu is the author of the books "Integer Programming and Network Flows" (translated into German, Russian, and Japanese), and "Combinatorial Algorithms." He is co-editor of "Mathematical Programming" with S. M. Robinson, and "Theory and Concepts of Circuit Layout" with E. S. Kuh, and numerous technical papers. Hu received his Ph.D. in Applied Mathematics from Brown University in 1960.