Moses Charikar
Affiliations: | Computer Science | Stanford University, Palo Alto, CA |
Google:
"Moses Charikar"Parents
Sign in to add mentor| Rajeev Motwani | grad student | 2001 | Stanford | |
| (Algorithms for clustering problems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Garg S, Shiragur K, Gordon DM, et al. (2023) Distributed algorithms from arboreal ants for the shortest path problem. Proceedings of the National Academy of Sciences of the United States of America. 120: e2207959120 |
| Awasthi P, Charikar M, Krishnaswamy R, et al. (2016) Spectral embedding of k-cliques, graph partitioning and k-Means Itcs 2016 - Proceedings of the 2016 Acm Conference On Innovations in Theoretical Computer Science. 301-310 |
| Zhu Q, Wong AK, Krishnan A, et al. (2015) Targeted exploration and analysis of large cross-platform human transcriptomic compendia. Nature Methods. 12: 211-4, 3 p following |
| Awasthi P, Charikar M, Krishnaswamy R, et al. (2015) The Hardness of Approximation of Euclidean κ-Means Leibniz International Proceedings in Informatics, Lipics. 34: 754-767 |
| Awasthi P, Bandeira AS, Charikar M, et al. (2015) Relax, no need to round: Integrality of clustering formulations Itcs 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. 191-200 |
| Bandeira AS, Charikar M, Singer A, et al. (2014) Multireference alignment using semidefinite programming Itcs 2014 - Proceedings of the 2014 Conference On Innovations in Theoretical Computer Science. 459-470 |
| Charikar M, Henzinger M, Nguyên HL. (2014) Online bipartite matching with decomposable weights Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 260-271 |
| Bansal N, Charikar M, Krishnaswamy R, et al. (2014) Better algorithms and hardness for broadcast scheduling via a discrepancy approach Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 55-71 |
| Charikar M, Li S. (2012) A dependent LP-rounding approach for the k-median problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 194-205 |
| Bhaskara A, Charikar M, Manokaran R, et al. (2012) On quadratic programming with a ratio objective Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 109-120 |