Moses Charikar - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Tight Hardness Results for Minimizing DiscrepancyMoses Charikar, Alantha Newman, Aleksandar Nikolov. soda 2011: 1607-1614 [doi]

Improved Approximation Algorithms for Label Cover ProblemsMoses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff. algorithmica, 61(1):190-206, 2011. [doi]

Efficient k-nearest neighbor graph construction for generic similarity measuresWei Dong, Moses Charikar, Kai Li. WWW 2011: 577-586 [doi]

Beating the Random Ordering is Hard: Every ordering CSP is approximation resistantVenkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar. eccc, 18:27, 2011. [doi]

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation ResistantVenkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar. siamcomp, 40(3):878-914, 2011. [doi]

2010

Detecting high log-densities: an ::::O::::(::::n:::::::1/4:::) approximation for densest ::::k::::-subgraphAditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan. stoc 2010: 201-210 [doi]

::::::::l::::::::::2:::::2::: Spreading Metrics for Vertex Ordering ProblemsMoses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. algorithmica, 56(4):577-604, 2010. [doi]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010Moses Charikar, editor, SIAM, 2010.

Local Global Tradeoffs in Metric EmbeddingsMoses Charikar, Konstantin Makarychev, Yury Makarychev. siamcomp, 39(6):2487-2512, 2010. [doi]

Vertex Sparsifiers and Abstract Rounding AlgorithmsMoses Charikar, Tom Leighton, Shi Li, Ankur Moitra. focs 2010: 265-274 [doi]

2009

2008

2007

Improved approximation for directed cut problemsAmit Agarwal, Noga Alon, Moses Charikar. stoc 2007: 671-680 [doi]

Local Global Tradeoffs in Metric EmbeddingsMoses Charikar, Konstantin Makarychev, Yury Makarychev. eccc, 14(108), 2007. [doi]

On the Advantage over Random for Maximum Acyclic SubgraphMoses Charikar, Konstantin Makarychev, Yury Makarychev. eccc, 14(104), 2007. [doi]

Local Global Tradeoffs in Metric EmbeddingsMoses Charikar, Konstantin Makarychev, Yury Makarychev. focs 2007: 713-723 [doi]

On the Advantage over Random for Maximum Acyclic SubgraphMoses Charikar, Konstantin Makarychev, Yury Makarychev. focs 2007: 625-633 [doi]

A divide and conquer algorithm for ::::d::::-dimensional arrangementMoses Charikar, Konstantin Makarychev, Yury Makarychev. soda 2007: 541-546 [doi]

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, ProceedingsMoses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim, editors, Volume 4627 of Lecture Notes in Computer Science, Springer, 2007.

Near-optimal algorithms for maximum constraint satisfaction problemsMoses Charikar, Konstantin Makarychev, Yury Makarychev. soda 2007: 62-68 [doi]

Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li. VLDB 2007: 950-961 [doi]

Filtering Image Spam with Near-Duplicate DetectionZhe Wang, William K. Josephson, Qin Lv, Moses Charikar, Kai Li. ceas 2007: [doi]

Sizing sketches: a rank-based analysis for similarity searchZhe Wang, Wei Dong, William Josephson, Qin Lv, Moses Charikar, Kai Li. sigmetrics 2007: 157-168 [doi]

2006

Near-optimal algorithms for unique gamesMoses Charikar, Konstantin Makarychev, Yury Makarychev. stoc 2006: 205-214 [doi]

::::l:::::::2:::::2:: spreading metrics for vertex ordering problemsMoses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. soda 2006: 1018-1027 [doi]

Embedding the Ulam metric into ::::l::::::1::Moses Charikar, Robert Krauthgamer. toc, 2(1):207-224, 2006. [doi]

A robust maximum completion time measure for schedulingMoses Charikar, Samir Khuller. soda 2006: 324-333 [doi]

Approximation Algorithm for the Max k-CSP ProblemMoses Charikar, Konstantin Makarychev, Yury Makarychev. eccc, 13(063), 2006. [doi]

Note on MAX 2SATMoses Charikar, Konstantin Makarychev, Yury Makarychev. eccc, 13(064), 2006. [doi]

Guest editor s forewordMoses Charikar. jcss, 72(5):785, 2006. [doi]

On the Integrality Ratio for the Asymmetric Traveling Salesman ProblemMoses Charikar, Michel X. Goemans, Howard J. Karloff. mor, 31(2):245-252, 2006. [doi]

Directed metrics and directed graph partitioning problemsMoses Charikar, Konstantin Makarychev, Yury Makarychev. soda 2006: 51-60 [doi]

Efficient filtering with sketches in the ferret toolkitQin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li. ismir 2006: 279-288 [doi]

Ferret: a toolkit for content-based similarity search of feature-rich dataQin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li. eurosys 2006: 317-330 [doi]

2005

O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problemsAmit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev. stoc 2005: 573-581 [doi]

Fitting tree metrics: Hierarchical clustering and PhylogenyNir Ailon, Moses Charikar. focs 2005: 73-82 [doi]

Aggregating inconsistent information: ranking and clusteringNir Ailon, Moses Charikar, Alantha Newman. stoc 2005: 684-693 [doi]

Approximating the average response time in broadcast schedulingNikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor. soda 2005: 215-221 [doi]

On the impossibility of dimension reduction in l::1::Bo Brinkman, Moses Charikar. JACM, 52(5):766-788, 2005. [doi]

Improved Combinatorial Algorithms for Facility Location ProblemsMoses Charikar, Sudipto Guha. siamcomp, 34(4):803-824, 2005. [doi]

Clustering with qualitative informationMoses Charikar, Venkatesan Guruswami, Anthony Wirth. jcss, 71(3):360-383, 2005. [doi]

A tight threshold for metric Ramsey phenomenaMoses Charikar, Adriana Karagiozova. soda 2005: 129-136 [doi]

Sampling Bounds for Stochastic OptimizationMoses Charikar, Chandra Chekuri, Martin Pál. approx 2005: 257-269 [doi]

The smallest grammar problemMoses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat. TIT, 51(7):2554-2576, 2005. [doi]

On non-uniform multicommodity buy-at-bulk network designMoses Charikar, Adriana Karagiozova. stoc 2005: 176-182 [doi]

2004

Minimizing Wirelength in Zero and Bounded Skew Clock TreesMoses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins. siamdm, 17(4):582-595, 2004. [doi]

Maximizing Quadratic Programs: Extending Grothendieck s InequalityMoses Charikar, Anthony Wirth. focs 2004: 54-60 [doi]

On the Integrality Ratio for Asymmetric TSPMoses Charikar, Michel X. Goemans, Howard J. Karloff. focs 2004: 101-107 [doi]

Clustering to minimize the sum of cluster diametersMoses Charikar, Rina Panigrahy. jcss, 68(2):417-441, 2004. [doi]

Resource optimization in QoS multicast routing of real-time multimediaMoses Charikar, Joseph Naor, Baruch Schieber. ton, 12(2):340-348, 2004. [doi]

Incremental Clustering and Dynamic Information RetrievalMoses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani. siamcomp, 33(6):1417-1440, 2004. [doi]

Finding frequent items in data streamsMoses Charikar, Kevin Chen, Martin Farach-Colton. TCS, 312(1):3-15, 2004. [doi]

Image similarity search with compact data structuresQin Lv, Moses Charikar, Kai Li. CIKM 2004: 208-217 [doi]

2003

2002

New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related ProblemsMoses Charikar, Piotr Indyk, Rina Panigrahy. icalp 2002: 451-462 [doi]

A Constant-Factor Approximation Algorithm for the k-Median ProblemMoses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys. jcss, 65(1):129-149, 2002. [doi]

Query Strategies for Priced InformationMoses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai. jcss, 64(4):785-819, 2002. [doi]

Dimension Reduction in the /ell _1 NormMoses Charikar, Amit Sahai. focs 2002: 551-560 [doi]

Similarity estimation techniques from rounding algorithmsMoses Charikar. stoc 2002: 380-388 [doi]

Approximating the smallest grammar: Kolmogorov complexity in natural modelsMoses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat. stoc 2002: 792-801 [doi]

On semidefinite programming relaxations for graph coloring and vertex coverMoses Charikar. soda 2002: 616-620 [doi]

Finding Frequent Items in Data StreamsMoses Charikar, Kevin Chen, Martin Farach-Colton. icalp 2002: 693-703 [doi]

2001

2000

On-Line Load Balancing for Related MachinesPiotr Berman, Moses Charikar, Marek Karpinski. jal, 35(1):108-121, 2000.

On-Line Load Balancing for Related MachinesPiotr Berman, Moses Charikar, Marek Karpinski. eccc, 7(1), 2000. [doi]

Min-Wise Independent PermutationsAndrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher. jcss, 60(3):630-659, 2000.

Towards Estimation Error Guarantees for Distinct ValuesMoses Charikar, Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasayya. pods 2000: 268-279 [doi]

Combinatorial feature selection problemsMoses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai. focs 2000: 631-640

Query strategies for priced information (extended abstract)Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai. stoc 2000: 582-591 [doi]

Resource Optimization in QoS Multicast Routing of Real-Time MultimediaMoses Charikar, Joseph Naor, Baruch Schieber. infocom 2000: 1518-1527 [doi]

Greedy approximation algorithms for finding dense components in a graphMoses Charikar. approx 2000: 84-95 [doi]

Minimum Outage Transmission over Fading Channels with Delay ConstraintRohit Negi, Moses Charikar, John M. Cioffi. icc 2000: 282-286

1999

1998

Delayed Information and Action in On-line AlgorithmsSusanne Albers, Moses Charikar, Michael Mitzenmacher. focs 1998: 71-81 [doi]

A Derandomization Using Min-Wise Independent PermutationsAndrei Z. Broder, Moses Charikar, Michael Mitzenmacher. random 1998: 15-24 [doi]

Min-Wise Independent Permutations (Extended Abstract)Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher. stoc 1998: 327-336 [doi]

Approximating a Finite Metric by a Small Number of Tree MetricsMoses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin. focs 1998: 379-388 [doi]

Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and ::::k::::-MedianMoses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha. stoc 1998: 114-123 [doi]

The Dynamic Servers ProblemMoses Charikar, Dan Halperin, Rajeev Motwani. soda 1998: 410-419

The Finite Capacity Dial-A-Ride ProblemMoses Charikar, Balaji Raghavachari. focs 1998: 458-467 [doi]

PreviousNext