Bernard Chazelle

Bernard Chazelle (born November 5, 1955) is a French computer scientist and 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 and major complexity results including lower bound techniques based on discrepancy theory, as well as his invention of the soft heap data structure and the most asymptotically efficient known deterministic algorithm for finding minimum spanning trees.