Chazelle, B.
Enlarge text Shrink text-
Personality
|
System number
987007445117405171
-
Save successfulThe item can be found in your Personal ZoneשגיאהLog in to your account to save
Information for Authority record
Name (Latin)
Chazelle, B.
Other forms of name
Chazelle, Bernard
Date of birth
1955-11-05
Gender
male
MARC
MARC
Sources of Information
- His The complexity of cutting complexes, 1987:t.p. (B. Chazelle) p. 1 (Bernard Chazelle; Dept. of Computer Science, Princeton Univ., Princeton, NJ)
- Advances in discrete and computational geometry, 1998:CIP t.p. (Bernard Chazelle) data sheet (b. Nov. 5, 1955)
1 / 1
Bernard Chazelle
Bernard Chazelle, Public domain
Wikipedia description:
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 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.
Read more on Wikipedia >