After completing his Ph.D., he went on to work at Google and co-founded Tokutek.[7] He was program chair of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003).[8] The cache-obliviousB-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.[3]
Awards and honors
In 1996, Farach-Colton was awarded an Alfred P. Sloan Research Fellowship.[9] In 2021, he was inducted as a SIAM Fellow "for contributions to the design and analysis of algorithms and their use in storage systems and computational biology"[10] and as an ACM Fellow "for contributions to data structures for biocomputing and big data"[11] In 2022, he was inducted as an IEEE Fellow "for contributions to data structures for storage systems".[12]
In 2023, he was elected to the Argentine Academia Nacional de Ciencias Exactas, Fisicas y Naturales.[13] In 2024, he was inducted as an AAAS Fellow.[14]
In 2012, his paper "The LCA problem revisited" won the Simon Imre Test of Time award at LATIN.[15] In 2016, his paper "Optimizing Every Operation in a Write-optimized File System" won the Best Paper award at FAST.[16]
In 2023, his paper "Mosaic Pages: Big TLB Reach with Small Pages" won a Distinguished Paper award as ASPLOS.[17]
Bender, Michael A.; Farach-Colton, Martin (2000), "The LCA problem revisited"(PDF), in Gonnet, Gaston H.; Panario, Daniel; Viola, Alfredo (eds.), LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings, Lecture Notes in Computer Science, vol. 1776, Springer, pp. 88–94, doi:10.1007/10719839_9, ISBN978-3-540-67306-4.