Professor Moses Charikar works as the Professor of Computer Science at Stanford University. Prior to joining Stanford, he had spent a year in the research group at Google, and was on the Computer Science faculty at Princeton University for 14 years.
Professor Charikar completed his B.Tech. in Computer Science and Engineering from IIT Bombay in 1995. He earned his doctorate in Computer Science from Stanford University in 2000. He spent a year in the research group at Google, and was on the Computer Science faculty at Princeton University for 14 years. Stanford as a faculty member in Fall 2015.
Professor Charikar works on designing algorithms that compute approximate solutions. These are important for hard optimization problems where algorithms that compute exact solutions are not known and considered unlikely. Also, in a host of “big data” settings, the massive size of the data makes traditional algorithms impractical and one must resort to approximate solutions. His work advances these notions of approximation and makes connections between them.
He has earned a number of distinctions during his career including best paper award at the annual IEEE Symposium on Foundations of Computer Science (2003) for his work on dimension reduction and the Paris Kanellakis Theory and Practice Award for his work on locality sensitive hashing. He was also named a Simons Investigator in theoretical computer science in 2014.