BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: Farach:Martin

Contributed to:

ICALP 19961996
STOC 19961996
STOC 19951995
ICALP 19941994
STOC 19931993
STOC 19921992

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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.