BibSLEIGH — Moses

Travelled to:

1 × Austria
1 × Canada
1 × Greece
1 × Singapore
1 × Spain
1 × United Kingdom
14 × USA

Collaborated with:

R.Panigrahy K.Li K.Makarychev Y.Makarychev A.Bhaskara A.Vijayaraghavan A.Agarwal W.Dong Q.Lv S.Li V.Guruswami A.Karagiozova ∅ R.Motwani S.Guha C.Chekuri Z.Wang W.Josephson P.Raghavan M.Bateni N.Alon N.Ailon A.Newman L.O'Callaghan K.C.Chen M.Farach-Colton P.Indyk Y.Bartal D.Raz S.Khuller B.Raghavachari A.Sahai A.Moitra R.Manokaran S.Chaudhuri V.R.Narasayya É.Tardos D.B.Shmoys A.Z.Broder A.M.Frieze M.Mitzenmacher A.Goel T.Feder E.Chlamtac U.Feige R.Kumar S.Rajagopalan A.Tomkins R.Fagin J.M.Kleinberg E.Lehman D.Liu M.Prabhakaran A.Rasala A.Shelat

Talks about:

algorithm (8) approxim (7) problem (6) cluster (6) min (5) similar (4) search (4) median (3) inform (3) round (3)

Person: Moses Charikar

DBLP: Charikar:Moses

Contributed to:

2014

2012

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

Wrote 30 papers:

STOC-2014-BhaskaraCMV #analysis: Smoothed analysis of tensor decompositions (AB, MC, AM, AV), pp. 594–603.
ICALP-v1-2012-BhaskaraCMV #on the #polynomial #programming: On Quadratic Programming with a Ratio Objective (AB, MC, RM, AV), pp. 109–120.
ICALP-v1-2012-CharikarL #approach #problem: A Dependent LP-Rounding Approach for the k-Median Problem (MC, SL), pp. 194–205.
STOC-2010-BhaskaraCCFV #approximate #detection: Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph (AB, MC, EC, UF, AV), pp. 201–210.
STOC-2009-BateniCG #bound: MaxMin allocation via degree lower-bounded arborescences (MB, MC, VG), pp. 543–552.
STOC-2009-CharikarMM: Integrality gaps for Sherali-Adams relaxations (MC, KM, YM), pp. 283–292.
CIKM-2008-DongWJCL #modelling #performance: Modeling LSH for performance tuning (WD, ZW, WJ, MC, KL), pp. 669–678.
SIGIR-2008-DongCL #distance #estimation #similarity #sketching #symmetry: Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces (WD, MC, KL), pp. 123–130.
STOC-2007-AgarwalAC #approximate #problem: Improved approximation for directed cut problems (AA, NA, MC), pp. 671–680.
VLDB-2007-LvJWCL #multi #performance #similarity: Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search (QL, WJ, ZW, MC, KL), pp. 950–961.
STOC-2006-CharikarMM #algorithm #game studies: Near-optimal algorithms for unique games (MC, KM, YM), pp. 205–214.
STOC-2005-AgarwalCMM #algorithm #approximate #problem: O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.
STOC-2005-AilonCN #clustering #consistency #ranking: Aggregating inconsistent information: ranking and clustering (NA, MC, AN), pp. 684–693.
STOC-2005-CharikarK #design #multi #network #on the: On non-uniform multicommodity buy-at-bulk network design (MC, AK), pp. 176–182.
CIKM-2004-LvCL #data type #image #similarity: Image similarity search with compact data structures (QL, MC, KL), pp. 208–217.
STOC-2003-CharikarOP #algorithm #clustering #problem #streaming: Better streaming algorithms for clustering problems (MC, LO, RP), pp. 30–39.
ICALP-2002-CharikarCF #data type: Finding Frequent Items in Data Streams (MC, KCC, MFC), pp. 693–703.
ICALP-2002-CharikarIP #algorithm #orthogonal #problem #query #set: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.
STOC-2002-Charikar #algorithm #estimation #similarity: Similarity estimation techniques from rounding algorithms (MC), pp. 380–388.
STOC-2002-CharikarLLPPRSS #approximate #complexity #modelling: Approximating the smallest grammar: Kolmogorov complexity in natural models (MC, EL, DL, RP, MP, AR, AS, AS), pp. 792–801.
STOC-2001-BartalCR #approximate #clustering #metric: Approximating min-sum k-clustering in metric spaces (YB, MC, DR), pp. 11–20.
STOC-2001-CharikarP #clustering: Clustering to minimize the sum of cluster diameters (MC, RP), pp. 1–10.
PODS-2000-CharikarCMN #estimation #fault #towards: Towards Estimation Error Guarantees for Distinct Values (MC, SC, RM, VRN), pp. 268–279.
STOC-2000-CharikarFGKRS #query: Query strategies for priced information (MC, RF, VG, JMK, PR, AS), pp. 582–591.
STOC-1999-CharikarGTS #algorithm #approximate #problem: A Constant-Factor Approximation Algorithm for the k-Median Problem (MC, SG, ÉT, DBS), pp. 1–10.
STOC-1999-CharikarKRRT #markov #on the: On targeting Markov segments (MC, RK, PR, SR, AT), pp. 99–108.
STOC-1998-BroderCFM #independence #permutation: Min-Wise Independent Permutations (AZB, MC, AMF, MM), pp. 327–336.
STOC-1998-CharikarCGG #algorithm #approximate: Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.
STOC-1998-CharikarKR #algorithm: Algorithms for Capacitated Vehicle Routing (MC, SK, BR), pp. 349–358.
STOC-1997-CharikarCFM #clustering #incremental #information management #information retrieval: Incremental Clustering and Dynamic Information Retrieval (MC, CC, TF, RM), pp. 626–635.