Sanjeev Khanna

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.

Sanjeev Khanna
Born
New Delhi, India
CitizenshipUnited States
Alma materBirla Institute of Technology and Science, Pilani

University of Illinois at Urbana-Champaign

Stanford University
Spouse(s)Delphine Khanna
Scientific career
FieldsTheoretical computer science
ThesisA Structural View of Approximation (1996)
Doctoral advisorRajeev Motwani
Doctoral studentsWang-Chiew Tan

Career

Khanna received his undergraduate degrees in computer science and economics from Birla Institute of Technology and Science, Pilani, India in 1990, his M.S. degree in computer science from University of Illinois at Urbana-Champaign in 1992, and his doctoral degree in computer science from Stanford University, California, US in 1996. He joined University of Pennsylvania in 1999 after spending three years as a member of the Mathematical Sciences Research center at Bell Laboratories.

Research contribution and awards

Khanna's primary research contributions are to the fields of approximation algorithms, hardness of approximation, combinatorial optimization, and sublinear algorithms. His doctoral work at Stanford University, ``A Structural View of Approximation'',[1] received the 1996 Arthur Samuel prize for the best PhD dissertation in the Computer Science Department. He is a Guggenheim Fellow (2007) and a Sloan Fellow (2000).[2] He is also a recipient of S. Reid Warren, Jr. and Lindback awards for distinguished teaching at University of Pennsylvania.

He serves on the Editorial board of Foundations and Trends in Theoretical Computer Science, and has previously served on the editorial boards of SICOMP, ACM TALG, Algorithmica, JCSS, and as an area editor for Encyclopaedia of Algorithms.

In 2018, the Association for Computing Machinery named him an ACM Fellow for his contributions to approximation algorithms, hardness of approximation, and sublinear algorithms.[3]

gollark: Bluetooth for *light control*?
gollark: Why use discrete transistors when you could use several million on an IC?
gollark: But what if you want to be able to SSH into your ceiling lamps, ħmmmmm?
gollark: You could use an ESP32 thingy, yes.
gollark: I don't know. They might. Do not trust companies to keep running the backend without a subscription payment.

References
  1. "A Structural View of Approximation" (PDF).
  2. http://www.cis.upenn.edu/~sanjeev/
  3. "2018 ACM Fellows Honored for Pivotal Achievements that Underpin the Digital Age". Association for Computing Machinery. Association for Computing Machinery. Retrieved 5 December 2018.


    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.