Janardhan KulkarniHi! I got my Ph.D. from the department of Computer Science at Duke University. My adviser was (is) Kamesh Munagala. I am now at MSR, Redmond.
I am interested in the design of algorithms with provable performance
guarantees. In particular, I study resource allocation and scheduling
problems, with constraints on fairness, energy minimization, strategyproofness, that arise in large scale distributed data centers. My research
involves using concepts and techniques from the fields of approximation algorithms, online algorithms and game theory. I am also broadly interested in
the intersection of online algorithms and online learning theory. Much of my work is theoretical, but I spend
non-trivial amount of time converting my equations into code.
Contact: kulkarni at cs dot duke dot eduHere is my CV.
Read my thesis The Design of Scheduling Algorithms Using Game Theoretic Ideas. It won the Duke Best Thesis Award 2015.
People have called me by 1, 2, 3, 4, 5, 8, and 9 letter prefixes of my first name, and I have said hi!