Erik Demaine

Erik Demaine
Name	Erik Demaine
Birth date	1981
Nationality	Canadian-American
Fields	Computational geometry, algorithms, origami, computer science
Workplaces	Massachusetts Institute of Technology, University of Waterloo
Alma mater	University of Waterloo, Harvard University
Doctoral advisor	John E. Hopcroft

Erik Demaine is a computer scientist and professor noted for contributions to computational geometry, algorithm design, recreational mathematics, and the mathematical theory of origami. He is recognized for bridging theoretical work with tangible artifacts and public outreach, collaborating across institutions and disciplines such as MIT, the University of Waterloo, and professional organizations like the Association for Computing Machinery and the American Mathematical Society. Demaine's work often intersects with prominent researchers and institutions including John E. Hopcroft, MIT Media Lab, Harvard University, and international collaborators from institutions such as EPFL, ETH Zurich, and the University of Tokyo.

Early life and education

Born in 1981, Demaine was a child prodigy who entered the University of Waterloo at age 12 and completed his bachelor's degree under faculty including members of the David R. Cheriton School of Computer Science. He pursued graduate study at Harvard University, where he completed a Ph.D. under the supervision of John E. Hopcroft. During his formative years he interacted with figures and programs such as the International Mathematical Olympiad, the Perimeter Institute, and summer researchers affiliated with the Canadian Mathematical Society and the Fields Institute, developing early interests that combined recreational mathematics with formal algorithmic problems.

Academic career and positions

After completing his doctorate, Demaine joined the faculty of the Massachusetts Institute of Technology as a professor in the Computer Science and Artificial Intelligence Laboratory and held joint appointments that connected to the MIT Media Lab and the School of Engineering. He has maintained ties with the University of Waterloo as an alumnus and collaborator and has held visiting or adjunct roles at institutions including Yale University, Columbia University, and research centers such as Microsoft Research and the Institute for Advanced Study. His academic network extends to collaborators at Princeton University, UC Berkeley, Stanford University, and international centers like Tokyo Institute of Technology.

Research contributions and major results

Demaine's research spans foundational results in computational geometry, complexity theory, and the algorithmic theory of folding and knotting. Notable results include hardness proofs and algorithmic frameworks for problems inspired by origami and reconfiguration, connecting to classic results in NP-completeness and computational topology studied by researchers at DIMACS and the Simons Institute. He produced seminal work on folding problems that linked to the Hinged Dissections literature, extending classical geometric constructions explored by figures tied to the Royal Society and the American Mathematical Monthly. Collaborative work yielded fast algorithms and lower bounds for problems in graph drawing, packing, and polyhedron unfolding, with connections to the work of scholars at Carnegie Mellon University, Cornell University, and Johns Hopkins University.

Demaine established structural theorems and constructive methods for origami crease patterns, relating to mathematical models advanced by researchers at Kyoto University and the University of Tokyo. He and collaborators proved complexity results for puzzles and mechanical linkages, intersecting with research communities around the European Symposium on Algorithms, the Symposium on Computational Geometry, and the ACM-SIAM Symposium on Discrete Algorithms. His interdisciplinary collaborations extended into materials science and robotics with groups at MIT Media Lab, Harvard John A. Paulson School of Engineering and Applied Sciences, and the Wyss Institute.

Awards and honors

Demaine has received numerous recognitions from professional societies and foundations, including early-career awards and fellowships from organizations such as the MacArthur Fellows Program, the National Science Foundation, and the Simons Foundation. He has been named a fellow or prize recipient by the Association for Computing Machinery, the Society for Industrial and Applied Mathematics, and honored by academic institutions including the University of Waterloo and Harvard University. His outreach and scholarship have been acknowledged through invitations to deliver plenary lectures at conferences like the International Congress of Mathematicians, the IEEE Symposium on Foundations of Computer Science, and meetings sponsored by the Mathematical Association of America.

Outreach, teaching, and public engagement

Demaine is active in public engagement, presenting at museums and cultural institutions such as the Museum of Mathematics, the Smithsonian Institution, and the Royal Ontario Museum. He has curated exhibits and demonstrations linking computational concepts to physical artifacts, collaborating with artists and organizations like the MIT Museum, the Science Museum London, and the Tate Modern. His teaching at MIT emphasizes undergraduate and graduate courses that integrate theory and hands-on projects, and he has supervised doctoral students who have gone on to positions at Princeton University, EPFL, and industry research labs including Google Research and Apple Inc..

Selected publications and collaborations

Demaine's publications include influential conference papers and journal articles in venues such as the Journal of the ACM, SIAM Journal on Computing, Discrete & Computational Geometry, and proceedings of the STOC, FOCS, and SoCG conferences. He has coauthored books and monographs with collaborators including Joseph O'Rourke, Martin Demaine, and colleagues from MIT and Harvard, and maintains collaborations with researchers at ETH Zurich, EPFL, Yale University, and Carnegie Mellon University. Representative topics covered in his bibliography include algorithmic origami, hinged dissections, geometric folding algorithms, and computational complexity of puzzles, reflecting a cross-disciplinary portfolio that connects theoretical computer science with art and engineering.

Category:Computer scientists Category:Computational geometers