| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Moses Charikar Qin Lv , Moses Charikar, Kai Li : Image similarity search with compact data structures. CIKM 2004 : 208-217 Moses Charikar, Michel X. Goemans , Howard J. Karloff : On the Integrality Ratio for Asymmetric TSP. FOCS 2004 : 101-107 Moses Charikar, Anthony Wirth : Maximizing Quadratic Programs: Extending Grothendieck's Inequality. FOCS 2004 : 54-60 Moses Charikar, Joseph Naor , Baruch Schieber : Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. 12 (2): 340-348 (2004) Moses Charikar, Chandra Chekuri , Tomás Feder , Rajeev Motwani : Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. 33 (6): 1417-1440 (2004) Moses Charikar, Kevin Chen , Martin Farach-Colton : Finding frequent items in data streams. Theor. Comput. Sci. 312 (1): 3-15 (2004) Bo Brinkman , Moses Charikar: On the Impossibility of Dimension Reduction in l 1 . FOCS 2003 : 514-523 Moses Charikar, Venkatesan Guruswami , Anthony Wirth : Clustering with Qualitative Information. FOCS 2003 : 524-533 Moses Charikar, Liadan O'Callaghan , Rina Panigrahy : Better streaming algorithms for clustering problems. STOC 2003 : 30-39 Andrei Z. Broder , Moses Charikar, Michael Mitzenmacher : A derandomization using min-wise independent permutations. J. Discrete Algorithms 1 (1): 11-20 (2003) Moses Charikar, Amit Sahai : Dimension Reduction in the \ell _1 Norm. FOCS 2002 : 551-560 Moses Charikar, Piotr Indyk , Rina Panigrahy : New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. ICALP 2002 : 451-462 Moses Charikar, Kevin Chen , Martin Farach-Colton : Finding Frequent Items in Data Streams. ICALP 2002 : 693-703 Moses Charikar: On semidefinite programming relaxations for graph coloring and vertex cover. SODA 2002 : 616-620 Moses Charikar: Similarity estimation techniques from rounding algorithms. STOC 2002 : 380-388 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. STOC 2002 : 792-801 Moses Charikar, Ronald Fagin , Venkatesan Guruswami , Jon M. Kleinberg , Prabhakar Raghavan , Amit Sahai : Query Strategies for Priced Information. J. Comput. Syst. Sci. 64 (4): 785-819 (2002) Moses Charikar, Sudipto Guha , Éva Tardos , David B. Shmoys : A Constant-Factor Approximation Algorithm for the k-Median Problem. J. Comput. Syst. Sci. 65 (1): 129-149 (2002) Moses Charikar, Samir Khuller , David M. Mount , Giri Narasimhan : Algorithms for facility location problems with outliers. SODA 2001 : 642-651 Moses Charikar, Rina Panigrahy : Clustering to minimize the sum of cluster diameters. STOC 2001 : 1-10 Yair Bartal , Moses Charikar, Danny Raz : Approximating min-sum k -clustering in metric spaces. STOC 2001 : 11-20 Susanne Albers , Moses Charikar, Michael Mitzenmacher : Delayed Information and Action in On-Line Algorithms. Inf. Comput. 170 (2): 135-152 (2001) Moses Charikar, Samir Khuller , Balaji Raghavachari : Algorithms for Capacitated Vehicle Routing. SIAM J. Comput. 31 (3): 665-682 (2001) Yair Bartal , Moses Charikar, Piotr Indyk : On page migration and other relaxed task systems. Theor. Comput. Sci. 268 (1): 43-66 (2001) Moses Charikar: Greedy approximation algorithms for finding dense components in a graph. APPROX 2000 : 84-95 Moses Charikar, Venkatesan Guruswami , Ravi Kumar , Sridhar Rajagopalan , Amit Sahai : Combinatorial feature selection problems. FOCS 2000 : 631-640 Rohit Negi , Moses Charikar, John M. Cioffi : Minimum Outage Transmission over Fading Channels with Delay Constraint. ICC (1) 2000 : 282-286 Moses Charikar, Joseph Naor , Baruch Schieber : Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. INFOCOM 2000 : 1518-1527 Moses Charikar, Surajit Chaudhuri , Rajeev Motwani , Vivek R. Narasayya : Towards Estimation Error Guarantees for Distinct Values. PODS 2000 : 268-279 Moses Charikar, Ronald Fagin , Venkatesan Guruswami , Jon M. Kleinberg , Prabhakar Raghavan , Amit Sahai : Query strategies for priced information (extended abstract). STOC 2000 : 582-591 Piotr Berman , Moses Charikar, Marek Karpinski : On-Line Load Balancing for Related Machines Electronic Colloquium on Computational Complexity (ECCC) 7 (1): (2000) Piotr Berman , Moses Charikar, Marek Karpinski : On-Line Load Balancing for Related Machines. J. Algorithms 35 (1): 108-121 (2000) Andrei Z. Broder , Moses Charikar, Alan M. Frieze , Michael Mitzenmacher : Min-Wise Independent Permutations. J. Comput. Syst. Sci. 60 (3): 630-659 (2000) Moses Charikar, Sudipto Guha : Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. FOCS 1999 : 378-388 Moses Charikar, Jon M. Kleinberg , Ravi Kumar , Sridhar Rajagopalan , Amit Sahai , Andrew Tomkins : Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SODA 1999 : 177-184 Moses Charikar, Sudipto Guha , Éva Tardos , David B. Shmoys : A Constant-Factor Approximation Algorithm for the k -Median Problem (Extended Abstract). STOC 1999 : 1-10 Moses Charikar, Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : On targeting Markov segments. STOC 1999 : 99-108 Moses Charikar, Chandra Chekuri , To-Yat Cheung , Zuo Dai , Ashish Goel , Sudipto Guha , Ming Li : Approximation Algorithms for Directed Steiner Problems. J. Algorithms 33 (1): 73-91 (1999) Moses Charikar, Chandra Chekuri , Ashish Goel , Sudipto Guha , Serge A. Plotkin : Approximating a Finite Metric by a Small Number of Tree Metrics. FOCS 1998 : 379-388 Moses Charikar, Balaji Raghavachari : The Finite Capacity Dial-A-Ride Problem. FOCS 1998 : 458-467 Susanne Albers , Moses Charikar, Michael Mitzenmacher : Delayed Information and Action in On-line Algorithms. FOCS 1998 : 71-81 Andrei Z. Broder , Moses Charikar, Michael Mitzenmacher : A Derandomization Using Min-Wise Independent Permutations. RANDOM 1998 : 15-24 Moses Charikar, Chandra Chekuri , To-Yat Cheung , Zuo Dai , Ashish Goel , Sudipto Guha , Ming Li : Approximation Algorithms for Directed Steiner Problems. SODA 1998 : 192-200 Moses Charikar, Dan Halperin , Rajeev Motwani : The Dynamic Servers Problem. SODA 1998 : 410-419 Moses Charikar, Chandra Chekuri , Ashish Goel , Sudipto Guha : Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k -Median. STOC 1998 : 114-123 Andrei Z. Broder , Moses Charikar, Alan M. Frieze , Michael Mitzenmacher : Min-Wise Independent Permutations (Extended Abstract). STOC 1998 : 327-336 Moses Charikar, Samir Khuller , Balaji Raghavachari : Algorithms for Capacitated Vehicle Routing. STOC 1998 : 349-358 Yair Bartal , Moses Charikar, Piotr Indyk : On Page Migration and Other Related Task Systems. SODA 1997 : 43-52 Moses Charikar, Chandra Chekuri , Tomás Feder , Rajeev Motwani : Incremental Clustering and Dynamic Information Retrieval. STOC 1997 : 626-635 Moses Charikar, Rajeev Motwani , Prabhakar Raghavan , Craig Silverstein : Constrained TSP and Low-Power Computing. WADS 1997 : 104-115 Piotr Berman , Moses Charikar, Marek Karpinski : On-line Load Balancing for Related Machines. WADS 1997 : 116-125 1 [ 11 ] [ 30 ] 2 [ 4 ] [ 28 ] [ 31 ] 3 [ 1 ] [ 20 ] [ 21 ] 4 [ 45 ] 5 [ 6 ] [ 10 ] [ 19 ] [ 42 ] 6 [ 23 ] 7 [ 3 ] [ 7 ] [ 9 ] [ 13 ] [ 14 ] [ 47 ] 8 [ 39 ] [ 46 ] 9 [ 9 ] [ 14 ] 10 [ 25 ] 11 [ 9 ] [ 14 ] 12 [ 22 ] [ 35 ] 13 [ 39 ] [ 46 ] 14 [ 3 ] [ 47 ] 15 [ 6 ] [ 19 ] 16 [ 7 ] [ 9 ] [ 13 ] [ 14 ] 17 [ 50 ] 18 [ 7 ] [ 9 ] [ 13 ] [ 14 ] [ 16 ] [ 18 ] [ 34 ] 19 [ 22 ] [ 26 ] [ 35 ] [ 44 ] 20 [ 8 ] 21 [ 4 ] [ 28 ] [ 40 ] 22 [ 50 ] 23 [ 1 ] [ 20 ] [ 21 ] 24 [ 5 ] [ 29 ] [ 33 ] 25 [ 17 ] [ 22 ] [ 35 ] 26 [ 15 ] [ 17 ] [ 26 ] 27 [ 36 ] 28 [ 51 ] 29 [ 9 ] [ 14 ] 30 [ 36 ] 31 [ 51 ] 32 [ 6 ] [ 10 ] [ 11 ] [ 19 ] [ 30 ] [ 42 ] 33 [ 2 ] [ 3 ] [ 8 ] [ 23 ] [ 47 ] 34 [ 33 ] 35 [ 24 ] [ 48 ] 36 [ 23 ] 37 [ 33 ] 38 [ 25 ] 39 [ 43 ] 40 [ 32 ] [ 36 ] [ 40 ] [ 43 ] 41 [ 13 ] 42 [ 36 ] 43 [ 5 ] [ 12 ] [ 29 ] 44 [ 2 ] [ 15 ] [ 22 ] [ 35 ] 45 [ 15 ] [ 17 ] [ 26 ] 46 [ 36 ] 47 [ 31 ] 48 [ 17 ] [ 22 ] [ 26 ] [ 35 ] [ 36 ] [ 41 ] 49 [ 24 ] [ 48 ] 50 [ 36 ] 51 [ 16 ] [ 34 ] 52 [ 2 ] 53 [ 16 ] [ 34 ] 54 [ 15 ] [ 17 ] 55 [ 44 ] [ 49 ]  ©2005 Association for Computing Machinery |
