Push-2-f is pspace-complete. - Erik D. Demaine; Robert A. Hearn; Michael Hoffmann 001 (CCCG, 2002)

The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. - Robert A. Hearn; Erik D. Demaine (ICALP, 2002)

Hinged Dissection of Polygons is Hard. - Robert A. Hearn; Erik D. Demaine; Greg N. Frederickson (CCCG, 2003)

Amazons is PSPACE-complete - Robert A. Hearn (CoRR, 2005)

PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. - Robert A. Hearn; Erik D. Demaine (Theor. Comput. Sci., 2005)

Games, puzzles, and computation. - Robert A. Hearn (2006)

Models of thalamocortical system. - Richard H. Granger; Robert A. Hearn (Scholarpedia, 2007)

Learning Hierarchical Representations and Behaviors. - Robert A. Hearn; Richard H. Granger (AAAI Fall Symposium: Naturally-Inspired Artificial Intelligence, 2008)

Constraint Logic: A Uniform Framework for Modeling Computation as Games. - Erik D. Demaine; Robert A. Hearn (CCC, 2008)

Games, puzzles and computation. - Robert A. Hearn; Erik D. Demaine (A K Peters, 2009)

Covering Points with Disjoint Unit Disks. - Greg Aloupis; Robert A. Hearn; Hirokazu Iwasawa; Ryuhei Uehara (CCCG, 2012)

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

Rectangular Unfoldings of Polycubes. - Martin L. Demaine; Robert A. Hearn; Jason S. Ku; Ryuhei Uehara (CCCG, 2019)

PSPACE-complete two-color planar placement games. - Kyle Burke; Robert A. Hearn (Int. J. Game Theory, 2019)

New Results in Sona Drawing: Hardness and TSP Separation. - Man-Kwun Chiu; Erik D. Demaine; Yevhenii Diomidov; David Eppstein; Robert A. Hearn; Adam Hesterberg; Matias Korman; Irene Parada; Mikhail Rudoy (CCCG, 2020)

Rectangular Unfoldings of Polycubes. - Martin L. Demaine; Robert A. Hearn; Junnosuke Hoshido; Jason S. Ku; Ryuhei Uehara (J. Inf. Process., 2020)

Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. - Jean Cardinal; Erik D. Demaine; David Eppstein; Robert A. Hearn; Andrew Winslow (Theor. Comput. Sci., 2020)

Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. - Aster Greenblatt; Oscar I. Hernandez; Robert A. Hearn; Yichao Hou; Hiro Ito; Minwoo Kang; Aaron Williams 001; Andrew Winslow (CCCG, 2021)

PSPACE-Completeness of Reversible Deterministic Systems. - Erik D. Demaine; Robert A. Hearn; Dylan H. Hendrickson; Jayson Lynch (MCU, 2022)

Two-Disk Compound Symmetry Groups. - Robert A. Hearn; William Kretschmer; Tomas Rokicki; Benjamin Streeter; Eric Vergo (CoRR, 2023)