The soft heap data structure, a foundational invention in algorithm design, serves as a primary example of Bernard Chazelle's research output in computational geometry. Born in 1955 in Clamart, France, Chazelle established a career that bridges the gap between theoretical mathematics and practical computer science through a tenure spanning multiple elite institutions across Europe and the United States.
Academic Foundation
Chazelle completed his undergraduate and master's level studies in applied mathematics at Mines ParisTech in 1977. He subsequently moved to the United States to attend Yale University. Under the supervision of David P. Dobkin, he earned a PhD in computer science in 1980 at the age of 21. This educational trajectory moved him from the French academic system to a research environment focused on computational complexity.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Computational Geometry
His research focuses on computational geometry, specifically the analysis of algorithms and complexity theory. Significant contributions include the development of linear-time triangulation techniques for simple polygons. He is credited with establishing lower bound techniques utilizing discrepancy theory, a mathematical approach used to analyze the limits of computational efficiency. His publication, The Discrepancy Method: Randomness and Complexity, released by Cambridge University Press in 2000, details these specific research interests.
Professional Appointments and Affiliations
Chazelle holds the title of Eugene Higgins Professor of Computer Science at Princeton University. His professional experience includes research appointments at Brown University, NEC, and Xerox PARC. Additionally, he held positions at the Institute for Advanced Study and various French research organizations, including École normale supérieure, École polytechnique, Inria, and the Collège de France. He holds membership in the American Academy of Arts and Sciences, the European Academy of Sciences, and the Association for Computing Machinery, where he was named a fellow in 1996. He was also a recipient of a Guggenheim Fellowship in 1994.
Fast facts
- Born: 1955, Clamart, France
- Citizenship: France, United States
- Alma Mater: Mines ParisTech, Yale University
- Current Position: Eugene Higgins Professor of Computer Science, Princeton University
- Notable Invention: Soft heap data structure
- ACM Fellow: 1996
- Guggenheim Fellowship: 1994
Questions readers ask
What is the primary focus of Bernard Chazelle's research?
He specializes in computational geometry, focusing on the study of algorithms and complexity results, such as the soft heap data structure.
Where has Bernard Chazelle held academic appointments?
He has held positions at Princeton University, Collège de France, Brown University, and other institutions including the Institute for Advanced Study.
Achievements
- Held posts at Princeton University and Collège de France
- Fields: computer science
