His current research focuses on studying the optimality of certain inner and outer bounds to capacity regions for fundamental problems in multiuser information theory. In a broader sense these problems are concerned with establishing tensorization/sub additivity properties of certain functionals over high-dimensional probability spaces. Previously, in his dissertation, he gave a proof of the Parisi and Coppersmith-Sorkin conjectures in the Random Assignment Problem; and resolved some conjectures related to Random Energy model approximation of the Number Partition Problem during his post-doctoral years.