Robert A. Hearn

Orcid: 0000-0003-4499-9525

According to our database1, Robert A. Hearn authored at least 21 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Two-Disk Compound Symmetry Groups.
CoRR, 2023

2022
PSPACE-Completeness of Reversible Deterministic Systems.
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022

2021
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
Rectangular Unfoldings of Polycubes.
J. Inf. Process., 2020

New Results in Sona Drawing: Hardness and TSP Separation.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
PSPACE-complete two-color planar placement games.
Int. J. Game Theory, 2019

Rectangular Unfoldings of Polycubes.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2016
Single-Player and Two-Player Buttons & Scissors Games.
CoRR, 2016

2015
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2012
Covering Points with Disjoint Unit Disks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2009
Games, puzzles and computation.
A K Peters, ISBN: 978-1-56881-322-6, 2009

2008
Constraint Logic: A Uniform Framework for Modeling Computation as Games.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

Learning Hierarchical Representations and Behaviors.
Proceedings of the Naturally-Inspired Artificial Intelligence, 2008

2007
Models of thalamocortical system.
Scholarpedia, 2007

2006
Games, puzzles, and computation.
PhD thesis, 2006

2005
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation.
Theor. Comput. Sci., 2005

Amazons is PSPACE-complete
CoRR, 2005

2003
Hinged Dissection of Polygons is Hard.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Push-2-f is pspace-complete.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002


  Loading...