View source for Bernard Chazelle

{{Short description|French computer scientist (born 1955)}}
{{BLP sources|date=October 2012}}
{{Infobox scientist
| name = Bernard Chazelle
| spouse = [[Celia Chazelle]]
| children = 2, including [[Damien Chazelle|Damien]]
| image = Bernard Chazelle.jpg
| birth_date = {{birth date and age|1955|11|5}}
| birth_place = [[Clamart]], [[France]]
| citizenship = {{hlist|France|United States}}<ref>{{cite web|url=http://www.cs.princeton.edu/~chazelle/pubs/shortcv.pdf|title=Bernard Chazelle – Curriculum Vitae}}</ref>
| doctoral_advisor = [[David P. Dobkin]]
| doctoral_students = [[Nadia Heninger]]
| occupation = [[Computer scientist]]
| alma_mater = [[Mines ParisTech|École des mines de Paris]]<br>[[Yale University]]
| workplaces = [[Princeton University]]
| fields = [[Computer science]]
}}

'''Bernard Chazelle''' (born November 5, 1955) is a French [[computer scientist]]. He is the [[Higgins Trust|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]] [[Polygon triangulation|triangulation]]<ref>{{Citation|last=Chazelle|first=Bernard|author-link=Bernard Chazelle|title=Triangulating a Simple Polygon in Linear Time |journal=Discrete & Computational Geometry|volume=6|year=1991|issue=3|pages=485–524|issn=0179-5376|doi=10.1007/BF02574703|doi-access=free}}</ref> of a [[simple polygon]], as well as major complexity results, such as [[lower bound]] techniques based on [[discrepancy theory]].<ref name=ChazelleBook2000>{{Citation|last=Chazelle|first=Bernard|author-link=Bernard Chazelle|title=The Discrepancy Method: Randomness and Complexity|url=https://books.google.com/books?id=dmOPmEh6LdYC|year=2000|publisher=Cambridge University Press|isbn=978-0-521-00357-5}}</ref> 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 tree]]s.<ref name=Chazelle2000>{{citation|last=Chazelle|first=Bernard|authorlink=Bernard Chazelle|doi=10.1145/355541.355562|mr=1866456|issue=6|journal=[[Journal of the Association for Computing Machinery]]|pages=1028–47|title=A minimum spanning tree algorithm with inverse-Ackermann type complexity|volume=47|year=2000|s2cid=6276962|doi-access=free}}</ref>

==Early life==
Chazelle was born in [[Clamart]], France, the son of Marie-Claire (née Blanc) and Jean Chazelle.{{citation needed|date=January 2017}} He grew up in Paris, France, where he received his bachelor's degree and master's degree in [[applied mathematics]] at the [[Mines ParisTech|É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]].<ref>{{mathgenealogy|id=52303}}</ref>

==Career==
{{BLP sources section|date=February 2017}}
Chazelle accepted professional appointments at institutions such as [[Brown University|Brown]], [[NEC Research Institute|NEC]], [[Xerox PARC]], the [[Institute for Advanced Study]], and the Paris institutions [[École Normale Supérieure|École normale supérieure]], [[École Polytechnique|École polytechnique]], [[French Institute for Research in Computer Science and Automation|Inria]], and [[Collège de France]]. He is a fellow of the [[Association for Computing Machinery|ACM]], the [[American Academy of Arts and Sciences]], the [[John Simon Guggenheim Memorial Foundation]], and [[NEC Research Institute|NEC]], as well as a member of the European Academy of Sciences. He has also written essays about music and politics.<ref name="cs.princeton.edu">[http://www.cs.princeton.edu/~chazelle Profile], princeton.edu; accessed February 16, 2017.</ref>

== 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==
*{{cite book|title=The Discrepancy Method: Randomness and Complexity|url=https://archive.org/details/discrepancymetho0000chaz|url-access=registration|year=2000|publisher=Cambridge University Press|isbn=978-0-521-00357-5}}

== See also ==
* [[Chazelle polyhedron]]

== References ==
{{reflist}}

== External links ==
{{Wikiquote}}
{{external media
|video1= [http://www.onbeing.org/program/bernard-chazelle-discovering-the-cosmology-of-bach/7026 Discovering the Cosmology of Bach], ''On Being'', November 13, 2014
|video2={{YouTube|9qbDyFO8gs4|Why Natural Algorithms are the Language of the Living World}}, Technion's Computer Science Faculty, April 23, 2013 
}}
* [http://www.cs.princeton.edu/~chazelle/ Bernard Chazelle] at [[Princeton University]]

{{Damien Chazelle|state=collapsed}}
{{Authority control}}

{{DEFAULTSORT:Chazelle, Bernard}}
[[Category:1955 births]]
[[Category:Living people]]
[[Category:French computer scientists]]
[[Category:American computer scientists]]
[[Category:Researchers in geometric algorithms]]
[[Category:1996 fellows of the Association for Computing Machinery]]
[[Category:Yale Graduate School of Arts and Sciences alumni]]
[[Category:Princeton University faculty]]
[[Category:People from Clamart]]
[[Category:French emigrants to the United States]]
[[Category:Carnegie Mellon University faculty]]