Michael A. Bender | |
|---|---|
| Alma mater | Harvard University, A.B. (1992) École Normale Supérieure de Lyon D.E.A. (1993) Harvard University, PhD (1998) |
| Scientific career | |
| Fields | Computer science |
| Institutions | Stony Brook University |
| Thesis | New Algorithms and Metrics for Scheduling (1998) |
| Doctoral advisor | Michael O. Rabin |
Michael A. Bender is an American computer scientist, known for his work in cache-oblivious algorithms, lowest common ancestor data structures, scheduling (computing), and pebble games. He is David R. Smith Leading Scholar professor of computer science at Stony Brook University, [1] and a co-founder of storage technology startup company Tokutek. [2]
Bender obtained his PhD in computer science in 1998 from the Harvard University [3] under the supervision of Michael O. Rabin. [4]
After completing his Ph.D., he co-founded Tokutek. [5] He was program chair of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2006). [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]
In 2012 Bender won the Simon Imre Test of Time award at LATIN. [7] In 2015, his paper "Two-Level Main Memory Co-Design: Multi-Threaded Algorithmic Primitives, Analysis, and Simulation" won the Best Paper award at IPDPS. [8] In 2016, his paper "Optimizing Every Operation in a Write-optimized File System" won the Best Paper award at FAST. [9]
