Bernard Chazelle

Professor Bernard Chazelle is the Eugene Higgins Professor of Computer Science at Princeton University. He helped establish the field of computational geometry in theoretical computer science and has solved many long-standing questions in computational geometry, including optimal-time algorithms for simple polygon triangulation, line segment intersection, and higher-dimensional convex hull. Professor Chazelle has also pioneered the discrepancy method and designed the fastest known deterministic algorithm for minimum spanning trees and established the new field of Natural Algorithms. He has held research and faculty positions at College de France, Carnegie-Mellon University, Brown University, Ecole Polytechnique, Ecole Normale Superieure, University of Paris, INRIA, Xerox Parc, DEC SRC, and NEC Research, where he was the president of the Board of Fellows for many years. He has served on the editorial board of more than a dozen scientific journals. He received his Ph.D in computer science from Yale University in 1980. Additionally, he is the author of the book, "The Discrepancy Method," and a fellow of the European Academy of Sciences, and the recipients of three Best Paper awards from the scientific organization SIAM.