| 词条 | Martin Farach-Colton |
| 释义 |
Farach-Colton is of Argentine descent, and grew up in South Carolina. While attending medical school, he met his future husband, with whom he now has twin children.[3] He obtained his M.D. in 1988 from the Johns Hopkins School of Medicine[4] and his Ph.D. in 1991 from the University of Maryland, College Park under the supervision of Amihood Amir.[5] He was program chair of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003).[6] 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.[2] Farach-Colton is an avid Brazilian jiu-jitsu practitioner and received a bronze medal at the 2015 World Master Jiu-Jitsu IBJJF Championship.[7] He received his black belt from Josh Griffiths in 2018.[8] Farach-Colton also serves on several charity boards including the Ali Forney Center and Lambda Legal.[9] Selected publications
| last1 = Amir | first1 = Amihood | last2 = Benson | first2 = Gary | last3 = Farach | first3 = Martin | doi = 10.1006/jcss.1996.0023 | issue = 2 | journal = Journal of Computer and System Sciences | mr = 1393996 | pages = 299–307 | title = Let sleeping files lie: pattern matching in Z-compressed files | volume = 52 | date = April 1996 | citeseerx = 10.1.1.45.6476 | url = http://tandem.bu.edu/papers/let.sleeping.files.lie.jcss.1996.pdf}}.
| last = Farach | first = Martin | contribution = Optimal suffix tree construction with large alphabets | doi = 10.1109/SFCS.1997.646102 | pages = 137–143 | publisher = IEEE Computer Society | title = 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997 | year = 1997 | citeseerx = 10.1.1.45.4336 | contribution-url = http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.4336&type=pdf}}.
| last1 = Farach | first1 = M. | last2 = Thorup | first2 = M. | author2-link = Mikkel Thorup | doi = 10.1007/PL00009202 | issue = 4 | journal = Algorithmica | mr = 1600834 | pages = 388–404 | title = String matching in Lempel-Ziv compressed strings | volume = 20 | date = April 1998 | citeseerx = 10.1.1.45.5484 | url = http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.5484&type=pdf}}.
| last1 = Bender | first1 = Michael A. | last2 = Farach-Colton | first2 = Martin | editor1-last = Gonnet | editor1-first = Gaston H. | editor2-last = Panario | editor2-first = Daniel | editor3-last = Viola | editor3-first = Alfredo | contribution = The LCA problem revisited | doi = 10.1007/10719839_9 | pages = 88–94 | publisher = Springer | series = Lecture Notes in Computer Science | title = LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings | volume = 1776 | year = 2000 | contribution-url = http://www.ics.uci.edu/%7Eeppstein/261/BenFar-LCA-00.pdf}}.
| last1 = Charikar | first1 = Moses | author1-link = Moses Charikar | last2 = Chen | first2 = Kevin | last3 = Farach-Colton | first3 = Martin | doi = 10.1016/S0304-3975(03)00400-6 | issue = 1 | journal = Theoretical Computer Science | mr = 2045483 | pages = 3–15 | title = Finding frequent items in data streams | volume = 312 | year = 2004 | citeseerx = 10.1.1.145.8413 | url = https://www.cs.rutgers.edu/~farach/pubs/FrequentStream.pdf}}. Previously announced in ICALP 2002.
| last1 = Bender | first1 = Michael A. | last2 = Demaine | first2 = Erik D. | author2-link = Erik Demaine | last3 = Farach-Colton | first3 = Martin | doi = 10.1137/S0097539701389956 | issue = 2 | journal = SIAM Journal on Computing | mr = 2191447 | pages = 341–358 | title = Cache-oblivious B-trees | url = http://erikdemaine.org/papers/CacheObliviousBTrees_SICOMP/ | volume = 35 | year = 2005 | citeseerx = 10.1.1.32.4093}}. Previously announced at FOCS 2000. References1. ^Faculty listing, Computer Science, Rutgers, retrieved 2015-07-08. 2. ^1 {{citation|title=Scaling MySQL and MariaDB to TBs: Interview with Martín Farach-Colton|first=Roberto V.|last=Zicari|date=October 8, 2012|url=http://www.odbms.org/blog/2012/10/scaling-mysql-and-mariadb-to-tbs-interview-with-martin-farach-colton/|work=ODBMS Industry Watch}}. 3. ^{{citation|url=https://lucatrevisan.wordpress.com/2012/07/10/turing-centennial-post-5-martin-farach-colton/|first=Martin|last=Farach-Colton|title=Turing Centennial Post 5: Martin Farach-Colton|date=July 10, 2012|work=in theory|editor-first=Luca|editor-last=Trevisan|editor-link=Luca Trevisan}}. 4. ^[https://www.usenix.org/conference/fast17/speaker-or-organizer/martin-farach-colton-rutgers-university Usenix FAST] 5. ^{{mathgenealogy|id=70210}} 6. ^14th ACM-SIAM Symposium on Discrete Algorithms, SIAM, retrieved 2015-07-08. 7. ^World Master Jiu-Jitsu IBJJF Championship 2015 8. ^[https://www.instagram.com/p/BrYq4WEA-Pt/?utm_source=ig_share_sheet&igshid=zpxyeju1m6g8 Clockwork Jiu Jitsu Instagram] 9. ^{{Cite web|url=https://www.aliforneycenter.org/about-us/board-members1/martin-farach-colton/|title=Martin Farach-Colton|website=www.aliforneycenter.org|language=en|access-date=2017-11-07}} External links
8 : Year of birth missing (living people)|Living people|American people of Argentine descent|LGBT scientists from the United States|American computer scientists|Theoretical computer scientists|University of Maryland, College Park alumni|Rutgers University faculty |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。