Bernard Chazelle
Page Module:Message box/ambox.css has no content.
Script error: No such module "Template wrapper".Script error: No such module "Check for conflicting parameters".
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[1] of a simple polygon, as well as major complexity results, such as lower bound techniques based on discrepancy theory.[2] 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.[3]
Early life
Chazelle was born in Clamart, France, the son of Marie-Claire (née Blanc) and Jean Chazelle.[citation needed] He grew up in Paris, France, where he received his bachelor's degree and master's degree in applied mathematics at the École des mines de Paris in 1977. Then, at the age of 21, he attended Yale University in the United States, where he received his PhD in computer science in 1980 under the supervision of David P. Dobkin.[4]
Career
Page Module:Message box/ambox.css has no content.
This section of a biography of a living person needs additional citations for verification. (February 2017) |
Chazelle accepted professional appointments at institutions such as Brown, NEC, Xerox PARC, the Institute for Advanced Study, and the Paris institutions École normale supérieure, École polytechnique, Inria, and Collège de France. He is a fellow of the ACM, the American Academy of Arts and Sciences, the John Simon Guggenheim Memorial Foundation, and NEC, as well as a member of the European Academy of Sciences. He has also written essays about music and politics.[5]
Personal life
Chazelle is married to Celia Chazelle. He is the father of director Damien Chazelle, the youngest person in history to win an Academy Award for Best Director, and Anna Chazelle, an entertainer.
Works
- Page Module:Citation/CS1/styles.css has no content.The Discrepancy Method: Randomness and Complexity. Cambridge University Press. 2000. ISBN 978-0-521-00357-5.
See also
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.Chazelle, Bernard (1991), "Triangulating a Simple Polygon in Linear Time", Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703, ISSN 0179-5376
- ^ Page Module:Citation/CS1/styles.css has no content.Chazelle, Bernard (2000), The Discrepancy Method: Randomness and Complexity, Cambridge University Press, ISBN 978-0-521-00357-5
- ^ Page Module:Citation/CS1/styles.css has no content.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
- ^ Bernard Chazelle at the Mathematics Genealogy ProjectTemplate:EditAtWikidata
- ^ Profile, princeton.edu; accessed February 16, 2017.
External links
Page Module:Side box/styles.css has no content.Page Template:Sister project/styles.css has no content.
Page Module:Infobox/styles.css has no content.
| External videos | |
|---|---|
 Discovering the Cosmology of Bach, On Being, November 13, 2014 | |
| Why Natural Algorithms are the Language of the Living World on YouTube, Technion's Computer Science Faculty, April 23, 2013 |
Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found. Lua error in package.lua at line 80: module 'Module:Authority control/config' not found.
