Dr. Gonzalez received the B.Sc. degree in Computer Science from the Instituto Tecnologico de Monterrey (1972) and the Ph.D. degree in Computer Science from the University of Minnesota, Minneapolis, (1975). Professor Gonzalez research activity has concentrated on the development of efficient exact and approximation algorithms as well as computational complexity issues for problems in several disciplines. Main research contributions.

Professor Gonzalez is currently working on Multi-Message Multicasting algorithms for networks. The is a fundamental problem that arises when executing program in parallel computer systems. Some applications include iterative methods for solving systems of linear and non-linear equations, and most dynamic programming procedures, etc. His research contributions include work in message routing and parallel and distributed computing. He has also developed efficient approximation algorithms for message dissemination problems in hypercubes and communication networks when communication links or nodes fail.

He has also developed efficient approximation algorithms for deterministic scheduling problems. These problems have applications in manufacturing systems as well as in task assignment in real-time multiprocessor systems. He has developed efficient algorithms for preemptive and nonpreemptive scheduling problems in open, flow and job shops, as well as in identical, uniform and unrelated processor systems and grid systems.

Dr. Gonzalez has also investigated the complexity of generating exact and approximate solutions to a set of computational geometry problems. Specifically, he has developed some very interesting algorithms for partitioning, grouping and covering problems. These are robust algorithms that generalize to any number of dimensions. These problems have applications in computer-aided design, cluster analysis, etc. Recently he has developed algorithms for corridor and bridge problems.

In the area of computer-aided design of integrated circuits and systems, he developed efficient algorithms for component placement and wire routing for VLSI and MPCB systems. Specifically, he has developed efficient algorithms for channel, rectangle, and switchbox routing problems, via assignment, via placement, pin redistribution, and layer assignment for VLSI and MPCB systems.

Dr. Gonzalez has also developed exact and approximation algorithms for graph problems, code minimization, clustering, two-dimensional map compression, generalized dictionaries, statistical tests, page fault minimization, etc.

His work has been published in the Journal of ACM, Transactions on Algorithms, SIAM Journal on Computing, Algorithmica, Theoretical Computer Science, Parallel Processing Letters, IEEE Transactions Transactions on Parallel and Distributed Systems, Journal of Parallel Computing, Journal of Supercomputing , Journal of Computational Geometry: Theory and Applications,International Journal on Computational Geomety and Applications, Computational Geometry: Theory and Applications, , Integration: The VLSI Journal, IEEE Transactions on Computer--Aided Design of Integrated Circuits and Systems, other journals, as well as in journals and transactions published by ACM, IEEE, INFORMS, SIAM, and other societies, Research Books, and Algorithms, Parallel, Disctibuted, VLSI and CAD conferences. In addition, his work has been presented in other Conferences. He edited the Handbook on Approximation Algorithms and Metaheuristics, and is currently editing a Handbook on NP-Completeness: Theory and Applications. He has published chapters in the following Chapman & Hall/CRC Press Handbooks. Professor Gonzalez was an Editor of IEEE Transactions on Computers from 1992 - 1996, and he is currently in the Editorial Board of International Journal of Computers and Applications. He has been Guest Editor for several journals and has edited publications. From 2001 to 2004 he was the International Program Committee Chair for the IASTED Parallel and Distributed Computing and Systems Conference. Concluding Reports: PDCS 2004 MIT Cambridge, MA; PDCS 2003 Marina Del Rey, CA; PDCS 2002 MIT Cambridge, MA; and PDCS 2001 Anaheim, CA. He has received the Outstanding Computer Science Professor of the Year Award in 1987, 1994, and 2001.

Dr. Gonzalez current research interests are the design of efficient algorithms for multimessage multicasting in networks, scheduling algorithms, message dissemination, parallel and distributed computing, and algorithms for partitioning, grouping and covering problems.

September 12, 2008 (last time updated). E-mail comments and questions to teo@cs.ucsb.edu. UCSB CS Technical Report Link.

Number of hits since 4/24/2000: Don Knuth, John Hopcroft, Robert Tarjan