Sartaj Sahni
Sartaj Kumar Sahni (born July 22, 1949 in Poona ) is an Indian - American computer scientist who deals with algorithms and data structures .
Sahni studied electrical engineering at the Indian Institute of Technology Kanpur ( Bachelor 1970) and at Cornell University , where he received his master’s degree in computer science in 1972 and his doctorate under Ellis Horowitz in 1973 ( On the knapsack and other computational related problems ). In 1973 he became an Assistant Professor , 1977 Associate Professor and 1980 Professor at the University of Minnesota . Since 1990 he has been a professor at the University of Florida , where he headed the computer science faculty from 2001 to 2011.
Sahni dealt, among other things, with parallel algorithms for example for matrix multiplication , scheduling , connection networks of computers and network algorithms, image processing, automated design of electronic circuits, computer-aided geometry (computational geometry), medical algorithms especially in radiation therapy. He was a pioneer in the study NP-difficult ( NP-hard ) problems and examined such problems in optimization tasks, for example, network flows, game theory and CAD and certain approximation problems. He found general methods of finding polynomial-time approximation algorithms for a large class of NP-difficult problems. He was the first to find a sub-exponential algorithm for an NP-difficult problem.
He is co-editor of the Journal of Parallel and Distributed Computing and editor of the International Journal of Foundations of Computer Science. Together with his teacher Ellis Horowitz, he is the author of two popular textbooks on algorithms and data structures and received the IEEE Taylor L. Booth Education Award for his teaching.
In 2003 he received the W. Wallace McDowell Award for contributions to the theory of NP-hard and NP-complete problems . In 1988 he became a Fellow of the IEEE , the Association for Computing Machinery, and the American Association for the Advancement of Science . He is a member of the European Academy of Sciences. In 2001 he received the Distinguished Alumnus Award from the Indian Institute of Technology.
Fonts
- with Ellis Horowitz Fundamentals of Computer Algorithms , Computer Science Press, Maryland 1978, new edition with Sanguthevar Rajasekaran, Freeman, 1998, 2nd edition Silicon Press 2008 (there is also a C ++ edition), German edition Algorithmen. Design and analysis , Springer 1981
- with Horowitz Fundamentals of Data Structures , Computer Science Press 1976, extended edition with Susan Anderson-Freed, Freeman 1983, 2nd edition Silicon Press (there are also editions for C ++, Pascal and Turbo-Pascal)
- German edition: Basics of data structures in C , Redline 1998
- with Sanjay Ranka Hypercube algorithms with applications to image processing and pattern recognition , Springer Verlag, New York, 1990
- with Robert Cmelik Software Development in C , Silicon Press, New Jersey, 1995
- with Raj Kumar Software Development in Java , Silicon Press, New Jersey, 2003
Web links
Individual evidence
- ↑ Life data from American Men and Women of Science , Thomson Gale 2005
- ^ Mathematics Genealogy Project
- ↑ Introduced (as P-difficult) in Sahni Computationally related problems , SIAM J. Comput., Volume 3, 1974, pp. 262-279
- ^ Sahni General techniques for combinatorial approximation , Operations Research, Volume 25, 1977, pp. 920-936, abstract
| personal data | |
|---|---|
| SURNAME | Sahni, Sartaj |
| ALTERNATIVE NAMES | Sahni, Sartaj Kumar |
| BRIEF DESCRIPTION | Indian-American computer scientist |
| DATE OF BIRTH | July 22, 1949 |
| PLACE OF BIRTH | Poona |