Moses S. Charikar
Moses S. Charikar (* in Mumbai ) is an Indian - American theoretical computer scientist . He is a professor at Princeton University .
Charikar attended the Indian Institute of Technology in Mumbai and received his PhD under Rajeev Motwani at Stanford University in 2000 (Algorithms for Clustering Problems). He then worked at Google in a research group before moving to Princeton University in 2001.
He deals with theoretical computer science, especially approximation algorithms for NP-difficult problems, metric embeddings and algorithms for very large amounts of data. He is known for introducing efficient so-called Simhash functions in Locality Sensitive Hashing (LSH). He was also involved in the development of Minhash with Andrei Broder .
In 2012 he received the Paris Kanellakis Prize for LSH with Broder and Piotr Indyk .
Web links
Individual evidence
- ↑ Moses S. Charikar in the Mathematics Genealogy Project (English)
- ↑ Similarity estimation techniques from rounding algorithms, Proceedings of the 34th Annual ACM Symposium on Theory of Computing 2002
| personal data | |
|---|---|
| SURNAME | Charikar, Moses S. |
| BRIEF DESCRIPTION | Indian-American theoretical computer scientist |
| DATE OF BIRTH | 20th century |
| PLACE OF BIRTH | Mumbai |