Moses Charikar

From Wikipedia, the free encyclopedia

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. He is known for the creation of the SimHash algorithm used by Google for near duplicate detection.[1]

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

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


  1. ^ Gurmeet Singh, Manku; Jain, Arvind; Das Sarma, Anish (2007), "Detecting near-duplicates for web crawling", Proceedings of the 16th International Conference on World Wide Web (PDF), doi:10.1145/1242572.1242592, S2CID 1414324.
  2. ^ a b c "Moses Charikar". Princeton University. Archived from the original on 24 December 2013. Retrieved 24 December 2013.
  3. ^ "Moses Samson Charikar". International Mathematical Olympiad. Retrieved 24 December 2013.
  4. ^ Moses Charikar at the Mathematics Genealogy Project
  5. ^ "Moses S Charikar, ACM Paris Kanellakis Theory and Practice Award, United States – 2012". Association for Computing Machinery. Retrieved 24 December 2013.

External links[edit]