Welcome to my webpage! I am a postdoctoral researcher at Yahoo! Research. Previously, I was at Microsoft Research New England, Cambridge, MA. In 2007, I completed my Ph.D. in the department of Computer Science at Princeton University, under the supervision of Prof. Sanjeev Arora. I completed my B.Tech in Computer Science at the Indian Institute of Technology, Bombay in 2002.

My research area is Theoretical Computer Science. My current research is the design of efficient, practical algorithms for fundamental problems in Convex and Combinatorial Optimization, and Machine Learning. My main research expertise is in designing fast, approximate solvers for linear or semidefinite programs by employing a variety of techniques from Machine Learning, Game Theory, and Convex Optimization. My research work includes efficient algorithms for semidefinite programming, graph partitioning, online learning/prediction, portfolio selection, matrix sparsification, derandomization, quantum computing, privacy preservation in statistical databases, sublinear time computation, streaming computation, image compression, and event matching on networks. I am also interested in Game Theory and Complexity Theory.

Contact information:
Yahoo! Research
    4301 Great America Parkway
    Santa Clara, CA 95054
skale [at] yahoo-inc [dot] com

My curriculum vitae (very outdated):