Sartaj Sahni

Sartaj Sahni

Prof. Sartaj Sahni in 2015.
Born (1949-07-22) July 22, 1949
Poona, India
Nationality United States
Fields Computer science
Institutions University of Florida
Alma mater Indian Institute of Technology, Cornell University
Doctoral advisor Ellis Horowitz
Doctoral students Teofilo F. Gonzalez, Yookun Cho, David Nassimi, Eliezer Dekel, Raghunath Raghavan, Jim Cohoon, Ten-Hwang Lai, Rajiv Kane, Sangyong Han, Kam-Hoi Cheng, Jayaram Bhasker, Lishin Lin, Surendra Nahar, Jong Lee, Youngju Won, Sanjay Ranka, Jin Woon Woo, Wing Ning Li, San Yuan Wu, Patrick Jarvis, Jing-Fu Jenq, Kyunrak Chong, Doowon Paik, Mario Lopez, Andrew Lim, Keumog Ahn, Dinesh Mehta, Madhusudan Nigam, Venkat Thanvantri, Seonghun Cho, Chih-Fang Wang, Edward Cheng, Haejae Jung, Haibin Lu, Kun Suk Kim, Meongchul Song, Srijit Kamath, Joonseok Park, Kevin McCullen, Wencheng Lu, Xiaochun Xu, Xinyan Zha, Yan Li, Tania Banerjee-Mishra, Shibdas Bandyopadhyay, Junjie Li
Known for Data structures, Algorithms
Notable awards IEEE Computer Society Taylor L. Booth Education Award, 1997
IEEE Computer Society W. Wallace McDowell Award, 2003
ACM Karl Karlstrom Outstanding Educator Award, 2003

Professor Sartaj Kumar Sahni (born July 22, 1949, in Poona, India) 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.[1]

Education

Sahni received his BTech degree in electrical engineering from the Indian Institute of Technology Kanpur.[2] Following this, he undertook his graduate studies at Cornell University in the USA, earning a PhD degree in 1973, under the supervision of Ellis Horowitz.[3]

Research and publications

Sahni has published over 280 research papers and written 15 textbooks.[4] His research publications are on the design and analysis of efficient algorithms, data structures, parallel computing, interconnection networks, design automation, and medical algorithms.

With his advisor Ellis Horowitz, Sahni wrote two widely used textbooks, Fundamentals of Computer Algorithms and Fundamentals of Data Structures. He has also written highly cited research papers on the NP-completeness of approximately solving certain optimization problems,[5] on open shop scheduling,[6] on parallel algorithms for matrix multiplication and their application in graph theory,[7] and on improved exponential time exact algorithms for the subset sum problem,[8] among his many other research results.

Awards and honors

In 1997, Sahni was awarded the IEEE Computer Society's Taylor L. Booth Education Award[9] and in 2003 he was awarded the IEEE Computer Society McDowell Award.[10] Sahni was also awarded the 2003 Karl V. Karlstrom Outstanding Educator Award of the Association for Computing Machinery.[11]

Prof. Sahni is a member of the European Academy of Sciences.[12] He was elected as a Fellow of the Institute of Electrical and Electronics Engineers in 1988,[13] and of the Association for Computing Machinery in 1996;[14] he is also a fellow of the American Association for the Advancement of Science.[15] He is a Distinguished Alumnus of the Indian Institute of Technology, Kanpur.[2]

Sahni was given the Honorary Professor Award of Asia University (Taiwan) in 2009.[16]

References

  1. ↑ Faculty profile, CISE, U. of Florida, accessed 2011-10-10.
  2. 1 2 Distinguished Alumnus Awards-2000, IIT Kanpur, accessed 2011-10-10.
  3. ↑ Sartaj Kumar Sahni at the Mathematics Genealogy Project.
  4. ↑ Sartaj Sahni at DBLP Bibliography Server
  5. ↑ Sahni, Sartaj; Gonzalez, Teofilo (1976), "P-complete approximation problems", Journal of the Association for Computing Machinery, 23 (3): 555–565, doi:10.1145/321958.321975, MR 0408313.
  6. ↑ Gonzalez, Teofilo; Sahni, Sartaj (1976), "Open shop scheduling to minimize finish time", Journal of the Association for Computing Machinery, 23 (4): 665–679, doi:10.1145/321978.321985, MR 0429089.
  7. ↑ Dekel, Eliezer; Nassimi, David; Sahni, Sartaj (1981), "Parallel matrix and graph algorithms", SIAM Journal on Computing, 10 (4): 657–675, doi:10.1137/0210049, MR 635424.
  8. ↑ Horowitz, Ellis; Sahni, Sartaj (1969), "Computing partitions with applications to the knapsack problem", Journal of the Association for Computing Machinery, 21: 277–292, doi:10.1145/321812.321823, MR 0354006.
  9. ↑ Past recipients for Taylor L. Booth Education Award, IEEE Computer Society, accessed 2011-10-10.
  10. ↑ Past recipients for W. Wallace McDowell Award, IEEE Computer Society, accessed 2011-10-10.
  11. ↑ Karl V. Karlstrom Outstanding Educator Award, ACM, accessed 2011-10-10.
  12. ↑ List of the members of the European Academy of Sciences, accessed 2011-10-10.
  13. ↑ Alphabetical Listing of Fellows, IEEE, accessed 2011-10-10.
  14. ↑ ACM Fellows listing, accessed 2011-10-10.
  15. ↑ AAAS Fellows, accessed 2011-10-10.
  16. ↑ Distinguished Professor and Chair Sartaj Sahni receives the Honorary Professor Award from Asia University, Taiwan, University of Florida, CISE, June 9, 2009. Sahni Accessed 2011-10-10.
This article is issued from Wikipedia - version of the 10/17/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.