Bernard Chazelle

Bernard Chazelle Bernard Chazelle (born November 5, 1955) is a French American computer scientist. He is currently 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. Provided by Wikipedia
Showing 1 - 1 results of 1 for search 'Chazelle, Bernard', query time: 0.01s Refine Results
  1. 1

    Advances in discrete and computational geometry : proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry--Ten Years Later, July...

    Published 1999
    Other Authors: “…Chazelle, Bernard…”
    Conference Proceeding Book