 |
Bernard Chazelle | |
|---|---|
 | |
| Born | November 5, 1955 |
| Citizenship |
|
| Alma mater | École des mines de Paris Yale University |
| Occupation | Computer scientist |
| Spouse | Celia Chazelle |
| Children | 2, including Damien |
| Scientific career | |
| Fields | Computer science |
| Institutions | Princeton University |
| Doctoral advisor | David P. Dobkin |
| Doctoral students | Nadia Heninger |
Bernard Chazelle (born November 5, 1955) is a French computer scientist. He is the Eugene Higgins Professor of Computer Science at Princeton University. Much of his work is in computational geometry, where he is known for his study of algorithms, such as linear-time triangulation[2] of a simple polygon, as well as major complexity results, such as lower bound techniques based on discrepancy theory.[3] He is also known for his invention of the soft heap data structure and the most asymptotically efficient known deterministic algorithm for finding minimum spanning trees.[4]
- ^ "Bernard Chazelle – Curriculum Vitae" (PDF).
- ^ Chazelle, Bernard (1991), "Triangulating a Simple Polygon in Linear Time", Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703, ISSN 0179-5376
- ^ Chazelle, Bernard (2000), The Discrepancy Method: Randomness and Complexity, Cambridge University Press, ISBN 978-0-521-00357-5
- ^ Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–47, doi:10.1145/355541.355562, MR 1866456, S2CID 6276962