About the Authors
Julia Chuzhoy
Toyota Technological Institute at Chicago
Chicago, IL 60637
cjulia[ta]ttic[td]edu
http://ttic.uchicago.edu/~cjulia
Toyota Technological Institute at Chicago
Chicago, IL 60637
cjulia[ta]ttic[td]edu
http://ttic.uchicago.edu/~cjulia
Julia Chuzhoy is an Assistant Professor at the
Toyota Technological Institute at Chicago.
She received her Ph.D. from
Technion-Israel Institute of Technology
in 2004, under the supervision of
Seffi Naor.
She spent three years as a
postdoc at MIT, the
University of Pennsylvania, and the
Institute for Advanced Study
before joining TTIC in 2007.
Her research area is approximation algorithms and hardness of approximation.
Sanjeev Khanna
Dept. of Computer and Information Science
University of Pennsylvania
Philadelphia, PA 19104
sanjeev[ta]cis[td]upenn[td]edu
http://www.cis.upenn.edu/~sanjeev
Dept. of Computer and Information Science
University of Pennsylvania
Philadelphia, PA 19104
sanjeev[ta]cis[td]upenn[td]edu
http://www.cis.upenn.edu/~sanjeev
Sanjeev Khanna is a Professor of Computer and Information Science
and a Rosenbluth Faculty Fellow at the
University of Pennsylvania.
He received a Ph.D. in Computer Science
from Stanford University (1996) under
the supervision of
Rajeev Motwani,
and undergraduate degrees in Computer Science and Economics from
Birla Institute
of Technology and Science, India (1990). From 1996 to 1999, he was
a member of the Mathematical Sciences Research center at Bell Labs.
He joined the University of Pennsylvania
in 1999.
Sanjeev's research interests are in algorithms and complexity with
a focus on approximation algorithms and hardness of approximation.