Sanjeev Khanna

Last updated

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.

Contents

Sanjeev Khanna
Born
New Delhi, India
Citizenship United States
Alma mater Birla Institute of Technology and Science, Pilani

University of Illinois at Urbana-Champaign

Stanford University
SpouseDelphine Khanna
Scientific career
Fields Theoretical computer science
Thesis A Structural View of Approximation  (1996)
Doctoral advisor Rajeev Motwani
Doctoral students Wang-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]

Related Research Articles

<span class="mw-page-title-main">Richard M. Karp</span> American mathematician

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

Johan Torkel Håstad is a Swedish theoretical computer scientist most known for his work on computational complexity theory. He was the recipient of the Gödel Prize in 1994 and 2011 and the ACM Doctoral Dissertation Award in 1986, among other prizes. He has been a professor in theoretical computer science at KTH Royal Institute of Technology in Stockholm, Sweden since 1988, becoming a full professor in 1992. He is a member of the Royal Swedish Academy of Sciences since 2001.

<span class="mw-page-title-main">Vijay Vazirani</span> Indian American professor of computer science

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.

<span class="mw-page-title-main">Christos Papadimitriou</span> Greek computer scientist (b. 1949)

Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.

<span class="mw-page-title-main">Mihalis Yannakakis</span> Greek-American computer scientist

Mihalis Yannakakis is professor of computer science at Columbia University. He is noted for his work in computational complexity, databases, and other related fields. He won the Donald E. Knuth Prize in 2005.

<span class="mw-page-title-main">Kurt Mehlhorn</span> German computer scientist (born 1949)

Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.

<span class="mw-page-title-main">Susanne Albers</span> German theoretical computer scientist

Susanne Albers is a German theoretical computer scientist and professor of computer science at the Department of Informatics of the Technical University of Munich. She is a recipient of the Otto Hahn Medal and the Leibniz Prize.

Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.

<span class="mw-page-title-main">Joseph S. B. Mitchell</span> American computer scientist and mathematician

Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.

Eugene Leighton (Gene) Lawler was an American computer scientist and a professor of computer science at the University of California, Berkeley.

Andrew Vladislav Goldberg is an American computer scientist working primarily on design, analysis, and experimental evaluation of algorithms. He also worked on mechanism design, computer systems, and complexity theory. Currently he is a Senior Principal Scientist at Amazon.com.

Samir Khuller is a professor of Computer Science and the Peter and Adrienne Barris Chair of Computer Science at Northwestern University. He was previously Professor and Elizabeth Stevinson Iribe Chair of Computer Science in the University of Maryland's Department of Computer Science. His research is in the area of algorithm design, specifically on combinatorial optimization, graphs and networks and scheduling.

<span class="mw-page-title-main">Naveen Garg</span>

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.

Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.

Cynthia A. Phillips is a researcher at the Center for Computing Research of Sandia National Laboratories, known for her work in combinatorial optimization.

Edith Cohen is an Israeli and American computer scientist specializing in data mining and algorithms for big data. She is also known for her research on peer-to-peer networks. She works for Google in Mountain View, California, and as a visiting professor at Tel Aviv University in Israel.

Grigory Yaroslavtsev is a Russian-American computer scientist. He is an assistant professor of computer science at George Mason University. Previously he was an assistant professor of computer science at Indiana University and the founding director of the Center for Algorithms and Machine Learning (CAML) at Indiana University.

<span class="mw-page-title-main">Baruch Schieber</span> Professor of computer science

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.

Harold N. (Hal) Gabow is an American computer scientist known for his research on graph algorithms and data structures. He is a professor emeritus at the University of Colorado Boulder, and the former founding editor-in-chief of ACM Transactions on Algorithms.

Elad Hazan is an Israeli-American computer scientist, academic, author and researcher. He is a Professor of Computer Science at Princeton University, and the co-founder and director of Google AI Princeton.

References

  1. ↑ "A Structural View of Approximation" (PDF).
  2. ↑ "Sanjeev Khanna". www.cis.upenn.edu.
  3. ↑ "2018 ACM Fellows Honored for Pivotal Achievements that Underpin the Digital Age". Association for Computing Machinery. Retrieved 5 December 2018.


This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.