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 at Chapel Hill 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 into two books of the same name. He has published or presented over 200 papers. Oddly enough, a bug in one of the book's algorithms was not discovered for two decades. Interestingly, The C Programming Language had included a binary search algorithm using pointers which had introduced a fix - long before Bentley's book was published - due to a problem with C syntax rules.

While presenting a Google Tech Talk on August 9th, 2007, he stated that "as a guy who goes around wearing West Point t-shirts" he was not "all that fond of" the organization Amnesty International.[1]


[edit] Bibliography

[edit] References

  1. ^ Three Beautiful Quicksorts. Retrieved on 2007-10-20.
Languages