Bernard Chazelle

Bernard Chazelle (born November 5, 1955) is a professor of computer science at Princeton University. Although he is best known for his invention of the soft heap data structure and the most asymptotically efficient known algorithm for finding minimum spanning trees, most of his work is in computational geometry, where he has found many of the best-known algorithms, such as linear-time triangulation of a simple polygon, as well as many useful complexity results, such as lower bound techniques based on discrepancy theory.

External links

• Chazelle's home page, with publications and CV