Moses Charikar
#47,715
Most Influential Person Now
Indian computer scientist
Moses Charikar's AcademicInfluence.com Rankings
Moses Charikarcomputer-science Degrees
Computer Science
#1709
World Rank
#1770
Historical Rank
Machine Learning
#2205
World Rank
#2233
Historical Rank
Database
#2277
World Rank
#2392
Historical Rank
Download Badge
Computer Science
Moses Charikar's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Moses Charikar Influential?
(Suggest an Edit or Addition)According to Wikipedia, Moses Samson Charikar is an Indian computer scientist who works as a professor at Stanford University. He was previously a professor at Princeton University. The topics of his research include approximation algorithms, streaming algorithms, and metric embeddings. He is known for the creation of the SimHash algorithm used by Google for near duplicate detection.
Moses Charikar's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Similarity estimation techniques from rounding algorithms (2002) (2355)
- Finding frequent items in data streams (2002) (1676)
- Min-Wise Independent Permutations (2000) (895)
- Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search (2007) (822)
- Aggregating inconsistent information: Ranking and clustering (2008) (647)
- Incremental clustering and dynamic information retrieval (1997) (630)
- A Constant-Factor Approximation Algorithm for the k-Median Problem (2002) (585)
- Efficient k-nearest neighbor graph construction for generic similarity measures (2011) (529)
- Approximation algorithms for directed Steiner problems (1999) (519)
- Greedy approximation algorithms for finding dense components in a graph (2000) (481)
- Improved combinatorial algorithms for the facility location and k-median problems (1999) (454)
- Clustering with qualitative information (2003) (439)
- Algorithms for facility location problems with outliers (2001) (404)
- The smallest grammar problem (2005) (372)
- Min-wise independent permutations (extended abstract) (1998) (333)
- Detecting high log-densities: an O(n¼) approximation for densest k-subgraph (2010) (324)
- Better streaming algorithms for clustering problems (2003) (295)
- Towards estimation error guarantees for distinct values (2000) (246)
- Learning from untrusted data (2016) (245)
- A constant-factor approximation algorithm for the k-median problem (extended abstract) (1999) (228)
- Maximizing quadratic programs: extending Grothendieck's inequality (2004) (223)
- A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics (2017) (201)
- Approximating a finite metric by a small number of tree metrics (1998) (195)
- Improved Combinatorial Algorithms for Facility Location Problems (2005) (187)
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (2005) (185)
- Aggregating inconsistent information: ranking and clustering (2005) (179)
- Modeling LSH for performance tuning (2008) (170)
- On the impossibility of dimension reduction in l1 (2003) (169)
- Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median (1998) (156)
- Near-optimal algorithms for unique games (2006) (153)
- The Hardness of Approximation of Euclidean k-Means (2015) (147)
- On the advantage of network coding for improving network throughput (2004) (135)
- Smoothed analysis of tensor decompositions (2013) (133)
- Integrality gaps for Sherali-Adams relaxations (2009) (131)
- Filtering Image Spam with Near-Duplicate Detection (2007) (122)
- Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers (2017) (121)
- Targeted exploration and analysis of large cross-platform human transcriptomic compendia (2015) (118)
- Image similarity search with compact data structures (2004) (117)
- Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces (2008) (111)
- Relax, No Need to Round: Integrality of Clustering Formulations (2014) (109)
- Approximating min-sum k-clustering in metric spaces (2001) (108)
- Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph (2011) (107)
- On-Line Load Balancing for Related Machines (1997) (105)
- Clustering to minimize the sum of cluster diameters (2001) (102)
- Resource optimization in QoS multicast routing of real-time multimedia (2004) (96)
- Multireference alignment using semidefinite programming (2013) (92)
- Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics (2016) (85)
- A Dependent LP-Rounding Approach for the k-Median Problem (2012) (79)
- Near-optimal algorithms for maximum constraint satisfaction problems (2007) (79)
- MaxMin allocation via degree lower-bounded arborescences (2009) (77)
- On page migration and other relaxed task systems (1997) (77)
- Query Strategies for Priced Information (2002) (75)
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (2011) (74)
- Sampling Bounds for Stochastic Optimization (2005) (73)
- Tight hardness results for minimizing discrepancy (2011) (71)
- Approximating the smallest grammar: Kolmogorov complexity in natural models (2002) (68)
- Hashing-Based-Estimators for Kernel Density in High Dimensions (2017) (68)
- Fitting tree metrics: Hierarchical clustering and phylogeny (2005) (64)
- Improved approximation for directed cut problems (2007) (63)
- The finite capacity dial-a-ride problem (1998) (62)
- Ferret: a toolkit for content-based similarity search of feature-rich data (2006) (61)
- Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability (2013) (60)
- Algorithms for capacitated vehicle routing (1998) (60)
- New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (2002) (59)
- On non-uniform multicommodity buy-at-bulk network design (2005) (56)
- Efficiently matching sets of features with random histograms (2008) (55)
- Vertex Sparsifiers and Abstract Rounding Algorithms (2010) (54)
- Online multicast with egalitarian cost sharing (2008) (53)
- Hierarchical Clustering better than Average-Linkage (2018) (53)
- L22 Spreading Metrics for Vertex Ordering Problems (2006) (51)
- On semidefinite programming relaxations for graph coloring and vertex cover (2002) (50)
- Sampling Methods for Counting Temporal Motifs (2019) (49)
- Improved Approximation Algorithms for Label Cover Problems (2011) (49)
- High-confidence near-duplicate image detection (2012) (48)
- Min-Cost Bipartite Perfect Matching with Delays (2017) (46)
- Sizing sketches: a rank-based analysis for similarity search (2007) (42)
- Every Permutation CSP of arity 3 is Approximation Resistant (2009) (41)
- Local Global Tradeoffs in Metric Embeddings (2007) (40)
- On the Integrality Ratio for the Asymmetric Traveling Salesman Problem (2006) (39)
- Hierarchical Clustering with Structural Constraints (2018) (39)
- Embedding the Ulam metric into l1 (2006) (38)
- Combinatorial feature selection problems (2000) (37)
- Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction (2016) (36)
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem (2007) (35)
- Near Linear Lower Bound for Dimension Reduction in L1 (2011) (35)
- Approximating the average response time in broadcast scheduling (2005) (34)
- A derandomization using min-wise independent permutations (1998) (33)
- Hierarchical Clustering for Euclidean Data (2018) (32)
- On the Advantage over Random for Maximum Acyclic Subgraph (2007) (32)
- Efficient profile maximum likelihood for universal symmetric property estimation (2019) (32)
- Directed metrics and directed graph partitioning problems (2006) (31)
- ℓ22 Spreading Metrics for Vertex Ordering Problems (2010) (31)
- Dimension reduction in the /spl lscr//sub 1/ norm (2002) (29)
- Multi-Commodity Flow with In-Network Processing (2018) (29)
- Delayed information and action in on-line algorithms (1998) (28)
- Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach (2014) (25)
- On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings (2018) (23)
- Constrained TSP and Low-Power Computing (1997) (23)
- A robust maximum completion time measure for scheduling (2006) (22)
- Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier (2018) (22)
- Rehashing Kernel Evaluation in High Dimensions (2019) (21)
- Local Guarantees in Graph Cuts and Clustering (2017) (20)
- Query strategies for priced information (extended abstract) (2000) (20)
- Efficient Density Evaluation for Smooth Kernels (2018) (19)
- Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds (2017) (18)
- On targeting Markov segments (1999) (18)
- Approximation Algorithms for Directed Steiner Tree Problems (1998) (18)
- On Approximating Target Set Selection (2016) (18)
- Dimension Reduction in the l 1 norm (2002) (17)
- Resource optimization in QoS multicast routing of real-time multimedia (2000) (16)
- The dynamic servers problem (1998) (16)
- A constant-factor approximation for the k-median problem (1999) (16)
- On the integrality ratio for asymmetric TSP (2004) (15)
- Multiway Online Correlated Selection (2021) (15)
- Kernel Density Estimation through Density Constrained Near Neighbor Search (2020) (14)
- On Finding Dense Common Subgraphs (2018) (14)
- Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond (2017) (14)
- Minimum outage transmission over fading channels with delay constraint (2000) (13)
- Label optimal regret bounds for online local learning (2015) (13)
- Near-Optimal Explainable k-Means for All Dimensions (2021) (12)
- Minimizing wirelength in zero and bounded skew clock trees (2004) (12)
- A divide and conquer algorithm for d-dimensional arrangement (2007) (11)
- Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) (2010) (11)
- The One-Way Communication Complexity of Dynamic Time Warping Distance (2019) (10)
- Approximation algorithms for clustering (2005) (10)
- Efficient filtering with sketches in the ferret toolkit (2006) (10)
- Unconditional Lower Bounds for Adaptive Massively Parallel Computation (2020) (9)
- On the impossibility of dimension reduction in /spl lscr//sub 1/ (2003) (9)
- Local Density Estimation in High Dimensions (2018) (9)
- Online Bipartite Matching with Decomposable Weights (2014) (9)
- Finding dense structures in graphs and matrices (2012) (9)
- Metric Distortion Bounds for Randomized Social Choice (2021) (8)
- On Quadratic Programming with a Ratio Objective (2011) (8)
- A sampling framework for counting temporal motifs (2018) (8)
- A General Framework for Symmetric Property Estimation (2020) (8)
- Multi-resolution Hashing for Fast Pairwise Summations (2018) (7)
- A Simple Sublinear Algorithm for Gap Edit Distance (2020) (7)
- The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood (2020) (7)
- CoopStore: Optimizing Precomputed Summaries for Aggregation (2020) (7)
- A tight threshold for metric Ramsey phenomena (2005) (6)
- Instance Based Approximations to Profile Maximum Likelihood (2020) (6)
- Improved Algorithms for Edge Colouring in the W-Streaming Model (2020) (6)
- Retrieving Top Weighted Triangles in Graphs (2019) (5)
- Almost 3-Approximate Correlation Clustering in Constant Rounds (2022) (5)
- Approximation Algorithm for the Max k-CSP Problem (2006) (5)
- Spectral Embedding of k-Cliques, Graph Partitioning and k-Means (2016) (5)
- Algorithms for clustering problems (2000) (5)
- Recovery Guarantees For Quadratic Tensors With Sparse Observations (2019) (4)
- New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation (2009) (4)
- Approximation Algorithms for Orthogonal Non-negative Matrix Factorization (2021) (4)
- The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction (2022) (3)
- Beyond worst-case analysis in approximation algorithms (2012) (3)
- A Time-Space Efficient Locality Sensitive Hashing Method for Similarity Search in High Dimensions (2006) (3)
- 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 (2007) (3)
- Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? (2014) (3)
- Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity (2021) (2)
- A Characterization of List Learnability (2022) (2)
- Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques (2007) (2)
- A primal-dual clustering technique with applications in network design (2011) (2)
- Approximation algorithms for network routing and facility location problems (2014) (2)
- Note on MAX 2SAT (2006) (2)
- Recovery Guarantees for Quadratic Tensors with Limited Observations (2018) (2)
- Online Clustering of Linguistic Data (2004) (2)
- Single-Pass Streaming Algorithms for Correlation Clustering (2023) (2)
- Institutions Share Successes, Failures, and Advice in Moving the Diversity Needle (2020) (2)
- Nearest Neighbor Search for Hyperbolic Embeddings (2020) (2)
- A Model for Ant Trail Formation and its Convergence Properties (2020) (1)
- What you find depends on how you look: Category selectivity in frontal cortex revealed by whole-brain correlation analysis (2013) (1)
- Polylogarithmic Sketches for Clustering (2022) (1)
- Analysis of Filtering for Similarity Search using Sketches (2006) (1)
- Spreading Metrics For Vertex Ordering Problems ( Extended Abstract ) (2005) (1)
- Distributed algorithms from arboreal ants for the shortest path problem (2023) (1)
- On the Complexity of Sampling Redistricting Plans (2022) (1)
- Limits on Approximation Lecture 12 : Directed EDP with Congestion Lecturer : (0)
- COS 340: Reasoning About Computation∗ Hashing (2011) (0)
- A Derandomization Using Min-Wise Independent Permutations Extended abstract for submission to Random ’ 98 not for distribution (1998) (0)
- Advanced Algorithm Design : Semidefinite Programming ( SDP ) (2013) (0)
- COS 340 : Reasoning About Computation ∗ Game Theory and Linear Programming (2014) (0)
- On the Efficient Implementation of High Accuracy Optimality of Profile Maximum Likelihood (2022) (0)
- COS 493 : Algorithms on Massive Data Sets 04 / 25 / 02 Lecture 22 Professor (0)
- Metric space embeddings into l(1): an optimization approach (2004) (0)
- Advanced Algorithm Design : Hashing and Applications to Compact Data Representation Lectured by Prof (2013) (0)
- ALGORITHMS FOR CAPACITATED VEHICLEROUTING (0)
- Lecture 3: Constructive Bounds on Discrepancy (2010) (0)
- New lower bounds for Massively Parallel Computation from query complexity (2020) (0)
- Arboreal Ants Suggest Surprising Algorithms for the Shortest Path Problem and its Variants (2020) (0)
- STOC 2013: Call for Workshop and Tutorial Proposals Workshop and Tutorial Day: Saturday, June 1, 2013 (2013) (0)
- Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 (2010) (0)
- Advanced Algorithm Design : Load Balancing Lectured by Prof (2013) (0)
- Local Density Estimation in High Dimensions Supplementary Materials (0)
- CAREER: Approximation Algorithms – New Directions and Techniques (2008) (0)
- Top-k Frequent Item Maintenance over Streams (2016) (0)
- General Sum-of-Squares and Tensor Decomposition (2017) (0)
- Supplementary material for : Rehashing Kernel Evaluation in High Dimensions (2019) (0)
- COS 521 : Advanced Algorithms ∗ Game Theory and Linear Programming (2013) (0)
- COS 340 : Reasoning About Computation ∗ Online Algorithms 2 (0)
- Compact Data Representations and their Applications (2004) (0)
- Storyboard: Optimizing Precomputed Summaries for Aggregation (2020) (0)
- Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk) (2015) (0)
- Adaptive Discrete Phase Retrieval (2020) (0)
- CoopStore (2020) (0)
- COS 340 : Reasoning About Computation ∗ Sketching (2011) (0)
- Algorithmic Techniques for Massive Data Sets (2006) (0)
This paper list is powered by the following services:
Other Resources About Moses Charikar
What Schools Are Affiliated With Moses Charikar?
Moses Charikar is affiliated with the following schools:
