Changes

* [[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]], [https://en.wikipedia.org/wiki/Yair_Minsky Yair N. Minsky], [[Mathematician#JSBMitchell|Joseph S. B. Mitchell]], [[Ronald L. Rivest]], [[Mathematician#MPatrascu|Mihai Pătrașcu]] ('''2012'''). ''Picture-Hanging Puzzles.''. [https://arxiv.org/abs/1203.3602 arXiv:1203.3602]

* [[Erik D. Demaine]], [[Mathematician#JIacono|John Iacono]], [[Stefan Langerman]], [[Mathematician#OOzkan|Ö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]], [[Mathematician#JIacono|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=