Ameya A. Velingker

Contact Information

Computer Science Department
GHC 6211
Carnegie Mellon University
5000 Forbes Avenue
Pittsburgh, PA 15213

E-mail: avelingk AT cs DOT cmu DOT edu

Recent News:

Our paper A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs has been accepted to SoCG 2013.
I am organizer of the weekly CMU Theory Lunch this semester (Spring 2013).
Our paper Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes was presented at SODA 2013.

Hello everyone! My name is Ameya Velingker, and I am a second year PhD student in Computer Science at Carnegie Mellon University. I am advised by Venkatesan Guruswami and Gary Miller, and my research interests are broadly in the area of theoretical computer science. Specifically, I am interested in the theory of error-correcting codes, pseudorandomness, algorithms, and computational geometry.

In 2011, I completed the Master of Advanced Study in Mathematics at the University of Cambridge under the support of the Gates Cambridge Scholarship. Prior to that, I received an AB in Mathematics and SM in Computer Science (supported by a Siebel Scholars Award) from Harvard University in 2010.