| PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation RA Hearn, ED Demaine Theoretical Computer Science 343 (1-2), 72-96, 2005 | 397 | 2005 |
| Games, puzzles, and computation RA Hearn, ED Demaine CRC Press, 2009 | 367 | 2009 |
| The nondeterministic constraint logic model of computation: Reductions and applications RA Hearn, ED Demaine Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002 | 43 | 2002 |
| Constraint logic: A uniform framework for modeling computation as games ED Demaine, RA Hearn 2008 23rd Annual IEEE Conference on Computational Complexity, 149-162, 2008 | 41 | 2008 |
| Push-2-f is pspace-complete. ED Demaine, RA Hearn, M Hoffmann CCCG, 31-35, 2002 | 36 | 2002 |
| Amazons, Konane, and cross purposes are PSPACE-complete RA Hearn Games of No Chance III, Proc. BIRS Workshop on Combinatorial Games, 287-306, 2005 | 35 | 2005 |
| TipOver is NP-complete RA Hearn Mathematical Intelligencer 28 (3), 10-14, 2006 | 20* | 2006 |
| The complexity of sliding block puzzles and plank puzzles RA Hearn Tribute to a Mathemagician, 173-183, 2005 | 19 | 2005 |
| Models of thalamocortical system RH Granger, RA Hearn Scholarpedia 2 (11), 1796, 2007 | 18 | 2007 |
| Amazons is PSPACE-complete RA Hearn arXiv preprint cs/0502013, 2005 | 12 | 2005 |
| Demaine ED PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation RA Hearn Theor. Comput. Sci 343, 1-2, 2005 | 12 | 2005 |
| PSPACE-complete two-color planar placement games K Burke, RA Hearn International Journal of Game Theory 48, 393-410, 2019 | 9 | 2019 |
| Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect J Cardinal, ED Demaine, D Eppstein, RA Hearn, A Winslow Theoretical Computer Science 806, 332-343, 2020 | 8 | 2020 |
| Single-player and two-player buttons & scissors games K Burke, ED Demaine, H Gregg, RA Hearn, A Hesterberg, M Hoffmann, ... Japanese Conference on Discrete and Computational Geometry and Graphs, 60-72, 2015 | 8 | 2015 |
| Computation RA Hearn, P Games Department of Electrical Engineering and Computer Science, Massachusetts …, 2006 | 8 | 2006 |
| Hinged Dissection of Polygons is Hard. RA Hearn, ED Demaine, GN Frederickson CCCG, 98-102, 2003 | 8 | 2003 |
| PSPACE-completeness of reversible deterministic systems ED Demaine, RA Hearn, D Hendrickson, J Lynch International Journal of Foundations of Computer Science, 1-22, 2023 | 7 | 2023 |
| Covering Points with Disjoint Unit Disks. G Aloupis, RA Hearn, H Iwasawa, R Uehara CCCG, 41-46, 2012 | 7 | 2012 |
| Learning Hierarchical Representations and Behaviors. RA Hearn, RH Granger AAAI Fall Symposium: Naturally-Inspired Artificial Intelligence, 65-66, 2008 | 7 | 2008 |
| The complexity of the Dyson Telescopes puzzle ED Demaine, ML Demaine, R Fleischer, RA Hearn, T von Oertzen Games of No Chance 3, Proc. BIRS Workshop on Combinatorial Games, 271-285, 2005 | 6 | 2005 |
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technologyبريد إلكتروني تم التحقق منه على mit.edu