Martin Farach-Colton is an American computer scientist, known for his work in streaming algorithms, suffix tree construction, pattern matching in compressed data, cache-oblivious algorithms, and lowest common ancestor data structures.

in 1988 from the Johns Hopkins School of Medicine[5] and his Ph.D. in computer science in 1991 from the University of Maryland, College Park under the supervision of Amihood Amir.

[8] The cache-oblivious B-tree data structures studied by Bender, Demaine, and Farach-Colton beginning in 2000 became the basis for the fractal tree index used by Tokutek's products TokuDB and TokuMX.

[14] In 2012, his paper "The LCA problem revisited" won the Simon Imre Test of Time award at LATIN.

[19] Farach-Colton has served on several charity boards including the Ali Forney Center, Lambda Legal,[20] and The Trevor Project.