Bernard Chazelle of Princeton University will deliver the keynote address at 9:10 a.m. on the topic of natural algorithms, which he defines as algorithms designed by evolution over millions of years. Most of Chazelle’s work has been in computational geometry, where he has found many of the best-known algorithms and complexity results. He is also known as a political essayist. Chazelle describes his current interests as being in natural algorithms, with a focus on collective behavior and bird flocking.
Dartmouth students and faculty will present their research in talks, a comprehensive poster session, and as demonstrations of working models. See the symposium website for additional information and a complete schedule.
The organizers encourage participation from people working in areas related to computer science, including mathematics, engineering, security, and even music and the arts.
“If you think your work would benefit from exposure to computer scientists, or if you want to know more about active research in computer science at Dartmouth, we encourage you to attend,” say the organizers.
