| |
| 2008 | ||
|---|---|---|
| 8 | EE | Erik D. Demaine, Robert A. Hearn: Constraint Logic: A Uniform Framework for Modeling Computation as Games. IEEE Conference on Computational Complexity 2008: 149-162 |
| 2007 | ||
| 7 | EE | Richard H. Granger, Robert A. Hearn: Models of thalamocortical system. Scholarpedia 2(11): 1796 (2007) |
| 2005 | ||
| 6 | EE | Robert A. Hearn: Amazons is PSPACE-complete CoRR abs/cs/0502013: (2005) |
| 5 | EE | Robert A. Hearn, Erik D. Demaine: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1-2): 72-96 (2005) |
| 2003 | ||
| 4 | Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson: Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102 | |
| 2002 | ||
| 3 | EE | Erik D. Demaine, Robert A. Hearn, Michael Hoffmann: Push-2-f is pspace-complete. CCCG 2002: 31-35 |
| 2 | EE | Robert A. Hearn, Erik D. Demaine: The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. ICALP 2002: 401-413 |
| 1 | EE | Robert A. Hearn, Erik D. Demaine: PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation CoRR cs.CC/0205005: (2002) |
| 1 | Erik D. Demaine | [1] [2] [3] [4] [5] [8] |
| 2 | Greg N. Frederickson | [4] |
| 3 | Richard Granger (Richard H. Granger) | [7] |
| 4 | Michael Hoffmann | [3] |