Jon Louis Bentley (born February 20, 1953) is an American computer scientist who is known for his contributions to computer programming, algorithms and data structure research.
10-405: Jon Bentley may refer to: Jon Bentley (computer scientist) (born 1953), American computer scientist Jon Bentley (TV presenter) (born 1961), English television presenter See also [ edit ] John Bentley (disambiguation) [REDACTED] Topics referred to by the same term This disambiguation page lists articles about people with
20-645: A B.S. in mathematical sciences from Stanford University in 1974. At this time he developed his most cited work, the heuristic-based partitioning algorithm k-d tree , published in 1975. He received a M.S. and PhD 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 . After receiving his Ph.D., he taught programming and computer architecture for six years as member of
30-578: A scientific journal . While the content is subject to peer review , the articles published are often summaries of research that may also be published elsewhere. Material published must be accessible and relevant to a broad readership. From 1960 onward, CACM also published algorithms , expressed in ALGOL . The collection of algorithms later became known as the Collected Algorithms of the ACM. CACM announced
40-544: A transition to entirely open access in February 2024, as part of ACM's commitment to make all articles open access. According to the Journal Citation Reports , the journal has a 2023 impact factor of 22.7. This article about a computer science journal is a stub . You can help Misplaced Pages by expanding it . See tips for writing articles about academic journals . Further suggestions might be found on
50-399: Is sent to all ACM members. Articles are intended for readers with backgrounds in all areas of computer science and information systems . The focus is on the practical implications of advances in information technology and associated management issues; ACM also publishes a variety of more theoretical journals. The magazine straddles the boundary of a science magazine , trade magazine , and
60-507: The faculty at Carnegie Mellon University as an assistant professor of computer science and mathematics . 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. He published Writing efficient programs in 1982. In 1982, Bentley moved to the Computer Science Research Center at Bell Laboratories , where he
70-662: The same name in 1986 and 1988. Bentley received the Dr. Dobb's Excellence in Programming award in 2004. He is a mountaineer that has climbed over one hundred 4,000 feet high peaks in the north-eastern parts of US. Communications of the ACM Communications of the ACM is the monthly journal of the Association for Computing Machinery (ACM). It was established in 1958, with Saul Rosen as its first managing editor. It
80-491: The same name. If an internal link led you here, you may wish to change the link to point directly to the intended article. Retrieved from " https://en.wikipedia.org/w/index.php?title=Jon_Bentley&oldid=937387586 " Category : Human name disambiguation pages Hidden categories: Short description is different from Wikidata All article disambiguation pages All disambiguation pages Jon Bentley (computer scientist) Bentley received
90-594: 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
100-505: Was Distinguished Member of the Technical Staff. In this period he developed various languages, continued his algorithm research and developed various software and products for communication systems. He co-authored an optimized Quicksort algorithm with Doug McIlroy . He left Bell Labs in 2001 and worked at Avaya Labs Research until 2013. In this period he developed enterprise communication systems. He found an optimal solution for
#649350