Moses Charikar
Stanford University(US)
Publications by Year
Research Areas
Complexity and Algorithms in Graphs, Optimization and Search Problems, Advanced Graph Theory Research, Machine Learning and Algorithms, Algorithms and Data Compression
Most-Cited Works
- → Similarity estimation techniques from rounding algorithms(2002)2,210 cited
- → Finding frequent items in data streams(2003)1,323 cited
- → Min-Wise Independent Permutations(2000)830 cited
- → Efficient k-nearest neighbor graph construction for generic similarity measures(2011)648 cited
- → Aggregating inconsistent information(2008)624 cited
- Multi-probe LSH: efficient indexing for high-dimensional similarity search(2007)
- → A Constant-Factor Approximation Algorithm for the k-Median Problem(2002)517 cited
- → Greedy Approximation Algorithms for Finding Dense Components in a Graph(2000)481 cited