| PSPACE-Completeness of Reversible Deterministic Systems | 0 | 0.34 | 2022 |
| Turning Around and Around - Motion Planning through Thick and Thin Turnstiles. | 0 | 0.34 | 2021 |
| Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect | 0 | 0.34 | 2020 |
| New Results in Sona Drawing: Hardness and TSP Separation | 0 | 0.34 | 2020 |
| Rectangular Unfoldings of Polycubes. | 0 | 0.34 | 2019 |
| PSPACE-complete two-color planar placement games | 0 | 0.34 | 2019 |
| Single-Player and Two-Player Buttons & Scissors Games. | 0 | 0.34 | 2016 |
| Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). | 0 | 0.34 | 2015 |
| Covering Points with Disjoint Unit Disks. | 0 | 0.34 | 2012 |
| Constraint Logic: A Uniform Framework for Modeling Computation as Games | 12 | 1.18 | 2008 |
| Learning Hierarchical Representations and Behaviors. | 2 | 0.38 | 2008 |
| Models of thalamocortical system | 2 | 0.44 | 2007 |
| Amazons is PSPACE-complete | 4 | 0.56 | 2005 |
| PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation | 92 | 5.96 | 2005 |
| Hinged Dissection of Polygons is Hard | 1 | 0.37 | 2003 |
| Push-2-f is pspace-complete | 9 | 0.75 | 2002 |
| The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications | 7 | 1.40 | 2002 |
| Playing Games with Algorithms: Algorithmic Combinatorial Game Theory | 40 | 6.43 | 2001 |
