| Similarity estimation techniques from rounding algorithms MS Charikar Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 3248 | 2002 |
| Finding frequent items in data streams M Charikar, K Chen, M Farach-Colton Theoretical Computer Science 312 (1), 3-15, 2004 | 2123 | 2004 |
| Min-wise independent permutations AZ Broder, M Charikar, AM Frieze, M Mitzenmacher Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 1480 | 1998 |
| Multi-probe LSH: efficient indexing for high-dimensional similarity search Q Lv, W Josephson, Z Wang, M Charikar, K Li Proceedings of the 33rd international conference on Very large data bases …, 2007 | 1104 | 2007 |
| Aggregating inconsistent information: ranking and clustering N Ailon, M Charikar, A Newman Journal of the ACM (JACM) 55 (5), 1-27, 2008 | 1078 | 2008 |
| A constant-factor approximation algorithm for the k-median problem M Charikar, S Guha, É Tardos, DB Shmoys Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 897 | 1999 |
| Incremental clustering and dynamic information retrieval M Charikar, C Chekuri, T Feder, R Motwani Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 835 | 1997 |
| Improved combinatorial algorithms for facility location problems M Charikar, S Guha SIAM Journal on Computing 34 (4), 803-824, 2005 | 804* | 2005 |
| Approximation algorithms for directed Steiner problems M Charikar, C Chekuri, TY Cheung, Z Dai, A Goel, S Guha, M Li Journal of Algorithms 33 (1), 73-91, 1999 | 665 | 1999 |
| Greedy approximation algorithms for finding dense components in a graph M Charikar International workshop on approximation algorithms for combinatorial …, 2000 | 663 | 2000 |
| Clustering with qualitative information M Charikar, V Guruswami, A Wirth Journal of Computer and System Sciences 71 (3), 360-383, 2005 | 569 | 2005 |
| Algorithms for facility location problems with outliers M Charikar, S Khuller, DM Mount, G Narasimhan SODA 1, 642-651, 2001 | 535 | 2001 |
| The smallest grammar problem M Charikar, E Lehman, D Liu, R Panigrahy, M Prabhakaran, A Sahai, ... IEEE Transactions on Information Theory 51 (7), 2554-2576, 2005 | 533* | 2005 |
| Detecting high log-densities: an O(n¼) approximation for densest k-subgraph A Bhaskara, M Charikar, E Chlamtac, U Feige, A Vijayaraghavan Proceedings of the forty-second ACM symposium on Theory of computing, 201-210, 2010 | 400 | 2010 |
| Better streaming algorithms for clustering problems M Charikar, L O'Callaghan, R Panigrahy Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 372 | 2003 |
| Learning from untrusted data M Charikar, J Steinhardt, G Valiant Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 326 | 2017 |
| Towards estimation error guarantees for distinct values M Charikar, S Chaudhuri, R Motwani, V Narasayya Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000 | 294 | 2000 |
| Maximizing quadratic programs: Extending Grothendieck's inequality M Charikar, A Wirth 45th Annual IEEE Symposium on Foundations of Computer Science, 54-60, 2004 | 257 | 2004 |
| Approximating a finite metric by a small number of tree metrics M Charikar, C Chekuri, A Goel, S Guha, S Plotkin Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 237 | 1998 |
| A hitting time analysis of stochastic gradient langevin dynamics Y Zhang, P Liang, M Charikar Conference on Learning Theory, 1980-2022, 2017 | 230 | 2017 |
Kai LiProfessor of computer science, Princeton universitycs.princeton.edu의 이메일 확인됨
