Professor Moses Charikar works as a 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.
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.
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 data makes traditional algorithms impractical and one must resort to approximate solutions. His work advances these notions of approximation and makes connection between them.
He has earned a number of distinctions during his career including the best paper award at FOCS 2003 for his work on dimension reduction. In 2012, he was awarded the Paris Kanellakis Theory and Practice Award for his work on Locality Sensitive Hashing. He was also named Simons Investigator in Theoretical Computer Science in 2014 at the University of California, Berkeley.
“I was at IIT Bombay from 1991 to 1995. Those were formative years in my life. My professors, especially Prof. Sundar Vishwanathan and Prof. Ajit Diwan kindled my interest in theoretical computer science where I found a happy blend of computer science and mathematics. I remember the all-nighters we pulled, completing course project just before the deadline or rehearsing for the performing arts festival. Those were some carefree years- - I have fond memories of my batch mates, cack sessions with my wingmates in hostel 7, and nightly jaunts to Chinco”.
Blurb: "Focus, patience and perseverance is his mantra for success."