About the Authors
Aditya Bhaskara
Postdoctoral Researcher
EPFL
bhaskara[ta]cs[td]princeton[td]edu
www.cs.princeton.edu/~bhaskara/
Postdoctoral Researcher
EPFL
bhaskara[ta]cs[td]princeton[td]edu
www.cs.princeton.edu/~bhaskara/
Aditya Bhaskara graduated from
Princeton University in 2012; his
advisor was Moses
Charikar. His thesis was on finding dense structures in graphs and
matrices. His research interests are in approximation algorithms, and
in the use of tools from probability and convex geometry in
theoretical CS. He did his undergraduate studies at
IIT Bombay; he was advised by
Abhiram Ranade and
Ajit Diwan, who helped shape
his interests in algorithms and theoretical computer science.
Devendra Desai
Ph.D. student
Rutgers University
devdesai[ta]cs[td]rutgers[td]edu
www.cs.rutgers.edu/~devdesai/
Ph.D. student
Rutgers University
devdesai[ta]cs[td]rutgers[td]edu
www.cs.rutgers.edu/~devdesai/
Devendra (Dev) Desai
is a Ph.D. student at
Rutgers University, advised by
Mario Szegedy. His
research interests include approximation algorithms, randomized
algorithms, derandomization, hardness of approximation, and
combinatorics. During his undergraduate days in Pune, India, he was
mentored in algorithm analysis by
Udayan Kanade, who to this day
offers free lectures in various math and computer science areas to
anyone who shows up.
Dev's
interest in theoretical CS was
further strengthened during his master's studies at
IIT Kharagpur. In his free time he
likes to take short walks and, when stationary, likes listening to
70's rock and Hindi music.
Srikanth Srinivasan
Assistant Professor
IIT Bombay
srikanth[ta]math[td]iitb[td]ac[td]in
math.iitb.ac.in/~srikanth/
Assistant Professor
IIT Bombay
srikanth[ta]math[td]iitb[td]ac[td]in
math.iitb.ac.in/~srikanth/
Srikanth Srinivasan got his undergraduate degree from the
Indian Institute of Technology Madras,
where his interest in the theory side of CS was piqued under the
tutelage of
N.
S. Narayanswamy. Subsequently, he obtained his Ph.D. from
The Institute of Mathematical Sciences,
Chennai, in 2011; his advisor was V.
Arvind. His research interests span all of TCS (in theory), but in
practice are limited to circuit complexity, derandomization, and
related areas of mathematics. He enjoys running and pretending to play
badminton.