Robert A. Hearn

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Two-Disk Compound Symmetry Groups.

Robert A. Hearn, William Kretschmer, Tomas Rokicki, Benjamin Streeter, Eric Vergo

CoRR, 2023

2022

PSPACE-Completeness of Reversible Deterministic Systems.

Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch

Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022

2021

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, Andrew Winslow

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

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

Rectangular Unfoldings of Polycubes.

Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara

J. Inf. Process., 2020

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

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

PSPACE-complete two-color planar placement games.

Kyle Burke, Robert A. Hearn

Int. J. Game Theory, 2019

Rectangular Unfoldings of Polycubes.

Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2016

Single-Player and Two-Player Buttons & Scissors Games.

Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams

CoRR, 2016

2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2012

Covering Points with Disjoint Unit Disks.

Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2009

Games, puzzles and computation.

Robert A. Hearn, Erik D. Demaine

A K Peters, ISBN: 978-1-56881-322-6, 2009

2008

Constraint Logic: A Uniform Framework for Modeling Computation as Games.

Erik D. Demaine, Robert A. Hearn

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

Learning Hierarchical Representations and Behaviors.

Robert A. Hearn, Richard H. Granger

Proceedings of the Naturally-Inspired Artificial Intelligence, 2008

2007

Models of thalamocortical system.

Richard H. Granger, Robert A. Hearn

Scholarpedia, 2007

2006

Games, puzzles, and computation.

Robert A. Hearn

PhD thesis, 2006

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

Amazons is PSPACE-complete

Robert A. Hearn

CoRR, 2005

2003

Hinged Dissection of Polygons is Hard.

Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.

Robert A. Hearn, Erik D. Demaine

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Push-2-f is pspace-complete.

Erik D. Demaine, Robert A. Hearn, Michael Hoffmann

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002