Erik Demaine
From Wikipedia, the free encyclopedia
| Erik D. Demaine | |
 Erik Demaine (left), Martin Demaine (center), and Bill Spight (right) watch John Horton Conway demonstrate a card trick (June 2005).
|
|
| Born | February 28, 1981 Halifax, Nova Scotia |
|---|---|
| Residence |  U.S. |
| Institutions | Massachusetts Institute of Technology |
| Alma mater | Dalhousie University University of Waterloo |
Erik D. Demaine (b. February 28, 1981, in Halifax, Nova Scotia), is an associate professor of Computer Science at the Massachusetts Institute of Technology.
Contents |
[edit] Early Life
His childhood was spent travelling North America with his father, Martin Demaine, an artist and sculptor; he was home-schooled.[1] Erik entered Dalhousie University at the age of 12, and completed his bachelor's degree when only 14.[2][3]
[edit] Professional Accomplishments
His Ph.D. dissertation, a seminal work in the field of computational origami, was completed at the University of Waterloo.[4] This work was awarded the Governor General's Gold Medal from the University of Waterloo and the NSERC Doctoral Prize, 2003, for the best Ph.D. thesis and research in Canada (one of four awards). This thesis work was largely incorporated into a book.[5]
In 2003 he has was awarded a MacArthur Fellowship. He joined the MIT faculty in 2001, at age 20, reportedly the youngest professor in the history of the Massachusetts Institute of Technology.[2][6]
He is a member of the Theory of Computation group at MIT Computer Science and Artificial Intelligence Laboratory.
[edit] References
- ^ Barry, Ellen. "Road Scholar Finds Home at MIT", Boston Globe, 2002-02-17. Retrieved on 2008-04-15.
- ^ a b WERTHEIM, Margaret. "Origami as the Shape of Things to Come", The New York Times, 2005-02-15. Retrieved on 2008-04-15.
- ^ O'Brien, Danny. "Commercial origami starts to take shape", Irish Times, 2005-08-19. Retrieved on 2008-04-15.
- ^ National honour for Demaine. University of Waterloo (2003-03-31). Retrieved on 2008-04-15.
- ^ Demaine, Erik & O'Rourke, Joseph (July 2007), Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Cambridge University Press, pp. Part II, ISBN 978-0-521-85757-4, <http://www.gfalop.org>
- ^ Beasley, Sandra (2006-09-22). "Knowing when to fold". American Scholar.
