Moses Charikar

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Moses Samson Charikar is an Indian computer scientist who works as a professor at Stanford University. He was previously a professor at Princeton University. The topics of his research include approximation algorithms, streaming algorithms, and metric embeddings.

Charikar was born in Bombay, India,[1] and competed for India at the 1990 and 1991 International Mathematical Olympiads, winning bronze and silver medals respectively.[2] He did his undergraduate studies at the Indian Institute of Technology Bombay.[1] In 2000 he completed a doctorate from Stanford University, under the supervision of Rajeev Motwani;[3] he joined the Princeton faculty in 2001.[1]

In 2012 he was awarded the Paris Kanellakis Award along with Andrei Broder and Piotr Indyk for their research on locality-sensitive hashing.[4]


  1. ^ a b c "Moses Charikar". Princeton University. Retrieved December 24, 2013. 
  2. ^ "Moses Samson Charikar". International Mathematical Olympiad. Retrieved December 24, 2013. 
  3. ^ Moses Charikar at the Mathematics Genealogy Project
  4. ^ "Moses S Charikar, ACM Paris Kanellakis Theory and Practice Award, United States – 2012". Association for Computing Machinery. Retrieved December 24, 2013. 

External links[edit]