# Bernard Chazelle

> Bernard Chazelle 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 of a simple polygon, as well as major complexity results, such as lower bound techniques based on discrepancy theory. 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.

*French computer scientist*

**Canonical URL:** https://fame.am/person/bernard-chazelle

## Identity
- **Profile type:** Academic ([Wikidata](https://www.wikidata.org/entity/Q39631))
- **Category:** Academics
- **Country:** France
- **Born:** 1955-11-05
- **Status:** living
- **Gender:** male

## Bio

Imported from discovery source: wikidata-dump

## Fame
- **Popularity score:** 45.9 / 100
- **Momentum:** 0.0 / 100  (trend: FALLING)
- **Historical depth:** 6.2 / 100
- **Now attention:** 0.0 / 100
- **Source confidence:** 40.0 / 100
- **Profile completeness:** 70.0 / 100

## Sources
- [Wikiquote](https://en.wikiquote.org/wiki/Bernard_Chazelle)
- [بيرنارد تشازيلى](https://arz.wikipedia.org/wiki/%D8%A8%D9%8A%D8%B1%D9%86%D8%A7%D8%B1%D8%AF_%D8%AA%D8%B4%D8%A7%D8%B2%D9%8A%D9%84%D9%89)
- [Bernard Chazelle](https://de.wikipedia.org/wiki/Bernard_Chazelle)
- [Bernard Chazelle](https://en.wikipedia.org/wiki/Bernard_Chazelle)
- [Bernard Chazelle](https://es.wikipedia.org/wiki/Bernard_Chazelle)
- [Bernard Chazelle](https://fr.wikipedia.org/wiki/Bernard_Chazelle)
- [Bernard Chazelle](https://mg.wikipedia.org/wiki/Bernard_Chazelle)
- [Wikidata](https://www.wikidata.org/wiki/Q892115)

---
Generated by Fame.am · https://fame.am/person/bernard-chazelle