Michael A. Bender is an American

computer scientist A computer scientist is a person who is trained in the academic study of computer science. Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (al ...

, known for his work in cache-oblivious algorithms, lowest common ancestor

data structure In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, a ...

s, scheduling (computing), and

pebble game In mathematics and computer science, a pebble game is a type of mathematical game played by placing "pebbles" or "markers" on a directed graph, directed acyclic graph according to certain rules: * A given step of the game consists of either placin ...

s. He is David R. Smith Leading Scholar professor of computer science at

Stony Brook University Stony Brook University (SBU), officially the State University of New York at Stony Brook, is a public research university in Stony Brook, New York. Along with the University at Buffalo, it is one of the State University of New York system's ...

, and a co-founder of storage technology startup company Tokutek..

Early life and education

Bender obtained his PhD in

computer science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical discipli ...

in 1998 from the

Harvard University Harvard University is a private Ivy League research university in Cambridge, Massachusetts. Founded in 1636 as Harvard College and named for its first benefactor, the Puritan clergyman John Harvard, it is the oldest institution of higher le ...

under the supervision of Michael O. Rabin.

Research contributions

After completing his Ph.D., he co-founded Tokutek. He was program chair of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2006). 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 In computer science, a fractal tree index is a tree data structure that keeps data sorted and allows searches and sequential access in the same time as a B-tree but with insertions and deletions that are asymptotically faster than a B-tree. Li ...

used by Tokutek's products TokuDB and TokuMX.

Awards and honors

In 2012 Bender won the Simon Imre Test of Time award at LATIN. In 2015, his paper "Two-Level Main Memory Co-Design: Multi-Threaded Algorithmic Primitives, Analysis, and Simulation" won the Best Paper award at IPDPS. In 2016, his paper "Optimizing Every Operation in a Write-optimized File System" won the Best Paper award at FAST.

Selected publications

*. *. Previously announced at FOCS 2000. *. *.

References

External links

Home pageGoogle scholar profile
{{DEFAULTSORT:Bender, Michael A. Year of birth missing (living people) Living people American computer scientists American theoretical computer scientists Harvard University alumni Stony Brook University faculty ENS Fontenay-Saint-Cloud-Lyon alumni