Travelled to:1 × Portugal
1 × Spain
1 × The Netherlands
2 × USA
Collaborated with:M.A.Bender B.C.Kuszmaul M.Charikar K.C.Chen V.Liberatore U.Kremer G.M.Landau S.C.Sahinalp D.Tsur S.P.Fekete J.T.Fineman S.Gilbert R.Johnson R.Kraner D.Medjedovic P.Montes P.Shetty R.P.Spillane E.Zadok
Talks about:string (2) oblivi (2) cach (2) algorithm (1) frequent (1) approxim (1) realloc (1) thrash (1) stream (1) storag (1)
Person: Martin Farach-Colton
DBLP: Farach-Colton:Martin
Contributed to:
2014
20122006
20052002
1999Wrote 6 papers:
- PODS-2014-BenderFFFG
- Cost-oblivious storage reallocation (MAB, MFC, SPF, JTF, SG), pp. 278–288.
- VLDB-2012-BenderFJKKMMSSZ #how
- Don’t Thrash: How to Cache Your Hash on Flash (MAB, MFC, RJ, RK, BCK, DM, PM, PS, RPS, EZ), pp. 1627–1637.
- PODS-2006-BenderFK #string
- Cache-oblivious string B-trees (MAB, MFC, BCK), pp. 233–242.
- ICALP-2005-Farach-ColtonLST #approximate #performance #string
- Optimal Spaced Seeds for Faster Approximate String Matching (MFC, GML, SCS, DT), pp. 1251–1262.
- ICALP-2002-CharikarCF #data type
- Finding Frequent Items in Data Streams (MC, KCC, MFC), pp. 693–703.
- CC-1999-LiberatoreFK #algorithm #evaluation
- Evaluation of Algorithms for Local Register Allocation (VL, MFC, UK), pp. 137–152.