25,161
edits
Changes
Created page with "'''Home * People * Erik D. Demaine''' FILE:Erik Demaine et al 2005 cropped.jpg|border|right|thumb| Demaines, Spight and Conway <ref>[[Erik D. Demaine|Erik..."
'''[[Main Page|Home]] * [[People]] * Erik D. Demaine'''
[[FILE:Erik Demaine et al 2005 cropped.jpg|border|right|thumb| Demaines, Spight and Conway <ref>[[Erik D. Demaine|Erik Demaine]] (left) with [[Martin L. Demaine|Martin Demaine]] (center) and [[Bill Spight]] (background) watch [[John H. Conway|John Conway]] (foreground) do a [https://en.wikipedia.org/wiki/Card_manipulation card trick] at Workshop on [https://en.wikipedia.org/wiki/Combinatorial_game_theory Combinatorial Game Theory] at [https://en.wikipedia.org/wiki/Banff_International_Research_Station Banff International Research Station], June, 2005, Photo by [https://www.flickr.com/photos/thane Thane Plambeck], June 21 2005, [https://en.wikipedia.org/wiki/Erik_Demaine Erik Demaine from Wikipedia]</ref> ]]
'''Erik D. Demaine''',<br/>
a Canadian American mathematician, computer scientist and professor of computer science at [[Massachusetts Institute of Technology]] and member of the [https://en.wikipedia.org/wiki/Theory_of_computation Theory of Computation] group at [https://en.wikipedia.org/wiki/MIT_Computer_Science_and_Artificial_Intelligence_Laboratory MIT Computer Science and Artificial Intelligence Laboratory].
His research include the [https://en.wikipedia.org/wiki/Mathematics_of_paper_folding mathematics of paper folding] as well as [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorial game theory].
Mathematical origami artwork by Erik and his father [[Martin L. Demaine]] was part of the ''Design and the Elastic Mind'' exhibit at the [https://en.wikipedia.org/wiki/Museum_of_Modern_Art Museum of Modern Art] in 2008 <ref>[http://erikdemaine.org/curved/MoMA/ Computational Origami (2008): Curved-Crease Sculpture by Erik and Martin Demaine]</ref>.
=Selected Publications=
<ref>[http://erikdemaine.org/papers/ Erik Demaine's Papers]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/d/Demaine:Erik_D= dblp: Erik D. Demaine]</ref>
==1998 ...==
* [[Erik D. Demaine]] ('''1998'''). ''[http://erikdemaine.org/papers/IPPS98/ Protocols for Non-Deterministic Communication over Synchronous Channels]. [https://dblp.uni-trier.de/db/conf/ipps/ipps1998.html IPPS/SPDP 1998]
* [[Erik D. Demaine]], [[Martin L. Demaine]], [[Mathematician#ALubiw|Anna Lubiw]] ('''1998'''). ''[http://erikdemaine.org/papers/JCDCG98/ Folding and Cutting Paper]''. [https://dblp.uni-trier.de/db/conf/jcdcg/jcdcg1998.html JCDCG 1998]
* [[Erik D. Demaine]], [[Martin L. Demaine]] ('''1998'''). ''[http://erikdemaine.org/papers/GD98/ Planar Drawings of Origami Polyhedra]''. [https://dblp.uni-trier.de/db/conf/gd/gd98.html GD 1998], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 1547, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Erik D. Demaine]] ('''1998'''). ''[http://erikdemaine.org/papers/CPE98/ C to Java: Converting Pointers into References]''. [https://dblp.org/db/journals/concurrency/concurrency10.html Concurrency: Practice and Experience, Vol. 10], Nos. 11-13
* [[Erik D. Demaine]], [[Mathematician#JIMunro|J. Ian Munro]] ('''1999'''). ''[http://erikdemaine.org/papers/Buddy_FSTTCS99/ Fast Allocation and Deallocation with an Improved Buddy System]''. [https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs99.html FSTTCS 1999], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 1738, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer] <ref>[https://en.wikipedia.org/wiki/Buddy_memory_allocation Buddy memory allocation from Wikipedia]</ref>
==2000 ...==
* [[Erik D. Demaine]] ('''2000'''). ''[http://erikdemaine.org/papers/JCDCG2000b/ Folding and Unfolding Linkages, Paper, and Polyhedra]''. [https://dblp.uni-trier.de/db/conf/jcdcg/jcdcg2000.html JCDCG 2000], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 2098, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Erik D. Demaine]] ('''2001'''). ''[http://erikdemaine.org/papers/dthesis/ Folding and Unfolding]''. Ph.D. thesis, [[University of Waterloo]], advisors [[Mathematician#ALubiw|Anna Lubiw]], [[Mathematician#JIMunro|James Ian Munro]]
* [[Erik D. Demaine]], [[Martin L. Demaine]], [[Rudolf Fleischer]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_13 Solitaire Clobber]''. [[CG 2002]]
* [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2003'''). ''Tetris is Hard, Even to Approximate''. [http://www.informatik.uni-trier.de/~ley/db/conf/cocoon/cocoon2003.html COCOON 2003], slides as [http://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf)
* [http://www.informatik.uni-trier.de/~ley/pers/hd/b/Breukelaar:Ron Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''Tetris is hard, even to approximate''. [http://www.worldscientific.com/worldscinet/ijcga International Journal of Computational Geometry & Applications], Vol. 14
* [[Erik D. Demaine]], [[Martin L. Demaine]] ('''2004'''). ''[http://erikdemaine.org/papers/FoldCut_G4G5/ Fold-and-Cut Magic]''. in [http://erikdemaine.org/papers/Gardner5/ Tribute to a Mathemagician]''. [https://en.wikipedia.org/wiki/A_K_Peters A K Peters]
* [[Erik D. Demaine]], [[Martin L. Demaine]] ('''2004'''). ''[http://erikdemaine.org/papers/SlidingCoins_G4G5/ Sliding-Coin Puzzles]''. in [http://erikdemaine.org/papers/Gardner5/ Tribute to a Mathemagician]''. [https://en.wikipedia.org/wiki/A_K_Peters A K Peters]
* [[Mathematician#RHearn|Robert A. Hearn]], [[Erik D. Demaine]] ('''2009'''). ''[http://erikdemaine.org/papers/GPC/ Games, Puzzles, and Computation]''. [https://en.wikipedia.org/wiki/A_K_Peters A K Peters]
==2010 ...==
* [[Erik D. Demaine]], [[Martin L. Demaine]], [https://en.wikipedia.org/wiki/Yair_Minsky Yair N. Minsky], [[Mathematician#JSBMitchell|Joseph S. B. Mitchell]], [[Ronald L. Rivest]], [https://en.wikipedia.org/wiki/Mihai_P%C4%83tra%C8%99cu Mihai Pătrașcu] ('''2012'''). ''Picture-Hanging Puzzles.''. [https://arxiv.org/abs/1203.3602 arXiv:1203.3602]
* [[Erik D. Demaine]], [https://dblp.uni-trier.de/pers/hd/i/Iacono:John John Iacono], [[Stefan Langerman]], [https://dblp.uni-trier.de/pers/hd/=/=Ouml=zkan:=Ouml=zg=uuml=r Özgür Özkan] ('''2013'''). ''Combining Binary Search Trees''. [https://arxiv.org/abs/1304.7604 arXiv:1304.7604]
* [[Erik D. Demaine]], [https://dblp.uni-trier.de/pers/hd/l/Lincoln:Andrea Andrea Lincoln], [https://dblp.uni-trier.de/pers/hd/l/Liu:Quanquan_C= Quanquan C. Liu], [https://dblp.uni-trier.de/pers/hd/l/Lynch:Jayson Jayson Lynch], [https://dblp.uni-trier.de/pers/hd/w/Williams:Virginia_Vassilevska Virginia Vassilevska Williams] ('''2017'''). ''Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy''. [https://arxiv.org/abs/1711.07960 arXiv:1711.07960]
* [https://dblp.uni-trier.de/pers/hd/b/Bosboom:Jeffrey Jeffrey Bosboom], [https://dblp.uni-trier.de/pers/hd/c/Congero:Spencer Spencer Congero], [[Erik D. Demaine]], [[Martin L. Demaine]], [https://dblp.uni-trier.de/pers/hd/l/Lynch:Jayson Jayson Lynch] ('''2018'''). ''Losing at Checkers is Hard''. [https://arxiv.org/abs/1806.05657 arXiv:1806.05657]
* [[Erik D. Demaine]], [https://dblp.uni-trier.de/pers/hd/i/Iacono:John John Iacono], [https://dblp.uni-trier.de/pers/hd/k/Koumoutsos:Grigorios Grigorios Koumoutsos], [[Stefan Langerman]] ('''2019'''). ''Belga B-trees''. [http://export.arxiv.org/abs/1903.03560 arXiv:1903.03560]
=External Links=
* [http://erikdemaine.org/ Erik Demaine]
* [https://en.wikipedia.org/wiki/Erik_Demaine Erik Demaine from Wikipedia]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=65084 Erik Demaine - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Demaine]]
[[Category:Researcher|Demaine]]
[[FILE:Erik Demaine et al 2005 cropped.jpg|border|right|thumb| Demaines, Spight and Conway <ref>[[Erik D. Demaine|Erik Demaine]] (left) with [[Martin L. Demaine|Martin Demaine]] (center) and [[Bill Spight]] (background) watch [[John H. Conway|John Conway]] (foreground) do a [https://en.wikipedia.org/wiki/Card_manipulation card trick] at Workshop on [https://en.wikipedia.org/wiki/Combinatorial_game_theory Combinatorial Game Theory] at [https://en.wikipedia.org/wiki/Banff_International_Research_Station Banff International Research Station], June, 2005, Photo by [https://www.flickr.com/photos/thane Thane Plambeck], June 21 2005, [https://en.wikipedia.org/wiki/Erik_Demaine Erik Demaine from Wikipedia]</ref> ]]
'''Erik D. Demaine''',<br/>
a Canadian American mathematician, computer scientist and professor of computer science at [[Massachusetts Institute of Technology]] and member of the [https://en.wikipedia.org/wiki/Theory_of_computation Theory of Computation] group at [https://en.wikipedia.org/wiki/MIT_Computer_Science_and_Artificial_Intelligence_Laboratory MIT Computer Science and Artificial Intelligence Laboratory].
His research include the [https://en.wikipedia.org/wiki/Mathematics_of_paper_folding mathematics of paper folding] as well as [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorial game theory].
Mathematical origami artwork by Erik and his father [[Martin L. Demaine]] was part of the ''Design and the Elastic Mind'' exhibit at the [https://en.wikipedia.org/wiki/Museum_of_Modern_Art Museum of Modern Art] in 2008 <ref>[http://erikdemaine.org/curved/MoMA/ Computational Origami (2008): Curved-Crease Sculpture by Erik and Martin Demaine]</ref>.
=Selected Publications=
<ref>[http://erikdemaine.org/papers/ Erik Demaine's Papers]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/d/Demaine:Erik_D= dblp: Erik D. Demaine]</ref>
==1998 ...==
* [[Erik D. Demaine]] ('''1998'''). ''[http://erikdemaine.org/papers/IPPS98/ Protocols for Non-Deterministic Communication over Synchronous Channels]. [https://dblp.uni-trier.de/db/conf/ipps/ipps1998.html IPPS/SPDP 1998]
* [[Erik D. Demaine]], [[Martin L. Demaine]], [[Mathematician#ALubiw|Anna Lubiw]] ('''1998'''). ''[http://erikdemaine.org/papers/JCDCG98/ Folding and Cutting Paper]''. [https://dblp.uni-trier.de/db/conf/jcdcg/jcdcg1998.html JCDCG 1998]
* [[Erik D. Demaine]], [[Martin L. Demaine]] ('''1998'''). ''[http://erikdemaine.org/papers/GD98/ Planar Drawings of Origami Polyhedra]''. [https://dblp.uni-trier.de/db/conf/gd/gd98.html GD 1998], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 1547, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Erik D. Demaine]] ('''1998'''). ''[http://erikdemaine.org/papers/CPE98/ C to Java: Converting Pointers into References]''. [https://dblp.org/db/journals/concurrency/concurrency10.html Concurrency: Practice and Experience, Vol. 10], Nos. 11-13
* [[Erik D. Demaine]], [[Mathematician#JIMunro|J. Ian Munro]] ('''1999'''). ''[http://erikdemaine.org/papers/Buddy_FSTTCS99/ Fast Allocation and Deallocation with an Improved Buddy System]''. [https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs99.html FSTTCS 1999], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 1738, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer] <ref>[https://en.wikipedia.org/wiki/Buddy_memory_allocation Buddy memory allocation from Wikipedia]</ref>
==2000 ...==
* [[Erik D. Demaine]] ('''2000'''). ''[http://erikdemaine.org/papers/JCDCG2000b/ Folding and Unfolding Linkages, Paper, and Polyhedra]''. [https://dblp.uni-trier.de/db/conf/jcdcg/jcdcg2000.html JCDCG 2000], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 2098, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Erik D. Demaine]] ('''2001'''). ''[http://erikdemaine.org/papers/dthesis/ Folding and Unfolding]''. Ph.D. thesis, [[University of Waterloo]], advisors [[Mathematician#ALubiw|Anna Lubiw]], [[Mathematician#JIMunro|James Ian Munro]]
* [[Erik D. Demaine]], [[Martin L. Demaine]], [[Rudolf Fleischer]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_13 Solitaire Clobber]''. [[CG 2002]]
* [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2003'''). ''Tetris is Hard, Even to Approximate''. [http://www.informatik.uni-trier.de/~ley/db/conf/cocoon/cocoon2003.html COCOON 2003], slides as [http://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf)
* [http://www.informatik.uni-trier.de/~ley/pers/hd/b/Breukelaar:Ron Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''Tetris is hard, even to approximate''. [http://www.worldscientific.com/worldscinet/ijcga International Journal of Computational Geometry & Applications], Vol. 14
* [[Erik D. Demaine]], [[Martin L. Demaine]] ('''2004'''). ''[http://erikdemaine.org/papers/FoldCut_G4G5/ Fold-and-Cut Magic]''. in [http://erikdemaine.org/papers/Gardner5/ Tribute to a Mathemagician]''. [https://en.wikipedia.org/wiki/A_K_Peters A K Peters]
* [[Erik D. Demaine]], [[Martin L. Demaine]] ('''2004'''). ''[http://erikdemaine.org/papers/SlidingCoins_G4G5/ Sliding-Coin Puzzles]''. in [http://erikdemaine.org/papers/Gardner5/ Tribute to a Mathemagician]''. [https://en.wikipedia.org/wiki/A_K_Peters A K Peters]
* [[Mathematician#RHearn|Robert A. Hearn]], [[Erik D. Demaine]] ('''2009'''). ''[http://erikdemaine.org/papers/GPC/ Games, Puzzles, and Computation]''. [https://en.wikipedia.org/wiki/A_K_Peters A K Peters]
==2010 ...==
* [[Erik D. Demaine]], [[Martin L. Demaine]], [https://en.wikipedia.org/wiki/Yair_Minsky Yair N. Minsky], [[Mathematician#JSBMitchell|Joseph S. B. Mitchell]], [[Ronald L. Rivest]], [https://en.wikipedia.org/wiki/Mihai_P%C4%83tra%C8%99cu Mihai Pătrașcu] ('''2012'''). ''Picture-Hanging Puzzles.''. [https://arxiv.org/abs/1203.3602 arXiv:1203.3602]
* [[Erik D. Demaine]], [https://dblp.uni-trier.de/pers/hd/i/Iacono:John John Iacono], [[Stefan Langerman]], [https://dblp.uni-trier.de/pers/hd/=/=Ouml=zkan:=Ouml=zg=uuml=r Özgür Özkan] ('''2013'''). ''Combining Binary Search Trees''. [https://arxiv.org/abs/1304.7604 arXiv:1304.7604]
* [[Erik D. Demaine]], [https://dblp.uni-trier.de/pers/hd/l/Lincoln:Andrea Andrea Lincoln], [https://dblp.uni-trier.de/pers/hd/l/Liu:Quanquan_C= Quanquan C. Liu], [https://dblp.uni-trier.de/pers/hd/l/Lynch:Jayson Jayson Lynch], [https://dblp.uni-trier.de/pers/hd/w/Williams:Virginia_Vassilevska Virginia Vassilevska Williams] ('''2017'''). ''Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy''. [https://arxiv.org/abs/1711.07960 arXiv:1711.07960]
* [https://dblp.uni-trier.de/pers/hd/b/Bosboom:Jeffrey Jeffrey Bosboom], [https://dblp.uni-trier.de/pers/hd/c/Congero:Spencer Spencer Congero], [[Erik D. Demaine]], [[Martin L. Demaine]], [https://dblp.uni-trier.de/pers/hd/l/Lynch:Jayson Jayson Lynch] ('''2018'''). ''Losing at Checkers is Hard''. [https://arxiv.org/abs/1806.05657 arXiv:1806.05657]
* [[Erik D. Demaine]], [https://dblp.uni-trier.de/pers/hd/i/Iacono:John John Iacono], [https://dblp.uni-trier.de/pers/hd/k/Koumoutsos:Grigorios Grigorios Koumoutsos], [[Stefan Langerman]] ('''2019'''). ''Belga B-trees''. [http://export.arxiv.org/abs/1903.03560 arXiv:1903.03560]
=External Links=
* [http://erikdemaine.org/ Erik Demaine]
* [https://en.wikipedia.org/wiki/Erik_Demaine Erik Demaine from Wikipedia]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=65084 Erik Demaine - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Demaine]]
[[Category:Researcher|Demaine]]
