Phone: (801) 949-3759
I am a fifth-year Ph.D. student in the Computer Science department at the University of Utah, where I work with Suresh Venkatasubramanian. My area of interest is Combinatorial and Computational Geometry. A major theme of my research is proximity search, with a special attention to varying geometric distances or models of data. In the Euclidean space, I studied spectral algorithms to derive ANN bounds related to the distribution of the singular values and spectral profile of the data. In the more general domain, I study the algorithmic geometry of the Bregman divergences. These are information theoretic measures that arise as a natural generalization of the Euclidean distance, and my research explores which upper bounds from Euclidean geometry may be adapted to this case.
I also study lower bounds for nearest neighbor and embedding problems in these generalized spaces. As such, I am intrigued by the isoperimetric and geometric questions that arise naturally in this effort.
And finally, I have also explored computation of statistics on uncertain data, and variants of sampling techniques upon them.
I did my B.Sc. in Mathematics and Computer Science at Lahore University of Management Sciences, where I was also a research assistant under Nabil Mustafa.