Moses Charikar
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]
References
- ↑ 1.0 1.1 1.2 Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Moses Charikar at the Mathematics Genealogy Project
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
External links
<templatestyles src="Asbox/styles.css"></templatestyles>
  |
This article about an Indian scientist is a stub. You can help Wikipedia by expanding it. |
<templatestyles src="Asbox/styles.css"></templatestyles>
