Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Martin Farach-Colton

Theory of Computation

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. He is the Leonard J. Shustek Professor of Computer Science and chair of the Department of Computer Science and Engineering at New York University, was formerly a Distinguished Professor of Computer Science at Rutgers University, and co-founded the storage technology startup Tokutek.

Facts
Birth Year
1963 1
Award
ACM Fellow 1
Award
Fellow of the Society for Industrial and Applied Mathematics 1
Martin Farach-Colton
Filter Results1 entry
Connections

Credited

Source Library sort (Wikipedia)

In Field

Source Martin Farach-Colton (Wikipedia)

Invented

Source Library sort (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Wikidata: Martin Farach-Colton
Sources
1. Wikidata: Martin Farach-Colton
  • Wikidata Q20656908, class allow-list match (w-wdresolver-0926)
  • Wikidata Q20656908 P569 (date of birth)
View the Source
Library sort (Wikipedia)
  • Credited: Library Sort, Lead section
    Martín Farach-Colton, and Miguel Mosteiro in 2004
  • Invented: Library Sort, Lead section
    Martín Farach-Colton, and Miguel Mosteiro in 2004
View the Source
Martin Farach-Colton (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead sentence
Quote, In Field: Algorithms and Complexity Theory, Lead sentence
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.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.