| 词条 | Jon Bentley (computer scientist) |
| 释义 |
|name = Jon Bentley |title = Computer Scientist |birth_name = Jon Louis Bentley |birth_date = {{birth date and age|1953|02|20}} |birth_place = Long Beach, California,[1] U.S. |occupation = Computer scientist |employer = Avaya |alma_mater = University of North Carolina at Chapel Hill Stanford University |thesis_title = Divide and conquer algorithms for closest point problems in multidimensional space |thesis_year = 1976 |doctoral_advisor = Donald Ford Stanat |doctoral_students = {{plainlist|1=
}} }} Jon Louis Bentley (born February 20, 1953) is an American computer scientist who is credited with the heuristic-based partitioning algorithm k-d tree. Education and careerBentley received a B.S. in mathematical sciences from Stanford University in 1974, and M.S. and Ph.D in 1976 from the University of North Carolina at Chapel Hill; while a student, he also held internships at the Xerox Palo Alto Research Center and Stanford Linear Accelerator Center.[1] After receiving his Ph.D., he joined the faculty at Carnegie Mellon University as an assistant professor of computer science and mathematics.[1] At CMU, his students included Brian Reid, John Ousterhout, Jeff Eppinger, Joshua Bloch, and James Gosling, and he was one of Charles Leiserson's advisors.[2] Later, Bentley moved to Bell Laboratories. 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. He and Thomas Ottmann invented the Bentley–Ottmann algorithm, an efficient algorithm for finding all intersecting pairs among a collection of line segments. 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. Bentley received the Dr. Dobb's Excellence in Programming award in 2004. Bibliography
References1. ^1 2 Biography from {{citation|last1=Bentley|first1=J. L.|last2=Ottmann|first2=T. A.|title=Algorithms for reporting and counting geometric intersections|journal=IEEE Transactions on Computers|volume=C-28|issue=9|pages=643–647|year=1979|doi=10.1109/TC.1979.1675432|url=http://www.dtic.mil/get-tr-doc/pdf?AD=ADA058768}}. 2. ^{{mathgenealogy|id=50096}} External links
9 : 1953 births|Living people|American computer scientists|American computer programmers|Researchers in geometric algorithms|Carnegie Mellon University faculty|Stanford University alumni|University of North Carolina at Chapel Hill alumni|People from Long Beach, California |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。