Dev Desai

I am a Ph.D. student in the Computer Science department at Rutgers University. My research interests include hardness of approximation, complexity theory and combinatorics. My advisor is Mario Szegedy.

Contact:

Office: Hill 268
E-mail: devdesai [at] cs [dot] rutgers [dot] edu

Research:

Complexity of Newman's Community Finding Approach for Social Networks.
with Bhaskar DasGupta.
Submitted. [arXiv]

Notes:

Chapter 7 of the DIMACS Tutorial on "Limits of approximation algorithms : PCPs and Unique Games".
[arXiv]

Teaching Assistant:

Spring 2011: CS513: Graduate Algorithms.
Office Hours: Thursdays 3:00pm -- 5:00pm.