# Moses Charikar

> Indian computer scientist

**Wikidata**: [Q15835702](https://www.wikidata.org/wiki/Q15835702)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Moses_Charikar)  
**Source**: https://4ort.xyz/entity/moses-charikar

## Summary
Moses Charikar is an Indian computer scientist and university teacher known for his groundbreaking work in computer science, particularly in the design of efficient algorithmic techniques. He is recognized for his contributions to Locality-Sensitive Hashing, big data algorithms, and metric embeddings. Charikar is a recipient of the Paris Kanellakis Award and an ACM Fellow.

## Biography
- Born: 2000 (Mumbai, India)
- Nationality: India
- Education: Indian Institute of Technology Bombay, Stanford University
- Known for: Groundbreaking work on Locality-Sensitive Hashing and efficient algorithmic techniques for big data, hashing, approximation algorithms, and metric embeddings.
- Employer(s): Princeton University, Stanford University
- Field(s): Computer science

## Contributions
Moses Charikar has made significant contributions to the field of computer science, particularly in the design of efficient algorithms. His most notable work includes the co-development of Locality-Sensitive Hashing (LSH), for which he received the Paris Kanellakis Award in 2012. This groundbreaking technique has had a profound impact across various domains, including computer vision, databases, information retrieval, machine learning, and signal processing, by enabling efficient similarity search in high-dimensional data.

His broader research encompasses efficient algorithmic techniques for big data, hashing, approximation algorithms, and metric embeddings, which earned him recognition as an ACM Fellow in 2020. As a university teacher, he has also contributed to the academic community by advising doctoral students such as Anthony Ian Wirth and Yury Makarychev, and was himself a doctoral student of Rajeev Motwani. His work has advanced the theoretical and practical foundations of algorithmic design for complex computational problems.

## FAQs
### Q: Who is Moses Charikar?
A: Moses Charikar is an Indian computer scientist and university teacher. He is known for his significant contributions to algorithmic techniques, including Locality-Sensitive Hashing, and is an ACM Fellow.

### Q: What is Moses Charikar known for?
A: Moses Charikar is known for his groundbreaking work on Locality-Sensitive Hashing (LSH), which has impacted fields like computer vision and machine learning. He is also recognized for designing efficient algorithmic techniques for big data, hashing, approximation algorithms, and metric embeddings.

### Q: Where does Moses Charikar work?
A: Moses Charikar has been employed by Princeton University and Stanford University. He is affiliated with the Stanford University Computer Science Department and holds the Donald E. Knuth Professorship.

### Q: What awards has Moses Charikar received?
A: Moses Charikar received the Paris Kanellakis Award in 2012 for his work on Locality-Sensitive Hashing. He was also named an ACM Fellow in 2020 for his contributions to efficient algorithmic techniques.

### Q: Where did Moses Charikar receive his education?
A: Moses Charikar was educated at the Indian Institute of Technology Bombay and Stanford University.

## Why They Matter
Moses Charikar's work has fundamentally reshaped how large-scale data is processed and analyzed, particularly through his co-invention of Locality-Sensitive Hashing (LSH). This technique provided an efficient solution to the "curse of dimensionality" in similarity search, enabling practical applications in fields ranging from image recognition and web search to bioinformatics. Without LSH, many modern data-intensive applications would struggle with computational efficiency, making his contribution indispensable to the advancement of big data analytics and machine learning.

His broader research in approximation algorithms and metric embeddings has provided crucial theoretical underpinnings and practical tools for tackling complex optimization problems. As a university teacher and doctoral advisor, he has also influenced the next generation of computer scientists, ensuring that his impact extends through his students' contributions. His recognition as an ACM Fellow and recipient of the Paris Kanellakis Award underscores the lasting significance and widespread adoption of his algorithmic innovations in both academic research and industrial applications.

## Notable For
*   Co-inventor of Locality-Sensitive Hashing (LSH), a groundbreaking technique for efficient similarity search in high-dimensional data.
*   Recipient of the 2012 Paris Kanellakis Award for his work on Locality-Sensitive Hashing.
*   Named an ACM Fellow in 2020 for his design of efficient algorithmic techniques for big data, hashing, approximation algorithms, and metric embeddings.
*   Holds the Donald E. Knuth Professorship at Stanford University.
*   Doctoral advisor to computer scientists such as Anthony Ian Wirth and Yury Makarychev.

## Body

### Personal Details
*   **Name**: Moses Charikar
*   **Aliases**: Moses Samson Charikar, Moses S. Charikar
*   **Birth Date**: 2000
*   **Birth Place**: Mumbai, India
*   **Nationality**: Indian
*   **Sex or Gender**: Male
*   **Instance of**: Human

### Education
*   **Alma Mater**: Indian Institute of Technology Bombay, Stanford University
*   **Doctoral Advisor**: Rajeev Motwani

### Career
*   **Occupation**: Computer scientist, university teacher
*   **Field of Work**: Computer science
*   **Employer(s)**: Princeton University, Stanford University
*   **Affiliation**: Stanford University Computer Science Department
*   **Work Location**: Stanford
*   **Professorship**: Donald E. Knuth Professorship

### Awards and Recognition
*   **Paris Kanellakis Award**: Received in 2012, shared with Andrei Broder and Piotr Indyk, for their groundbreaking work on Locality-Sensitive Hashing. The award cited its great impact in fields including computer vision, databases, information retrieval, machine learning, and signal processing.
*   **ACM Fellow**: Became an ACM Fellow in 2020 (announced January 13, 2021). Recognized for the design of efficient algorithmic techniques for big data, hashing, approximation algorithms, and metric embeddings.
*   **Member of**: Association for Computing Machinery (as an ACM Fellow since 2021-01-13).
*   **Participant in**: International Mathematical Olympiad.

### Research and Contributions
*   **Key Contribution**: Co-development of Locality-Sensitive Hashing (LSH).
*   **Research Areas**: Efficient algorithmic techniques for big data, hashing, approximation algorithms, and metric embeddings.

### Mentorship
*   **Doctoral Students**: Anthony Ian Wirth, Yury Makarychev

### Identifiers
*   **GND ID**: 1344635865
*   **VIAF ID**: 306104402
*   **Freebase ID**: /m/0bqy18g
*   **MR Author ID**: 619282
*   **NL CR Aut ID**: stk2007415628
*   **DBLP Author ID**: c/MosesCharikar
*   **Yale LUX ID**: person/f349f982-30a4-4f8e-b7e2-4c0ffe98e4c9
*   **ZBMath Author ID**: charikar.moses-s
*   **Google Scholar Author ID**: zX3ba1kAAAAJ
*   **ACM Digital Library Author ID**: 81100202109
*   **Library of Congress Authority ID**: nb2007020007
*   **Mathematics Genealogy Project ID**: 71079
*   **National Library of Israel J9U ID**: 987007371047205171
*   **International Mathematical Olympiad Participant ID**: 2497

### Online Presence
*   **Website**: https://profiles.stanford.edu/moses-charikar (English)
*   **Wikipedia Title**: Moses Charikar
*   **Wikipedia Languages**: arz, de, en, fr, uk

```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Moses Charikar",
  "jobTitle": "Computer Scientist",
  "worksFor": [
    {"@type": "Organization", "name": "Princeton University"},
    {"@type": "Organization", "name": "Stanford University"}
  ],
  "nationality": {"@type": "Country", "name": "India"},
  "birthDate": "2000",
  "birthPlace": "Mumbai, India",
  "alumniOf": [
    {"@type": "EducationalOrganization", "name": "Indian Institute of Technology Bombay"},
    {"@type": "EducationalOrganization", "name": "Stanford University"}
  ],
  "knowsAbout": ["Computer Science", "Artificial Intelligence"],
  "sameAs": [
    "https://www.wikidata.org/wiki/Q55655380",
    "https://en.wikipedia.org/wiki/Moses_Charikar",
    "https://profiles.stanford.edu/moses-charikar"
  ],
  "description": "Indian computer scientist known for his work on Locality-Sensitive Hashing and efficient algorithmic techniques."
}

## References

1. [Source](https://profiles.stanford.edu/moses-charikar)
2. [Source](https://awards.acm.org/award_winners/charikar_0308379#147)
3. [Source](https://awards.acm.org/award_winners/charikar_0308379#158)
4. [Source](https://www.acm.org/media-center/2021/january/fellows-2020)
5. Mathematics Genealogy Project