Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMoses Charikar
Moses Samson Charikar
Person information
- affiliation: Princeton University
- award (2012): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j30]Edward Gan, Peter Bailis, Moses Charikar:
CoopStore: Optimizing Precomputed Summaries for Aggregation. Proc. VLDB Endow. 13(11): 2174-2187 (2020)- [c116]Dan Garcia, Moses Charikar, Eboney Hearn, Ed Lazowska, Jonathan Reynolds:
Institutions Share Successes, Failures, and Advice in Moving the Diversity Needle. SIGCSE 2020: 331-332 - [c115]Moses Charikar, Xian Wu, Yinyu Ye:
Adaptive Discrete Phase Retrieval. SOSA@SODA 2020: 47-56 - [c114]Moses Charikar, Weiyun Ma, Li-Yang Tan:
Unconditional Lower Bounds for Adaptive Massively Parallel Computation. SPAA 2020: 141-151 - [c113]Raunak Kumar, Paul Liu, Moses Charikar, Austin R. Benson:
Retrieving Top Weighted Triangles in Graphs. WSDM 2020: 295-303 - [i45]Moses Charikar, Weiyun Ma, Li-Yang Tan:
New lower bounds for Massively Parallel Computation from query complexity. CoRR abs/2001.01146 (2020) - [i44]Edward Gan, Peter Bailis, Moses Charikar:
Storyboard: Optimizing Precomputed Summaries for Aggregation. CoRR abs/2002.03063 (2020) - [i43]Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
A General Framework for Symmetric Property Estimation. CoRR abs/2003.00844 (2020) - [i42]Nima Anari, Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood. CoRR abs/2004.02425 (2020) - [i41]Joshua Brakensiek, Moses Charikar, Aviad Rubinstein:
A Simple Sublinear Algorithm for Gap Edit Distance. CoRR abs/2007.14368 (2020) - [i40]Xian Wu, Moses Charikar:
Nearest Neighbor Search for Hyperbolic Embeddings. CoRR abs/2009.00836 (2020)
2010 – 2019
- 2019
- [c112]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. AISTATS 2019: 2721-2730 - [c111]Hongyang Zhang, Vatsal Sharan, Moses Charikar, Yingyu Liang:
Recovery Guarantees For Quadratic Tensors With Sparse Observations. AISTATS 2019: 3322-3332 - [c110]Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang:
The One-Way Communication Complexity of Dynamic Time Warping Distance. Symposium on Computational Geometry 2019: 16:1-16:15 - [c109]Moses Charikar, Paris Siminelakis:
Multi-resolution Hashing for Fast Pairwise Summations. FOCS 2019: 769-792 - [c108]Paris Siminelakis, Kexin Rong, Peter Bailis, Moses Charikar, Philip Levis:
Rehashing Kernel Evaluation in High Dimensions. ICML 2019: 5789-5798 - [c107]Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
A General Framework for Symmetric Property Estimation. NeurIPS 2019: 12426-12436 - [c106]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh:
Hierarchical Clustering better than Average-Linkage. SODA 2019: 2291-2304 - [c105]Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
Efficient profile maximum likelihood for universal symmetric property estimation. STOC 2019: 780-791 - [c104]Paul Liu, Austin R. Benson, Moses Charikar:
Sampling Methods for Counting Temporal Motifs. WSDM 2019: 294-302 - [e3]Moses Charikar, Edith Cohen:
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. ACM 2019, ISBN 978-1-4503-6705-9 [contents] - [i39]Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang:
The One-Way Communication Complexity of Dynamic Time Warping Distance. CoRR abs/1903.03520 (2019) - [i38]Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
Efficient Profile Maximum Likelihood for Universal Symmetric Property Estimation. CoRR abs/1905.08448 (2019) - [i37]Raunak Kumar, Paul Liu, Moses Charikar, Austin R. Benson:
Retrieving Top Weighted Triangles in Graphs. CoRR abs/1910.00692 (2019) - 2018
- [c103]Moses Charikar, Yonatan Naamad, Jennifer Rexford, X. Kelvin Zou:
Multi-commodity Flow with In-Network Processing. ALGOCLOUD 2018: 73-101 - [c102]Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis:
Efficient Density Evaluation for Smooth Kernels. FOCS 2018: 615-626 - [c101]Moses Charikar, Shay Solomon:
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. ICALP 2018: 33:1-33:14 - [c100]Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul:
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. ICALP 2018: 34:1-34:14 - [c99]Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar:
Hierarchical Clustering with Structural Constraints. ICML 2018: 773-782 - [c98]Xian Wu, Moses Charikar, Vishnu Natchu:
Local Density Estimation in High Dimensions. ICML 2018: 5293-5301 - [c97]Jacob Steinhardt, Moses Charikar, Gregory Valiant:
Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. ITCS 2018: 45:1-45:21 - [i36]Moses Charikar, Yonatan Naamad, Jimmy Wu:
On Finding Dense Common Subgraphs. CoRR abs/1802.06361 (2018) - [i35]Moses Charikar, Yonatan Naamad, Jennifer Rexford, X. Kelvin Zou:
Multi-Commodity Flow with In-Network Processing. CoRR abs/1802.09118 (2018) - [i34]Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul:
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. CoRR abs/1804.09907 (2018) - [i33]Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar:
Hierarchical Clustering with Structural Constraints. CoRR abs/1805.09476 (2018) - [i32]Moses Charikar, Paris Siminelakis:
Multi-Resolution Hashing for Fast Pairwise Summations. CoRR abs/1807.07635 (2018) - [i31]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh:
Hierarchical Clustering better than Average-Linkage. CoRR abs/1808.02227 (2018) - [i30]Moses Charikar, Paris Siminelakis:
Hashing-Based-Estimators for Kernel Density in High Dimensions. CoRR abs/1808.10530 (2018) - [i29]Xian Wu, Moses Charikar, Vishnu Natchu:
Local Density Estimation in High Dimensions. CoRR abs/1809.07471 (2018) - [i28]Paul Liu, Austin R. Benson, Moses Charikar:
A sampling framework for counting temporal motifs. CoRR abs/1810.00980 (2018) - [i27]Hongyang Zhang, Vatsal Sharan, Moses Charikar, Yingyu Liang:
Recovery Guarantees for Quadratic Tensors with Limited Observations. CoRR abs/1811.00148 (2018) - [i26]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. CoRR abs/1812.10582 (2018) - 2017
- [j29]Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li:
Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond. Proc. VLDB Endow. 10(12): 2021-2024 (2017) - [c96]Itai Ashlagi, Yossi Azar
, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul M. Makhijani, Yuyi Wang, Roger Wattenhofer:
Min-Cost Bipartite Perfect Matching with Delays. APPROX-RANDOM 2017: 1:1-1:20 - [c95]Yuchen Zhang, Percy Liang, Moses Charikar:
A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics. COLT 2017: 1980-2022 - [c94]Moses Charikar, Paris Siminelakis:
Hashing-Based-Estimators for Kernel Density in High Dimensions. FOCS 2017: 1032-1043 - [c93]Moses Charikar, Neha Gupta, Roy Schwartz:
Local Guarantees in Graph Cuts and Clustering. IPCO 2017: 136-147 - [c92]Moses Charikar, Vaggos Chatziafratis:
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics. SODA 2017: 841-854 - [c91]Moses Charikar, Jacob Steinhardt, Gregory Valiant:
Learning from untrusted data. STOC 2017: 47-60 - [i25]Yuchen Zhang, Percy Liang, Moses Charikar:
A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics. CoRR abs/1702.05575 (2017) - [i24]Jacob Steinhardt, Moses Charikar, Gregory Valiant:
Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. CoRR abs/1703.04940 (2017) - [i23]Moses Charikar, Neha Gupta, Roy Schwartz:
Local Guarantees in Graph Cuts and Clustering. CoRR abs/1704.00355 (2017) - [i22]Moses Charikar, Shay Solomon:
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds. CoRR abs/1711.06883 (2017) - 2016
- [c90]Moses Charikar, Yonatan Naamad, Anthony Wirth:
On Approximating Target Set Selection. APPROX-RANDOM 2016: 4:1-4:16 - [c89]Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
Spectral Embedding of k-Cliques, Graph Partitioning and k-Means. ITCS 2016: 301-310 - [c88]Jacob Steinhardt, Gregory Valiant, Moses Charikar:
Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction. NIPS 2016: 4439-4447 - [p1]Moses Charikar:
Top-k Frequent Item Maintenance over Streams. Data Stream Management 2016: 103-119 - [i21]Jacob Steinhardt, Gregory Valiant, Moses Charikar:
Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction. CoRR abs/1606.05374 (2016) - [i20]Moses Charikar, Vaggos Chatziafratis:
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics. CoRR abs/1609.09548 (2016) - [i19]Moses Charikar, Jacob Steinhardt, Gregory Valiant:
Learning from Untrusted Data. CoRR abs/1611.02315 (2016) - 2015
- [c87]Pranjal Awasthi, Moses Charikar, Kevin A. Lai, Andrej Risteski:
Label optimal regret bounds for online local learning. COLT 2015: 150-166 - [c86]Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
The Hardness of Approximation of Euclidean k-Means. Symposium on Computational Geometry 2015: 754-767 - [c85]Moses Samson Charikar:
Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk). FSTTCS 2015: 1 - [c84]Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward:
Relax, No Need to Round: Integrality of Clustering Formulations. ITCS 2015: 191-200 - [i18]Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
The Hardness of Approximation of Euclidean k-means. CoRR abs/1502.03316 (2015) - [i17]Pranjal Awasthi, Moses Charikar, Kevin A. Lai, Andrej Risteski:
Label optimal regret bounds for online local learning. CoRR abs/1503.02193 (2015) - 2014
- [c83]Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan:
Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability. COLT 2014: 742-778 - [c82]Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan:
Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? COLT 2014: 1280-1282 - [c81]Moses Charikar, Monika Henzinger, Huy L. Nguyen:
Online Bipartite Matching with Decomposable Weights. ESA 2014: 260-271 - [c80]Afonso S. Bandeira, Moses Charikar, Amit Singer, Andy Zhu:
Multireference alignment using semidefinite programming. ITCS 2014: 459-470 - [c79]Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li:
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. SODA 2014: 55-71 - [c78]Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan:
Smoothed analysis of tensor decompositions. STOC 2014: 594-603 - [i16]Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward:
Relax, no need to round: integrality of clustering formulations. CoRR abs/1408.4045 (2014) - [i15]Moses Charikar, Monika Henzinger, Huy L. Nguyen:
Online Bipartite Matching with Decomposable Weights. CoRR abs/1409.2139 (2014) - 2013
- [i14]Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan:
Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability. CoRR abs/1304.8087 (2013) - [i13]Afonso S. Bandeira, Moses Charikar, Amit Singer, Andy Zhu:
Multireference Alignment using Semidefinite Programming. CoRR abs/1308.5256 (2013) - [i12]Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan:
Smoothed Analysis of Tensor Decompositions. CoRR abs/1311.3651 (2013) - 2012
- [c77]Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan:
On Quadratic Programming with a Ratio Objective. ICALP (1) 2012: 109-120 - [c76]Moses Charikar, Shi Li:
A Dependent LP-Rounding Approach for the k-Median Problem. ICALP (1) 2012: 194-205 - [c75]Wei Dong, Zhe Wang, Moses Charikar, Kai Li:
High-confidence near-duplicate image detection. ICMR 2012: 1 - [c74]Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou:
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. SODA 2012: 388-405 - 2011
- [j28]Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems. Algorithmica 61(1): 190-206 (2011) - [j27]Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar:
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. SIAM J. Comput. 40(3): 878-914 (2011) - [j26]Nir Ailon, Moses Charikar:
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny. SIAM J. Comput. 40(5): 1275-1291 (2011) - [c73]Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen:
Near Linear Lower Bound for Dimension Reduction in L1. FOCS 2011: 315-323 - [c72]Moses Charikar, Alantha Newman, Aleksandar Nikolov:
Tight Hardness Results for Minimizing Discrepancy. SODA 2011: 1607-1614 - [c71]Wei Dong, Moses Charikar, Kai Li:
Efficient k-nearest neighbor graph construction for generic similarity measures. WWW 2011: 577-586 - [i11]Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan:
On Quadratic Programming with a Ratio Objective. CoRR abs/1101.1710 (2011) - [i10]Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, Yuan Zhou:
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. CoRR abs/1110.1360 (2011) - [i9]Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar:
Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. Electron. Colloquium Comput. Complex. 18: 27 (2011) - 2010
- [j25]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 Spreading Metrics for Vertex Ordering Problems. Algorithmica 56(4): 577-604 (2010) - [j24]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. SIAM J. Comput. 39(6): 2487-2512 (2010) - [c70]Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra:
Vertex Sparsifiers and Abstract Rounding Algorithms. FOCS 2010: 265-274 - [c69]Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan:
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. STOC 2010: 201-210 - [e2]Moses Charikar:
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. SIAM 2010, ISBN 978-0-89871-701-3 [contents] - [i8]Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan:
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph. CoRR abs/1001.2891 (2010) - [i7]Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer:
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010) - [i6]Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra:
Vertex Sparsifiers and Abstract Rounding Algorithms. CoRR abs/1006.4536 (2010)
2000 – 2009
- 2009
- [j23]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems. ACM Trans. Algorithms 5(3): 32:1-32:14 (2009) - [c68]Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran:
Every Permutation CSP of arity 3 is Approximation Resistant. Computational Complexity Conference 2009: 62-73 - [c67]Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems. ESA 2009: 23-34 - [c66]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Integrality gaps for Sherali-Adams relaxations. STOC 2009: 283-292 - [c65]MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami:
MaxMin allocation via degree lower-bounded arborescences. STOC 2009: 543-552 - 2008
- [j22]Nir Ailon, Moses Charikar, Alantha Newman:
Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5): 23:1-23:27 (2008) - [c64]Wei Dong, Zhe Wang, William Josephson, Moses Charikar, Kai Li:
Modeling LSH for performance tuning. CIKM 2008: 669-678 - [c63]Wei Dong, Zhe Wang, Moses Charikar, Kai Li:
Efficiently matching sets of features with random histograms. ACM Multimedia 2008: 179-188 - [c62]Wei Dong, Moses Charikar, Kai Li:
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. SIGIR 2008: 123-130 - [c61]Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks:
Online multicast with egalitarian cost sharing. SPAA 2008: 70-76 - 2007
- [c60]Zhe Wang, William K. Josephson, Qin Lv, Moses Charikar, Kai Li:
Filtering Image Spam with Near-Duplicate Detection. CEAS 2007 - [c59]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph. FOCS 2007: 625-633 - [c58]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. FOCS 2007: 713-723 - [c57]Zhe Wang, Wei Dong, William Josephson, Qin Lv, Moses Charikar, Kai Li:
Sizing sketches: a rank-based analysis for similarity search. SIGMETRICS 2007: 157-168 - [c56]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems. SODA 2007: 62-68 - [c55]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
A divide and conquer algorithm for d-dimensional arrangement. SODA 2007: 541-546 - [c54]Amit Agarwal, Noga Alon, Moses Charikar:
Improved approximation for directed cut problems. STOC 2007: 671-680 - [c53]Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li:
Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search . VLDB 2007: 950-961 - [e1]Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings. Lecture Notes in Computer Science 4627, Springer 2007, ISBN 978-3-540-74207-4 [contents] - [i5]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph. Electron. Colloquium Comput. Complex. 14(104) (2007) - [i4]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings. Electron. Colloquium Comput. Complex. 14(108) (2007) - 2006
- [j21]Moses Charikar:
Guest editor's foreword. J. Comput. Syst. Sci. 72(5): 785 (2006) - [j20]Moses Charikar, Michel X. Goemans, Howard J. Karloff:
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 31(2): 245-252 (2006) - [j19]Moses Charikar, Robert Krauthgamer:
Embedding the Ulam metric into l1. Theory Comput. 2(11): 207-224 (2006) - [c52]Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li:
Ferret: a toolkit for content-based similarity search of feature-rich data. EuroSys 2006: 317-330 - [c51]Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li:
Efficient filtering with sketches in the ferret toolkit. Multimedia Information Retrieval 2006: 279-288 - [c50]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Directed metrics and directed graph partitioning problems. SODA 2006: 51-60 - [c49]Moses Charikar, Samir Khuller:
A robust maximum completion time measure for scheduling. SODA 2006: 324-333 - [c48]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027 - [c47]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for unique games. STOC 2006: 205-214 - [i3]Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Approximation Algorithm for the Max k-CSP Problem. Electron. Colloquium Comput. Complex. 13(063) (2006) - [i2]