The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Moses Charikar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Moses Charikar
    Greedy approximation algorithms for finding dense components in a graph. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:84-95 [Conf]
  4. Moses Charikar, Chandra Chekuri, Martin Pál
    Sampling Bounds for Stochastic Optimization. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:257-269 [Conf]
  5. Qin Lv, Moses Charikar, Kai Li
    Image similarity search with compact data structures. [Citation Graph (0, 0)][DBLP]
    CIKM, 2004, pp:208-217 [Conf]
  6. 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]
  7. Nir Ailon, Moses Charikar
    Fitting tree metrics: Hierarchical clustering and Phylogeny. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:73-82 [Conf]
  8. Bo Brinkman, Moses Charikar
    On the Impossibility of Dimension Reduction in l1. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:514-523 [Conf]
  9. 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]
  10. 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]
  11. 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]
  12. Moses Charikar, Venkatesan Guruswami, Anthony Wirth
    Clustering with Qualitative Information. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:524-533 [Conf]
  13. Moses Charikar, Balaji Raghavachari
    The Finite Capacity Dial-A-Ride Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:458-467 [Conf]
  14. Moses Charikar, Amit Sahai
    Dimension Reduction in the \ell _1 Norm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:551-560 [Conf]
  15. Moses Charikar, Anthony Wirth
    Maximizing Quadratic Programs: Extending Grothendieck's Inequality. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:54-60 [Conf]
  16. Moses Charikar, Kevin Chen, Martin Farach-Colton
    Finding Frequent Items in Data Streams. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:693-703 [Conf]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. Moses Charikar
    On semidefinite programming relaxations for graph coloring and vertex cover. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:616-620 [Conf]
  25. 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]
  26. 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]
  27. Moses Charikar, Dan Halperin, Rajeev Motwani
    The Dynamic Servers Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:410-419 [Conf]
  28. Moses Charikar, Adriana Karagiozova
    A tight threshold for metric Ramsey phenomena. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:129-136 [Conf]
  29. Moses Charikar, Samir Khuller
    A robust maximum completion time measure for scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:324-333 [Conf]
  30. 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]
  31. 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]
  32. Moses Charikar, Konstantin Makarychev, Yury Makarychev
    Directed metrics and directed graph partitioning problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:51-60 [Conf]
  33. 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]
  34. Nir Ailon, Moses Charikar, Alantha Newman
    Aggregating inconsistent information: ranking and clustering. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:684-693 [Conf]
  35. 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]
  36. Moses Charikar
    Similarity estimation techniques from rounding algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:380-388 [Conf]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. Moses Charikar, Adriana Karagiozova
    On non-uniform multicommodity buy-at-bulk network design. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:176-182 [Conf]
  42. Moses Charikar, Samir Khuller, Balaji Raghavachari
    Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:349-358 [Conf]
  43. 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]
  44. 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]
  45. Moses Charikar, Konstantin Makarychev, Yury Makarychev
    Near-optimal algorithms for unique games. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:205-214 [Conf]
  46. Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
    Better streaming algorithms for clustering problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:30-39 [Conf]
  47. Moses Charikar, Rina Panigrahy
    Clustering to minimize the sum of cluster diameters. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:1-10 [Conf]
  48. Piotr Berman, Moses Charikar, Marek Karpinski
    On-line Load Balancing for Related Machines. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:116-125 [Conf]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. 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]
  57. Moses Charikar
    Guest editor's foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:5, pp:785- [Journal]
  58. 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]
  59. 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]
  60. 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]
  61. 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]
  62. 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]
  63. 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]
  64. 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]
  65. 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]
  66. 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]
  67. 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]
  68. 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]
  69. 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]
  70. 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]
  71. 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]
  72. 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]
  73. 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]
  74. 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]
  75. Amit Agarwal, Noga Alon, Moses Charikar
    Improved approximation for directed cut problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:671-680 [Conf]
  76. 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]

  77. Filtering Image Spam with Near-Duplicate Detection. [Citation Graph (, )][DBLP]


  78. Modeling LSH for performance tuning. [Citation Graph (, )][DBLP]


  79. Every Permutation CSP of arity 3 is Approximation Resistant. [Citation Graph (, )][DBLP]


  80. Improved Approximation Algorithms for Label Cover Problems. [Citation Graph (, )][DBLP]


  81. Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP]


  82. On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]


  83. Efficiently matching sets of features with random histograms. [Citation Graph (, )][DBLP]


  84. Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. [Citation Graph (, )][DBLP]


  85. Online multicast with egalitarian cost sharing. [Citation Graph (, )][DBLP]


  86. Integrality gaps for Sherali-Adams relaxations. [Citation Graph (, )][DBLP]


  87. MaxMin allocation via degree lower-bounded arborescences. [Citation Graph (, )][DBLP]


  88. Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph. [Citation Graph (, )][DBLP]


  89. l22 Spreading Metrics for Vertex Ordering Problems. [Citation Graph (, )][DBLP]


  90. Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph [Citation Graph (, )][DBLP]


  91. Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [Citation Graph (, )][DBLP]


  92. Vertex Sparsifiers and Abstract Rounding Algorithms [Citation Graph (, )][DBLP]


  93. Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP]


  94. On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]


  95. Approximation Algorithm for the Max k-CSP Problem. [Citation Graph (, )][DBLP]


  96. Note on MAX 2SAT. [Citation Graph (, )][DBLP]


Search in 0.837secs, Finished in 0.840secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002