APPLICATIONS

Sanjeev Khanna, professor of computer and information science at the University of Pennsylvania, has been honored with a 2007 Guggenheim Fellowship for his work in theoretical computer science. Khanna works in a branch of computer science that deals with the resources necessary to perform certain computational tasks, including the interface of algorithms and computational complexity. The fellowship will fund his continued research to identify the polynomial-time approximability of fundamental problems in combinatorial optimization. "It is extremely gratifying to see Dr. Khanna's work recognized alongside the work of other distinguished scholars," said Eduardo Glandt, dean of the School of Engineering and Applied Science. "This is an extremely prestigious award and is well deserved by this inspiring Penn professor, whose fundamental research is advancing our understanding of important problems in theoretical computer science.'' Each year the John Simon Guggenheim Memorial Foundation recognizes distinguished scholarly achievement and exceptional promise for future accomplishment by granting aid to scholars, artists and writers pursuing research in one of 78 fields, from the natural sciences to the creative arts. Almost 2,800 applicants competed for fellowships totaling $7.6 million. Awards are based on recommendations from hundreds of expert advisors and are approved by the Foundation's Board of Trustees.