|
Search the dblp DataBase
Moses Charikar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Moses Charikar, Sudipto Guha
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. [Citation Graph (1, 0)][DBLP] FOCS, 1999, pp:378-388 [Conf]
- Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
Min-Wise Independent Permutations (Extended Abstract). [Citation Graph (1, 0)][DBLP] STOC, 1998, pp:327-336 [Conf]
- Moses Charikar
Greedy approximation algorithms for finding dense components in a graph. [Citation Graph (0, 0)][DBLP] APPROX, 2000, pp:84-95 [Conf]
- Moses Charikar, Chandra Chekuri, Martin Pál
Sampling Bounds for Stochastic Optimization. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:257-269 [Conf]
- Qin Lv, Moses Charikar, Kai Li
Image similarity search with compact data structures. [Citation Graph (0, 0)][DBLP] CIKM, 2004, pp:208-217 [Conf]
- Susanne Albers, Moses Charikar, Michael Mitzenmacher
Delayed Information and Action in On-line Algorithms. [Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:71-81 [Conf]
- Nir Ailon, Moses Charikar
Fitting tree metrics: Hierarchical clustering and Phylogeny. [Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:73-82 [Conf]
- Bo Brinkman, Moses Charikar
On the Impossibility of Dimension Reduction in l1. [Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:514-523 [Conf]
- Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin
Approximating a Finite Metric by a Small Number of Tree Metrics. [Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:379-388 [Conf]
- Moses Charikar, Michel X. Goemans, Howard J. Karloff
On the Integrality Ratio for Asymmetric TSP. [Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:101-107 [Conf]
- Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
Combinatorial feature selection problems. [Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:631-640 [Conf]
- Moses Charikar, Venkatesan Guruswami, Anthony Wirth
Clustering with Qualitative Information. [Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:524-533 [Conf]
- Moses Charikar, Balaji Raghavachari
The Finite Capacity Dial-A-Ride Problem. [Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:458-467 [Conf]
- Moses Charikar, Amit Sahai
Dimension Reduction in the \ell _1 Norm. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:551-560 [Conf]
- Moses Charikar, Anthony Wirth
Maximizing Quadratic Programs: Extending Grothendieck's Inequality. [Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:54-60 [Conf]
- Moses Charikar, Kevin Chen, Martin Farach-Colton
Finding Frequent Items in Data Streams. [Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:693-703 [Conf]
- Moses Charikar, Piotr Indyk, Rina Panigrahy
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. [Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:451-462 [Conf]
- Rohit Negi, Moses Charikar, John M. Cioffi
Minimum Outage Transmission over Fading Channels with Delay Constraint. [Citation Graph (0, 0)][DBLP] ICC (1), 2000, pp:282-286 [Conf]
- Moses Charikar, Joseph Naor, Baruch Schieber
Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. [Citation Graph (0, 0)][DBLP] INFOCOM, 2000, pp:1518-1527 [Conf]
- Moses Charikar, Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasayya
Towards Estimation Error Guarantees for Distinct Values. [Citation Graph (0, 15)][DBLP] PODS, 2000, pp:268-279 [Conf]
- Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
A Derandomization Using Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP] RANDOM, 1998, pp:15-24 [Conf]
- Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor
Approximating the average response time in broadcast scheduling. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:215-221 [Conf]
- Yair Bartal, Moses Charikar, Piotr Indyk
On Page Migration and Other Related Task Systems. [Citation Graph (0, 0)][DBLP] SODA, 1997, pp:43-52 [Conf]
- Moses Charikar
On semidefinite programming relaxations for graph coloring and vertex cover. [Citation Graph (0, 0)][DBLP] SODA, 2002, pp:616-620 [Conf]
- Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP] SODA, 1998, pp:192-200 [Conf]
- Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao
l22 spreading metrics for vertex ordering problems. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1018-1027 [Conf]
- Moses Charikar, Dan Halperin, Rajeev Motwani
The Dynamic Servers Problem. [Citation Graph (0, 0)][DBLP] SODA, 1998, pp:410-419 [Conf]
- Moses Charikar, Adriana Karagiozova
A tight threshold for metric Ramsey phenomena. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:129-136 [Conf]
- Moses Charikar, Samir Khuller
A robust maximum completion time measure for scheduling. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:324-333 [Conf]
- Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins
Minimizing Wirelength in Zero and Bounded Skew Clock Trees. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:177-184 [Conf]
- Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan
Algorithms for facility location problems with outliers. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:642-651 [Conf]
- Moses Charikar, Konstantin Makarychev, Yury Makarychev
Directed metrics and directed graph partitioning problems. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:51-60 [Conf]
- Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:573-581 [Conf]
- Nir Ailon, Moses Charikar, Alantha Newman
Aggregating inconsistent information: ranking and clustering. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:684-693 [Conf]
- Yair Bartal, Moses Charikar, Danny Raz
Approximating min-sum k-clustering in metric spaces. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:11-20 [Conf]
- Moses Charikar
Similarity estimation techniques from rounding algorithms. [Citation Graph (0, 0)][DBLP] STOC, 2002, pp:380-388 [Conf]
- Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
Incremental Clustering and Dynamic Information Retrieval. [Citation Graph (0, 0)][DBLP] STOC, 1997, pp:626-635 [Conf]
- Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median. [Citation Graph (0, 0)][DBLP] STOC, 1998, pp:114-123 [Conf]
- Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
Query strategies for priced information (extended abstract). [Citation Graph (0, 0)][DBLP] STOC, 2000, pp:582-591 [Conf]
- Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP] STOC, 1999, pp:1-10 [Conf]
- Moses Charikar, Adriana Karagiozova
On non-uniform multicommodity buy-at-bulk network design. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:176-182 [Conf]
- Moses Charikar, Samir Khuller, Balaji Raghavachari
Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP] STOC, 1998, pp:349-358 [Conf]
- Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
On targeting Markov segments. [Citation Graph (0, 0)][DBLP] STOC, 1999, pp:99-108 [Conf]
- Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat
Approximating the smallest grammar: Kolmogorov complexity in natural models. [Citation Graph (0, 0)][DBLP] STOC, 2002, pp:792-801 [Conf]
- Moses Charikar, Konstantin Makarychev, Yury Makarychev
Near-optimal algorithms for unique games. [Citation Graph (0, 0)][DBLP] STOC, 2006, pp:205-214 [Conf]
- Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
Better streaming algorithms for clustering problems. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:30-39 [Conf]
- Moses Charikar, Rina Panigrahy
Clustering to minimize the sum of cluster diameters. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:1-10 [Conf]
- Piotr Berman, Moses Charikar, Marek Karpinski
On-line Load Balancing for Related Machines. [Citation Graph (0, 0)][DBLP] WADS, 1997, pp:116-125 [Conf]
- Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein
Constrained TSP and Low-Power Computing. [Citation Graph (0, 0)][DBLP] WADS, 1997, pp:104-115 [Conf]
- Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li
Ferret: a toolkit for content-based similarity search of feature-rich data. [Citation Graph (0, 0)][DBLP] EuroSys, 2006, pp:317-330 [Conf]
- Piotr Berman, Moses Charikar, Marek Karpinski
On-Line Load Balancing for Related Machines [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:1, pp:- [Journal]
- Susanne Albers, Moses Charikar, Michael Mitzenmacher
Delayed Information and Action in On-Line Algorithms. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:170, n:2, pp:135-152 [Journal]
- Bo Brinkman, Moses Charikar
On the impossibility of dimension reduction in l1. [Citation Graph (0, 0)][DBLP] J. ACM, 2005, v:52, n:5, pp:766-788 [Journal]
- Piotr Berman, Moses Charikar, Marek Karpinski
On-Line Load Balancing for Related Machines. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:35, n:1, pp:108-121 [Journal]
- Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:73-91 [Journal]
- Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher
Min-Wise Independent Permutations. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:3, pp:630-659 [Journal]
- Moses Charikar
Guest editor's foreword. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:5, pp:785- [Journal]
- Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
Query Strategies for Priced Information. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:64, n:4, pp:785-819 [Journal]
- Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
A Constant-Factor Approximation Algorithm for the k-Median Problem. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:1, pp:129-149 [Journal]
- Moses Charikar, Venkatesan Guruswami, Anthony Wirth
Clustering with qualitative information. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:3, pp:360-383 [Journal]
- Moses Charikar, Rina Panigrahy
Clustering to minimize the sum of cluster diameters. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:2, pp:417-441 [Journal]
- Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
A derandomization using min-wise independent permutations. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2003, v:1, n:1, pp:11-20 [Journal]
- Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
Incremental Clustering and Dynamic Information Retrieval. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:6, pp:1417-1440 [Journal]
- Moses Charikar, Sudipto Guha
Improved Combinatorial Algorithms for Facility Location Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:803-824 [Journal]
- Moses Charikar, Samir Khuller, Balaji Raghavachari
Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:3, pp:665-682 [Journal]
- Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins
Minimizing Wirelength in Zero and Bounded Skew Clock Trees. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:17, n:4, pp:582-595 [Journal]
- Yair Bartal, Moses Charikar, Piotr Indyk
On page migration and other relaxed task systems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:268, n:1, pp:43-66 [Journal]
- Moses Charikar, Kevin Chen, Martin Farach-Colton
Finding frequent items in data streams. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:312, n:1, pp:3-15 [Journal]
- Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat
The smallest grammar problem. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2554-2576 [Journal]
- Moses Charikar, Joseph Naor, Baruch Schieber
Resource optimization in QoS multicast routing of real-time multimedia. [Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2004, v:12, n:2, pp:340-348 [Journal]
- Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li
Efficient filtering with sketches in the ferret toolkit. [Citation Graph (0, 0)][DBLP] Multimedia Information Retrieval, 2006, pp:279-288 [Conf]
- Zhe Wang, Wei Dong, William Josephson, Qin Lv, Moses Charikar, Kai Li
Sizing sketches: a rank-based analysis for similarity search. [Citation Graph (0, 0)][DBLP] SIGMETRICS, 2007, pp:157-168 [Conf]
- Moses Charikar, Konstantin Makarychev, Yury Makarychev
Near-optimal algorithms for maximum constraint satisfaction problems. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:62-68 [Conf]
- Moses Charikar, Konstantin Makarychev, Yury Makarychev
A divide and conquer algorithm for d-dimensional arrangement. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:541-546 [Conf]
- Amit Agarwal, Noga Alon, Moses Charikar
Improved approximation for directed cut problems. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:671-680 [Conf]
- Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li
Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search . [Citation Graph (0, 0)][DBLP] VLDB, 2007, pp:950-961 [Conf]
Filtering Image Spam with Near-Duplicate Detection. [Citation Graph (, )][DBLP]
Modeling LSH for performance tuning. [Citation Graph (, )][DBLP]
Every Permutation CSP of arity 3 is Approximation Resistant. [Citation Graph (, )][DBLP]
Improved Approximation Algorithms for Label Cover Problems. [Citation Graph (, )][DBLP]
Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP]
On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]
Efficiently matching sets of features with random histograms. [Citation Graph (, )][DBLP]
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. [Citation Graph (, )][DBLP]
Online multicast with egalitarian cost sharing. [Citation Graph (, )][DBLP]
Integrality gaps for Sherali-Adams relaxations. [Citation Graph (, )][DBLP]
MaxMin allocation via degree lower-bounded arborescences. [Citation Graph (, )][DBLP]
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. [Citation Graph (, )][DBLP]
l22 Spreading Metrics for Vertex Ordering Problems. [Citation Graph (, )][DBLP]
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph [Citation Graph (, )][DBLP]
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [Citation Graph (, )][DBLP]
Vertex Sparsifiers and Abstract Rounding Algorithms [Citation Graph (, )][DBLP]
Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP]
On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]
Approximation Algorithm for the Max k-CSP Problem. [Citation Graph (, )][DBLP]
Note on MAX 2SAT. [Citation Graph (, )][DBLP]
Search in 0.044secs, Finished in 0.051secs
|