About the Authors
Sayan Bhattacharya
Graduate Student
Department of Computer Science
Duke University, Durham, NC 27708
bsayan[ta]cs[td]duke[td]edu
http://www.cs.duke.edu/~bsayan
Graduate Student
Department of Computer Science
Duke University, Durham, NC 27708
bsayan[ta]cs[td]duke[td]edu
http://www.cs.duke.edu/~bsayan
Sayan Bhattacharya is a Ph.D. student in the Department of
Computer Science at Duke University.
His adviser is
Kamesh Munagala.
He obtained his B.E. in Computer Science and Engineering from
Jadavpur
University, Kolkata
in July 2008. He is interested in Approximation Algorithms and
Computational Microeconomics.
Gagan Goel
Research Scientist
Google Inc.
New York, NY
gagangoel[ta]google[td]com
http://research.google.com/pubs/GaganGoel.html
Research Scientist
Google Inc.
New York, NY
gagangoel[ta]google[td]com
http://research.google.com/pubs/GaganGoel.html
Gagan Goel is a research scientist at
Google. His research
interests lie in the design and analysis of algorithms and its
applications to optimization, market design, and game theory. He
received his Ph.D. in Algorithms, Combinatorics, and Optimization
from Georgia Tech in August 2009
under the supervision of
Vijay Vazirani.
Before that he received his B.Tech. in Computer Science and
Engineering from the
Indian Institute of Technology, Delhi
in August 2004.
Sreenivas Gollapudi
Senior Researcher
Microsoft Search Labs
Mountain View, CA 94043
sreenig[ta]microsoft[td]com
http://research.microsoft.com/en-us/people/sreenig/
Senior Researcher
Microsoft Search Labs
Mountain View, CA 94043
sreenig[ta]microsoft[td]com
http://research.microsoft.com/en-us/people/sreenig/
Sreenivas Gollapudi is a Senior Researcher at
Microsoft Search Labs
which he joined in July 2006. Prior to moving to Search Labs,
he held senior engineering roles at Ebrary
in their Advanced Technologies Group and in the distributed database
group at Oracle. He obtained his B.Tech. from
IIT Bombay,
and his Ph.D., in 2004, from the
State University of New
York at Buffalo where his advisor was
Aidong
Zhang.
He is a holder of twenty-nine US patents. His
current research interests include web algorithms,
algorithms for large data sets, and game theoretic
approaches to social network analysis.
Kamesh Munagala
Associate Professor
Department of Computer Science
Duke University, Durham, NC 27708
kamesh[ta]cs[td]duke[td]edu
http://www.cs.duke.edu/~kamesh
Associate Professor
Department of Computer Science
Duke University, Durham, NC 27708
kamesh[ta]cs[td]duke[td]edu
http://www.cs.duke.edu/~kamesh
Kamesh Munagala is Associate Professor of Computer Science
Science at Duke University, where
he has been employed since 2004. He
received his M.S. degree in 2002 and his Ph.D. in 2003, both from
Stanford University. His
advisor was Serge Plotkin.
He received his B.Tech. degree in 1998 from the
Indian Institute of Technology, Bombay
where his advisor was
Abhiram Ranade.
He spent a year as a post-doctoral scholar in
Pat Brown's Lab doing
computational biology at the
Department of Biochemistry,
Stanford University School of Medicine. His research interests
are in approximation algorithms, combinatorial
optimization, computational economics, scheduling theory, social
networks, and data mining.
He received an NSF CAREER award in 2008 and an Alfred P. Sloan research
fellowship in 2009.