Moses Charikar

18.9k citations

136 papers · 9.3k indexed · 6 hit papers · h-index 42

Impact in

Signal Processing top 0.2%
- Data Management and Algorithms
Computer Networks and Communications top 0.2%
- Optimization and Search Problems
- Caching and Content Delivery

Papers in

Computer Graphics and Computer-Aided Design 23
- Computational Geometry and Mesh Generation 23
Computational Theory and Mathematics 68
- Complexity and Algorithms in Graphs 59
- Advanced Graph Theory Research 35

Co-authors: Martı́n Farach-Colton Kevin Chen Sudipto Guha Andrei Broder Michael Mitzenmacher Alan Frieze Chandra ChekuriWei Dong
Journals: SIAM Journal on Computing (6 papers)Journal of Computer and System Sciences (5 papers)Journal of the ACM (3 papers)Algorithmica (2 papers)Theoretical Computer Science (2 papers)
Partner nations: United States Israel Germany

In The Last Decade

Moses Charikar

131 papers receiving 8.7k citations

Hit Papers

6 papers align trajectories log scale

Efficient k-nearest neighbor graph construction for generic similarity measures 2011 · 350 citations

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if any of the following hold:

it has ≥500 total citations;
it reaches ≥1.5× the top-1% citation threshold for papers in the same subfield and year (the threshold is the minimum needed to enter the top 1%, not the average within it);
it reaches the top citation threshold in at least one of its specific research topics.

2011 Efficient k-nearest neighbor graph construction for generic similarity measures
2007 Very Large Data Bases
2003 Theoretical Computer Science
2002 Similarity estimation techniques from rounding algorithms
2002 Similarity estimation techniques from rounding algorithms
2000 Journal of Computer and System Sciences

Peers

Countries citing papers authored by Moses Charikar

Since Specialization

Citations

This map shows the geographic impact of Moses Charikar's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Moses Charikar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Moses Charikar more than expected).

Fields of papers citing papers by Moses Charikar

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Moses Charikar. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Moses Charikar. The network helps show where Moses Charikar may publish in the future.

Co-authorship network

The 25 scholars most cited alongside Moses Charikar, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Moses Charikar Line = papers co-authored together Moses Charikar links everyone, so they are left out of the graph.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work
1	Six Candidates Suffice to Win a Voter Majority TU/e Research Portal ·Moses Charikar, William A. Tinsley, Puneet Asthana, Adrian Vetta, Dazhong Yuan	2025	0
2	Hierarchical clustering better than average-linkage arXiv (Cornell University) ·Moses Charikar, M Y DABNEY, Rad Niazadeh	2019	8
3	Label optimal regret bounds for online local learning Conference on Learning Theory ·Pranjal Awasthi, Moses Charikar, Viktoriya Lisyana, Andrej Risteski	2015	1
4	Better algorithms and hardness for broadcast scheduling via a discrepancy approach Symposium on Discrete Algorithms ·Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li	2014	11
5	Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? Conference on Learning Theory ·Aditya Bhaskara, Moses Charikar, Ankur Moitra, Aravindan Vijayaraghavan	2014	1
6	Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph Symposium on Discrete Algorithms ·Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou	2012	34
7	Modeling LSH for performance tuning Wei Dong, Zhe Wang, William Josephson, Moses Charikar, Kai Li	2008	81
8	Near-optimal algorithms for maximum constraint satisfaction problems Symposium on Discrete Algorithms ·Moses Charikar, Konstantin Makarychev, Yury Makarychev	2007	17
9	Filtering Image Spam with Near-Duplicate Detection. Zhe Wang, William Josephson, Qin Lv, Moses Charikar, Kai Li	2007	74
10	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 DIAL (Catholic University of Leuven) ·Moses Charikar	2007	1
11	A divide and conquer algorithm for d-dimensional arrangement Symposium on Discrete Algorithms ·Moses Charikar, Konstantin Makarychev, Yury Makarychev	2007	5
12	Multi-probe LSH: efficient indexing for high-dimensional similarity search Very Large Data Bases ·Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li Hit paper breakdown →	2007	422
13	Directed metrics and directed graph partitioning problems Symposium on Discrete Algorithms ·Moses Charikar, Konstantin Makarychev, Yury Makarychev	2006	12
14	Theory of Computing ·Moses Charikar, Robert Krauthgamer	2006	16
15	A tight threshold for metric Ramsey phenomena Symposium on Discrete Algorithms ·Moses Charikar, Muftiratul Jannah	2005	2
16	The Finite Capacity Dial-A-Ride Problem Moses Charikar, Balaji Raghavachari	2001	1
17	On-Line Load Balancing for Related Machines Electronic colloquium on computational complexity ·Piotr Berman, Moses Charikar, Marek Karpiński	2000	1
18	Approximation algorithms for directed Steiner problems Symposium on Discrete Algorithms ·Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li	1998	85
19	The dynamic servers problem Symposium on Discrete Algorithms ·Moses Charikar, Dan Halperin, Rajeev Motwani	1998	10
20	On page migration and other relaxed task systems Symposium on Discrete Algorithms ·Yair Bartal, Moses Charikar, Piotr Indyk	1997	12

About Moses Charikar

Moses Charikar is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computational Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 136 papers that have together received 9.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (59 papers), Advanced Graph Theory Research (35 papers), Optimization and Search Problems (34 papers), Computational Geometry and Mesh Generation (23 papers), Advanced Image and Video Retrieval Techniques (18 papers), Algorithms and Data Compression (17 papers), Data Management and Algorithms (13 papers) and Facility Location and Emergency Management (12 papers). The work is most often cited by research in Signal Processing (1.9k citations), Computer Networks and Communications (3.1k citations), Computer Graphics and Computer-Aided Design (441 citations), Computer Vision and Pattern Recognition (2.6k citations) and Computational Theory and Mathematics (2.0k citations). Moses Charikar has collaborated with scholars based in United States, Israel and Germany. Frequent co-authors include Martı́n Farach-Colton, Kevin Chen, Sudipto Guha, Andrei Broder, Michael Mitzenmacher, Alan Frieze, Chandra Chekuri, Wei Dong, Nir Ailon and Kai Li. Their work appears in journals such as SIAM Journal on Computing, Journal of Computer and System Sciences, Journal of the ACM, Algorithmica and Theoretical Computer Science.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact