Title/Position
Eugene Higgins Professor

Degree
Ph.D., Yale University, 1980

chazelle(@cs.princeton.edu) (609) 258-5380 404 Computer Science

Homepage
https://www.cs.princeton.edu/~chazelle

Other Affiliations
Math, PACM

Research

Interests: Natural Algorithms, Dynamical Systems, Dynamic Networks, Computational Geometry, Discrepancy Theory.
Member, American Academy of Arts and Sciences, 2004; ACM Fellow, 1996.
Research Areas: Theory

Active Research Projects: Natural Algorithms

Short Bio

Bernard Chazelle is the Eugene Higgins Professor of Computer Science at Princeton University, where he has been on the faculty since 1986. 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. The author of the book, "The Discrepancy Method," he is a fellow of the American Academy of Arts and Sciences, the European Academy of Sciences, and the recipients of three Best Paper awards from the scientific organization SIAM.

Selected Publications

“The Convergence of Bird Flocking,” J. ACM 61 (2014) - (SODA 2009 Best Paper Award).
“The Total s-Energy of a Multiagent System," SIAM J. Control and Optim., 49 (2011) - (2013 SIAG/CST Best SICON Paper Prize).
"Self-Improving Algorithms," (with N. Ailon, K. Clarkson, D. Liu, W. Mulzer, C. Seshadhri), SIAM J. Comput., 40 (2011).
“The Fast Johnson-Lindenstrauss Transform and Approximate Nearest Neighbors,” (with N. Ailon), SIAM J. Comput., 39 (2009) - (2012 SIAM Outstanding Paper Prize).
“The Discrepancy Method: Randomness and Complexity,” Cambridge University Press, 2000 (2nd ed. 2001).