Travelled to:
1 × Canada
1 × Germany
1 × Israel
3 × USA
Collaborated with:
S.Kannan A.Amir G.Benson S.Muthukrishnan M.Thorup T.Warnow
Talks about:
optim (3) match (3) dimension (2) compress (2) string (2) tree (2) two (2) evolutionari (1) logarithm (1) construct (1)
Person: Martin Farach
DBLP: Farach:Martin
Contributed to:
Wrote 6 papers:
- ICALP-1996-FarachM #random
- Optimal Logarithmic Time Randomized Suffix Tree Construction (MF, SM), pp. 550–561.
- STOC-1996-FarachK #algorithm #evolution #performance
- Efficient Algorithms for Inverting Evolution (MF, SK), pp. 230–236.
- STOC-1995-FarachT #string
- String matching in Lempel-Ziv compressed strings (MF, MT), pp. 703–712.
- ICALP-1994-AmirBF #2d
- Optimal Two-Dimensional Compressed Matching (AA, GB, MF), pp. 215–226.
- STOC-1993-FarachKW #robust
- A robust model for finding optimal evolutionary trees (MF, SK, TW), pp. 137–145.
- STOC-1992-AmirBF #2d #independence
- Alphabet Independent Two Dimensional Matching (AA, GB, MF), pp. 59–68.