| 2026 | COLT | Language Identification with Succinct Machine-Independent Traces. | Moses Charikar, Jon M. Kleinberg, Chirag Pabbaraju |
| 2026 | COLT | A Characterization of List Language Identification in the Limit. | Moses Charikar, Chirag Pabbaraju, Ambuj Tewari |
| 2026 | SODA | Approximately Dominating Sets in Elections. | Moses Charikar, Prasanna Ramakrishnan, Kangning Wang |
| 2026 | STOC | A (4+ϵ)-Approximation for Euclidean k-Means via Non-monotone Dual-Fitting. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2025 | COLT | Exploring Facets of Language Generation in the Limit. | Moses Charikar, Chirag Pabbaraju |
| 2025 | FMCAD | Towards SMT Solver Stability via Input Normalization. | Daneshvar Amrollahi, Mathias Preiner, Aina Niemetz, Andrew Reynolds, Moses Charikar, Cesare Tinelli, Clark W. Barrett |
| 2025 | FOCS | An Improved Greedy Approximation for (Metric) k-Means. | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland |
| 2025 | ICML | Correlation Clustering Beyond the Pivot Algorithm. | Soheil Behnezhad, Moses Charikar, Vincent Cohen-Addad, Alma Ghafari, Weiyun Ma |
| 2025 | SODA | Embedding Probability Distributions into Low Dimensional ℓ | Moses Charikar, Spencer Compton, Chirag Pabbaraju |
| 2025 | SODA | The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction. | Moses Charikar, Erik Waingarten |
| 2025 | STOC | Six Candidates Suffice to Win a Voter Majority. | Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang |
| 2024 | ICDE | Dynamic Data Layout Optimization with Worst-Case Guarantees. | Kexin Rong, Paul Liu, Sarah Ashok Sonje, Moses Charikar |
| 2024 | SODA | Improved Approximations for Ultrametric Violation Distance. | Moses Charikar, Ruiquan Gao |
| 2024 | SODA | A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations. | Moses Charikar, Michael Kapralov, Erik Waingarten |
| 2024 | SODA | Breaking the Metric Voting Distortion Barrier. | Moses Charikar, Kangning Wang, Prasanna Ramakrishnan, Hongxun Wu |
| 2023 | COLT | Fast Algorithms for a New Relaxation of Optimal Transport. | Moses Charikar, Beidi Chen, Christopher R, Erik Waingarten |
| 2023 | SODA | Single-Pass Streaming Algorithms for Correlation Clustering. | Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan |
| 2023 | STOC | A Characterization of List Learnability. | Moses Charikar, Chirag Pabbaraju |
| 2022 | FOCS | Almost 3-Approximate Correlation Clustering in Constant Rounds. | Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan |
| 2022 | ICALP | Polylogarithmic Sketches for Clustering. | Moses Charikar, Erik Waingarten |
| 2022 | SODA | Near-Optimal Explainable k-Means for All Dimensions. | Moses Charikar, Lunjia Hu |
| 2022 | SODA | Metric Distortion Bounds for Randomized Social Choice. | Moses Charikar, Prasanna Ramakrishnan |
| 2021 | AISTATS | Approximation Algorithms for Orthogonal Non-negative Matrix Factorization. | Moses Charikar, Lunjia Hu |
| 2021 | COLT | The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood. | Nima Anari, Moses Charikar, Kirankumar Shiragur, Aaron Sidford |
| 2021 | FOCS | Multiway Online Correlated Selection. | Guy Blanc, Moses Charikar |
| 2021 | PODC | Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity. | Moses Charikar, Weiyun Ma, Li-Yang Tan |
| 2020 | FOCS | Kernel Density Estimation through Density Constrained Near Neighbor Search. | Moses Charikar, Michael Kapralov, Navid Nouri, Paris Siminelakis |
| 2020 | SIGCSE | Institutions Share Successes, Failures, and Advice in Moving the Diversity Needle. | Dan Garcia, Moses Charikar, Eboney Hearn, Ed Lazowska, Jonathan Reynolds |
| 2020 | SODA | Adaptive Discrete Phase Retrieval. | Moses Charikar, Xian Wu, Yinyu Ye |
| 2020 | WSDM | Retrieving Top Weighted Triangles in Graphs. | Raunak Kumar, Paul Liu, Moses Charikar, Austin R. Benson |
| 2020 | SPAA | Unconditional Lower Bounds for Adaptive Massively Parallel Computation. | Moses Charikar, Weiyun Ma, Li-Yang Tan |
| 2019 | AISTATS | Recovery Guarantees For Quadratic Tensors With Sparse Observations. | Hongyang Zhang, Vatsal Sharan, Moses Charikar, Yingyu Liang |
| 2019 | AISTATS | Hierarchical Clustering for Euclidean Data. | Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev |
| 2019 | FOCS | Multi-resolution Hashing for Fast Pairwise Summations. | Moses Charikar, Paris Siminelakis |
| 2019 | ICML | Rehashing Kernel Evaluation in High Dimensions. | Paris Siminelakis, Kexin Rong, Peter Bailis, Moses Charikar, Philip Alexander Levis |
| 2019 | SODA | Hierarchical Clustering better than Average-Linkage. | Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh |
| 2019 | STOC | Efficient profile maximum likelihood for universal symmetric property estimation. | Moses Charikar, Kirankumar Shiragur, Aaron Sidford |
| 2019 | WSDM | Sampling Methods for Counting Temporal Motifs. | Paul Liu, Austin R. Benson, Moses Charikar |
| 2018 | FOCS | Efficient Density Evaluation for Smooth Kernels. | Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis |
| 2018 | ICALP | On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. | Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul |
| 2018 | ICALP | Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. | Moses Charikar, Shay Solomon |
| 2018 | ICML | Hierarchical Clustering with Structural Constraints. | Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar |
| 2018 | ICML | Local Density Estimation in High Dimensions. | Xian Wu, Moses Charikar, Vishnu Natchu |
| 2017 | COLT | A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics. | Yuchen Zhang, Percy Liang, Moses Charikar |
| 2017 | FOCS | Hashing-Based-Estimators for Kernel Density in High Dimensions. | Moses Charikar, Paris Siminelakis |
| 2017 | IPCO | Local Guarantees in Graph Cuts and Clustering. | Moses Charikar, Neha Gupta, Roy Schwartz |
| 2017 | SODA | Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics. | Moses Charikar, Vaggos Chatziafratis |
| 2017 | STOC | Learning from untrusted data. | Moses Charikar, Jacob Steinhardt, Gregory Valiant |
| 2015 | COLT | Label optimal regret bounds for online local learning. | Pranjal Awasthi, Moses Charikar, Kevin A. Lai, Andrej Risteski |
| 2014 | COLT | Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? | Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan |
| 2014 | COLT | Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability. | Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan |
| 2014 | ESA | Online Bipartite Matching with Decomposable Weights. | Moses Charikar, Monika Henzinger, Huy L. Nguyen |
| 2014 | SODA | Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. | Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li |
| 2014 | STOC | Smoothed analysis of tensor decompositions. | Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan |
| 2012 | ICALP | On Quadratic Programming with a Ratio Objective. | Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan |
| 2012 | ICALP | A Dependent LP-Rounding Approach for the k-Median Problem. | Moses Charikar, Shi Li |
| 2012 | SODA | Polynomial integrality gaps for strong SDP relaxations of Densest | Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou |
| 2011 | FOCS | Near Linear Lower Bound for Dimension Reduction in L1. | Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen |
| 2011 | WWW | Efficient k-nearest neighbor graph construction for generic similarity measures. | Wei Dong, Moses Charikar, Kai Li |
| 2011 | SODA | Tight Hardness Results for Minimizing Discrepancy. | Moses Charikar, Alantha Newman, Aleksandar Nikolov |
| 2010 | FOCS | Vertex Sparsifiers and Abstract Rounding Algorithms. | Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra |
| 2010 | STOC | Detecting high log-densities: an | Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan |
| 2009 | ESA | Improved Approximation Algorithms for Label Cover Problems. | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff |
| 2009 | STOC | MaxMin allocation via degree lower-bounded arborescences. | MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami |
| 2009 | STOC | Integrality gaps for Sherali-Adams relaxations. | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2008 | CIKM | Modeling LSH for performance tuning. | Wei Dong, Zhe Wang, William Josephson, Moses Charikar, Kai Li |
| 2008 | SIGIR | Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. | Wei Dong, Moses Charikar, Kai Li |
| 2008 | SPAA | Online multicast with egalitarian cost sharing. | Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks |
| 2007 | FOCS | On the Advantage over Random for Maximum Acyclic Subgraph. | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2007 | FOCS | Local Global Tradeoffs in Metric Embeddings. | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2007 | SODA | Near-optimal algorithms for maximum constraint satisfaction problems. | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2007 | SODA | A divide and conquer algorithm for | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2007 | STOC | Improved approximation for directed cut problems. | Amit Agarwal, Noga Alon, Moses Charikar |
| 2007 | VLDB | Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search . | Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li |
| 2007 | SIGMETRICS | Sizing sketches: a rank-based analysis for similarity search. | Zhe Wang, Wei Dong, William Josephson, Qin Lv, Moses Charikar, Kai Li |
| 2006 | EuroSys | Ferret: a toolkit for content-based similarity search of feature-rich data. | Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li |
| 2006 | SODA | Untitled record | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao |
| 2006 | SODA | A robust maximum completion time measure for scheduling. | Moses Charikar, Samir Khuller |
| 2006 | SODA | Directed metrics and directed graph partitioning problems. | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2006 | STOC | Near-optimal algorithms for unique games. | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2005 | FOCS | Fitting tree metrics: Hierarchical clustering and Phylogeny. | Nir Ailon, Moses Charikar |
| 2005 | SODA | Approximating the average response time in broadcast scheduling. | Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor |
| 2005 | SODA | A tight threshold for metric Ramsey phenomena. | Moses Charikar, Adriana Karagiozova |
| 2005 | STOC | O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. | Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev |
| 2005 | STOC | Aggregating inconsistent information: ranking and clustering. | Nir Ailon, Moses Charikar, Alantha Newman |
| 2005 | STOC | On non-uniform multicommodity buy-at-bulk network design. | Moses Charikar, Adriana Karagiozova |
| 2004 | CIKM | Image similarity search with compact data structures. | Qin Lv, Moses Charikar, Kai Li |
| 2004 | FOCS | On the Integrality Ratio for Asymmetric TSP. | Moses Charikar, Michel X. Goemans, Howard J. Karloff |
| 2004 | FOCS | Maximizing Quadratic Programs: Extending Grothendieck's Inequality. | Moses Charikar, Anthony Wirth |
| 2004 | ITW | On the advantage of network coding for improving network throughput. | Amit Agarwal, Moses Charikar |
| 2003 | FOCS | On the Impossibility of Dimension Reduction in l | Bo Brinkman, Moses Charikar |
| 2003 | FOCS | Clustering with Qualitative Information. | Moses Charikar, Venkatesan Guruswami, Anthony Wirth |
| 2003 | STOC | Better streaming algorithms for clustering problems. | Moses Charikar, Liadan O'Callaghan, Rina Panigrahy |
| 2002 | FOCS | Dimension Reduction in the \ell _1 Norm. | Moses Charikar, Amit Sahai |
| 2002 | ICALP | Finding Frequent Items in Data Streams. | Moses Charikar, Kevin C. Chen, Martin Farach-Colton |
| 2002 | ICALP | New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. | Moses Charikar, Piotr Indyk, Rina Panigrahy |
| 2002 | SODA | On semidefinite programming relaxations for graph coloring and vertex cover. | Moses Charikar |
| 2002 | STOC | Similarity estimation techniques from rounding algorithms. | Moses Charikar |
| 2002 | STOC | Approximating the smallest grammar: Kolmogorov complexity in natural models. | Moses Charikar, Eric P. Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat |
| 2001 | SODA | Algorithms for facility location problems with outliers. | Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan |
| 2001 | STOC | Approximating min-sum | Yair Bartal, Moses Charikar, Danny Raz |
| 2001 | STOC | Clustering to minimize the sum of cluster diameters. | Moses Charikar, Rina Panigrahy |
| 2000 | FOCS | Combinatorial feature selection problems. | Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai |
| 2000 | INFOCOM | Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. | Moses Charikar, Joseph Naor, Baruch Schieber |
| 2000 | PODS | Towards Estimation Error Guarantees for Distinct Values. | Moses Charikar, Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasayya |
| 2000 | STOC | Query strategies for priced information (extended abstract). | Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai |
| 1999 | FOCS | Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. | Moses Charikar, Sudipto Guha |
| 1999 | SODA | Minimizing Wirelength in Zero and Bounded Skew Clock Trees. | Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins |
| 1999 | STOC | A Constant-Factor Approximation Algorithm for the | Moses Charikar, Sudipto Guha, va Tardos, David B. Shmoys |
| 1999 | STOC | On targeting Markov segments. | Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins |
| 1998 | FOCS | Delayed Information and Action in On-line Algorithms. | Susanne Albers, Moses Charikar, Michael Mitzenmacher |
| 1998 | FOCS | Approximating a Finite Metric by a Small Number of Tree Metrics. | Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin |
| 1998 | FOCS | The Finite Capacity Dial-A-Ride Problem. | Moses Charikar, Balaji Raghavachari |
| 1998 | SODA | Approximation Algorithms for Directed Steiner Problems. | Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li |
| 1998 | SODA | The Dynamic Servers Problem. | Moses Charikar, Dan Halperin, Rajeev Motwani |
| 1998 | STOC | Min-Wise Independent Permutations (Extended Abstract). | Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher |
| 1998 | STOC | Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and | Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha |
| 1998 | STOC | Algorithms for Capacitated Vehicle Routing. | Moses Charikar, Samir Khuller, Balaji Raghavachari |
| 1997 | SODA | On Page Migration and Other Relaxed Task Systems. | Yair Bartal, Moses Charikar, Piotr Indyk |
| 1997 | STOC | Incremental Clustering and Dynamic Information Retrieval. | Moses Charikar, Chandra Chekuri, Toms Feder, Rajeev Motwani |
| 1997 | WADS | On-line Load Balancing for Related Machines. | Piotr Berman, Moses Charikar, Marek Karpinski |
| 1997 | WADS | Constrained TSP and Low-Power Computing. | Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein |