Prof. Vijayaraghavan is an Adjunct Professor beginning in the 2014 Fall Quarter, until he is appointed as an Assistant Professor starting in September 2015. Previously, Prof. Vijayaraghavan was a Simons Foundation Postdoctoral Research Fellow with the Theory Group at Carnegie Mellon University.
Prof. Vijayaraghavan obtained his PhD from Princeton University in the Department of Computer Science. His advisor was Prof. Moses Charikar. his PhD thesis was Beyond Worst Case Analysis in Approximation Algorithms.
Prior to that, Prof. Vijayaraghavan finished his bachelor's degree in Computer Science and Engineering from the Indian Institute of Technology Madras in 2007. He spent the first fifteen years of my life in Pondicherry, a beautiful town in Southern India.
Prof. Vijayaraghavan's research interests are broadly in the field of Theoretical Computer Science, namely, in designing efficient algorithms for problems in Combinatorial Optimization and Machine Learning.
- Combinatorial Optimization: Approximation algorithms for problems like Graph Partitioning, finding Dense Subgraphs.
- Beyond Worst-Case Analysis: Realistic Average-Case instances and Smoothed analysis of algorithms.
- Theoretical Machine Learning: Unsupervised learning, and learning probabilistic models using tools like Tensor decompositions.