Teofilo (Teo) Gonzalez | |
---|---|
Born | |
Nationality | American |
Alma mater | ITESM (B.S., 1972) University of Minnesota (Ph.D., 1975) |
Occupation | Professor of Computer Science UCSB |
Known for | Hardness of approximation, algorithms |
Scientific career | |
Fields | Computer science |
Institutions | University of Oklahoma; Pennsylvania State University; Monterrey Institute of Technology and Higher Education; University of Texas at Dallas; UC Santa Barbara |
Doctoral advisor | Sartaj Sahni |
Website | www.cs.ucsb.edu/~teo |
Teofilo Francisco Gonzalez Arce (born January 26, 1948 in Monterrey, Mexico) is a Mexican-American computer scientist who is professor emeritus of computer science at the University of California, Santa Barbara.
In 1972, Gonzalez was one of the first students who earned a bachelor's degree in computer science (Ingeniero en Sistemas Computacionales) in Mexico,[ citation needed ] at the Monterrey Institute of Technology and Higher Education. [1] He completed his Ph.D. in 1975 from the University of Minnesota under the supervision of Sartaj Sahni. [1] [2] He taught at the University of Oklahoma from 1975 to 1976, at the Pennsylvania State University from 1976 to 1979, at the Monterrey Institute of Technology and Higher Education from 1979 to 1980, and at the University of Texas at Dallas from 1980 to 1984, before joining the UCSB computer science faculty in 1984. [1] He spent Sabbatical Leaves at Utrecht University (1990) in the Netherlands and the Monterrey Institute of Technology and Higher Education. Professor Gonzalez became a Fellow of IASTED in 2009.
Gonzalez is known for his highly cited pioneering research in the hardness of approximation; [SG76] [3] for his sub-linear and best possible approximation algorithm (unless P = NP) based on the farthest-first traversal for the metric k-center problem [G85] [3] (k-tMM clustering); and for introducing the open-shop scheduling problem as well as algorithms for its solution that have found numerous applications in several research areas as well as for his research on flow shop scheduling, and job shop scheduling algorithms. [GS76] [GS78] [4] He is the editor of the Handbook on Approximation Algorithms and Metaheuristics first edition [G07] , second edition [G18] and he is co-editor of Volume 1 (Computer Science and Software Engineering) of the Computing Handbook Set. [CH]
GS76. | Gonzalez, Teofilo; Sahni, Sartaj (1976), "Open shop scheduling to minimize finish time", Journal of the ACM , 23 (4): 665–679, doi: 10.1145/321978.321985 , MR 0429089, S2CID 1642775 |
SG76. | Sahni, Sartaj; Gonzalez, Teofilo (1976), "P-complete approximation problems", Journal of the ACM , 23 (3): 555–565, doi:10.1145/321958.321975, hdl: 10338.dmlcz/103883 , MR 0408313, S2CID 207548581 . |
GS78. | Gonzalez, Teofilo; Sahni, Sartaj (1978), "Flowshop and jobshop schedules: complexity and approximation", Operations Research , 26 (1): 36–52, doi:10.1287/opre.26.1.36, MR 0465149 . |
G85. | Gonzalez, T. F. (1985), "Clustering to minimize the maximum intercluster distance", Theoretical Computer Science , 38 (2–3): 293–306, doi: 10.1016/0304-3975(85)90224-5 , MR 0807927 . |
G07. | Handbook of Approximation Algorithms and Metaheuristics (1 ed.), Cambridge, Mass.: Chapman and Hall/CRC, 2007-05-15, ISBN 9780262633246 |
G18. | Handbook of Approximation Algorithms and Metaheuristics (2 ed.), Cambridge, Mass.: Chapman and Hall/CRC, 2018, ISBN 9780367570286 |
CH. | T.F. Gonzalez, J. Diaz-Herrera, A. Tucker}, Editors, Computing Handbook: Computer Science and Software Engineering, Third Edition: Two-Volume Set, CRC Press, ISBN 978-1439898529 |
Professor Sartaj Kumar Sahni is a computer scientist based in the United States, and is one of the pioneers in the field of data structures. He is a distinguished professor in the Department of Computer and Information Science and Engineering at the University of Florida.
Vijay Virkumar Vazirani is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.
Clifford Seth Stein, a computer scientist, is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science. Stein is chair of the Industrial Engineering and Operations Research Department at Columbia University. Prior to joining Columbia, Stein was a professor at Dartmouth College in New Hampshire.
Héctor García-Molina was a Mexican-American computer scientist and Professor in the Departments of Computer Science and Electrical Engineering at Stanford University. He was the advisor to Google co-founder Sergey Brin from 1993 to 1997 when Brin was a computer science student at Stanford.
Jacek M. Zurada serves as a Professor of Electrical and Computer Engineering Department at the University of Louisville, Kentucky. His M.S. and Ph.D degrees are from Politechnika Gdaṅska ranked as #1 among Polish universities of technology. He has held visiting appointments at Swiss Federal Institute of Technology, Zurich, Princeton, Northeastern, Auburn, and at overseas universities in Australia, Chile, China, France, Germany, Hong Kong, Italy, Japan, Poland, Singapore, Spain, and South Africa. He is a Life Fellow of IEEE and a Fellow of International Neural Networks Society and Doctor Honoris Causa of Czestochowa Institute of Technology, Poland.
In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems.
Mikhail Jibrayil (Mike) Atallah is a Lebanese American computer scientist, a distinguished professor of computer science at Purdue University.
Jan Karel Lenstra is a Dutch mathematician and operations researcher, known for his work on scheduling algorithms, local search, and the travelling salesman problem.
George Lann Nemhauser is an American operations researcher, the A. Russell Chandler III Chair and Institute Professor of Industrial and Systems Engineering at the Georgia Institute of Technology and the former president of the Operations Research Society of America.
Nasir Ahmed is an Indian-American electrical engineer and computer scientist. He is Professor Emeritus of Electrical and Computer Engineering at University of New Mexico (UNM). He is best known for inventing the discrete cosine transform (DCT) in the early 1970s. The DCT is the most widely used data compression transformation, the basis for most digital media standards and commonly used in digital signal processing. He also described the discrete sine transform (DST), which is related to the DCT.
José Luis González Velarde is a professor and researcher with the Tec de Monterrey, Monterrey Campus.
Sanjeev Khanna is an Indian-American computer scientist. He is currently a Henry Salvatori professor of Computer and Information Science at the University of Pennsylvania. His research interests include approximation algorithms, hardness of approximation, combinatorial optimization, and sublinear algorithms.
Naveen Garg is a Professor of Computer Science in Indian Institute of Technology Delhi, specializing in algorithms and complexity in theoretical computer science. He was awarded the Shanti Swarup Bhatnagar Prize for Science and Technology, India's highest prize for excellence in science, mathematics and technology, in the mathematical sciences category in the year 2016. Naveen Garg's contributions are primarily in the design and analysis of approximation algorithms for NP-hard combinatorial optimization problems arising in network design, scheduling, routing, facility location etc.
Vivek Shripad Borkar is an Indian electrical engineer, mathematician and an Institute chair professor at the Indian Institute of Technology, Mumbai. He is known for introducing analytical paradigm in stochastic optimal control processes and is an elected fellow of all the three major Indian science academies viz. the Indian Academy of Sciences, Indian National Science Academy and the National Academy of Sciences, India. He also holds elected fellowships of The World Academy of Sciences, Institute of Electrical and Electronics Engineers, Indian National Academy of Engineering and the American Mathematical Society. The Council of Scientific and Industrial Research, the apex agency of the Government of India for scientific research, awarded him the Shanti Swarup Bhatnagar Prize for Science and Technology, one of the highest Indian science awards for his contributions to Engineering Sciences in 1992. He received the TWAS Prize of the World Academy of Sciences in 2009.
Ishfaq Ahmad is a computer scientist, IEEE Fellow and Professor of Computer Science and Engineering at the University of Texas at Arlington (UTA). He is the Director of the Center For Advanced Computing Systems (CACS) and has previously directed IRIS at UTA. He is widely recognized for his contributions to scheduling techniques in parallel and distributed computing systems, and video coding.
Jacek Antoni Błażewicz is a Polish computer scientist specializing in the theory of algorithms and bioinformatics. He has been working as Director of the Institute of Computer Sciences of the Poznań University of Technology. He is also Head of the Department of Bioinformatics at the Institute of Bioorganic Chemistry of the Polish Academy of Sciences.
Amit Kumar is Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Delhi. He received his B.Tech. degree from Indian Institute of Technology Kanpur in 1997, and Ph.D. from Cornell University in 2002. He worked as Member of Technical Staff at Bell Labs, Murray Hill, New Jersey, U.S. during 2002–2003. He joined IIT Delhi as faculty member in 2003. He works in the area of combinatorial optimization, approximation algorithms and online algorithms. He is working extensively on problems arising in scheduling theory, clustering, and graph theoretic algorithmic problems.
Baruch M. Schieber is a Professor of the Department of Computer Science at the New Jersey Institute of Technology (NJIT) and Director of the Institute for Future Technologies.
Yasmín Águeda Ríos-Solís is a Mexican computer scientist and operations researcher who studies problems of scheduling, timetabling, and synchronization of public transport. She is a professor and researcher in the School of Engineering and Sciences at the Monterrey Institute of Technology and Higher Education.
Tamar (Tami) Tamir is an Israeli computer scientist specializing in approximation algorithms and algorithmic mechanism design, especially for problems in resource allocation, scheduling, and packing problems. She is a professor in the Efi Arazi School of Computer Science of Reichman University.