Jon Bentley
From Wikipedia, the free encyclopedia
- For the TV presenter see Jon Bentley (TV presenter)
Jon Louis Bentley is a researcher in the field of computer science. Bentley worked on his MS and Ph.D at the University of North Carolina before eventually becoming a Professor of Computer Science and Mathematics at Carnegie-Mellon University. At CMU, his students included Brian Reid, John Ousterhout, Jeff Eppinger, and James Gosling. Bentley was one of Charles Leiserson's advisors. He found an optimal solution for the two dimensional case of Klee's measure problem: given a set of n rectangles, find the area of their union.
Bentley received the Dr. Dobb's Excellence in Programming award in 2004.
He wrote the Programming Pearls column for the Communications of the ACM magazine, and later collected the articles for two books of the same name. He has published or presented over 200 papers.
[edit] Bibliography
- Programming Pearls (2nd Edition), ISBN 0-201-65788-0.
- More Programming Pearls: Confessions of a Coder, ISBN 0-201-11889-0.
- Writing Efficient Programs, ISBN 0-13-970244-X.
- Divide and Conquer Algorithms in Multidimensional Space, Ph.D. thesis.
