default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert A. Hearn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
[b2]Robert A. Hearn, Erik D. Demaine:
Games, puzzles and computation. A K Peters 2009, ISBN 978-1-56881-322-6, pp. I-IX, 1-237- 2006
- [b1]Robert A. Hearn:
Games, puzzles, and computation. Massachusetts Institute of Technology, Cambridge, MA, USA, 2006
Journal Articles
- 2020
- [j5]Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. J. Inf. Process. 28: 841-845 (2020) - [j4]Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow:
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect. Theor. Comput. Sci. 806: 332-343 (2020) - 2019
- [j3]Kyle Burke
, Robert A. Hearn:
PSPACE-complete two-color planar placement games. Int. J. Game Theory 48(2): 393-410 (2019) - 2007
- [j2]Richard H. Granger, Robert A. Hearn:
Models of thalamocortical system. Scholarpedia 2(11): 1796 (2007) - 2005
- [j1]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)
Conference and Workshop Papers
- 2022
- [c12]Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. MCU 2022: 91-108 - 2021
- [c11]Aster Greenblatt, Oscar I. Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow:
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. CCCG 2021: 377-387 - 2020
- [c10]Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CCCG 2020: 63-72 - 2019
- [c9]Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. CCCG 2019: 159-163 - 2018
- [c8]Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow:
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. COCOON 2018: 365-377 - 2015
- [c7]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:
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - 2012
- [c6]Greg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara:
Covering Points with Disjoint Unit Disks. CCCG 2012: 41-46 - 2008
- [c5]Robert A. Hearn, Richard H. Granger:
Learning Hierarchical Representations and Behaviors. AAAI Fall Symposium: Naturally-Inspired Artificial Intelligence 2008: 65-66 - [c4]Erik D. Demaine, Robert A. Hearn:
Constraint Logic: A Uniform Framework for Modeling Computation as Games. CCC 2008: 149-162 - 2003
- [c3]Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson:
Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102 - 2002
- [c2]Erik D. Demaine, Robert A. Hearn, Michael Hoffmann:
Push-2-f is pspace-complete. CCCG 2002: 31-35 - [c1]Robert A. Hearn, Erik D. Demaine:
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. ICALP 2002: 401-413
Informal and Other Publications
- 2023
- [i7]Robert A. Hearn, William Kretschmer, Tomas Rokicki, Benjamin Streeter, Eric Vergo:
Two-Disk Compound Symmetry Groups. CoRR abs/2302.12950 (2023) - 2022
- [i6]Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch:
PSPACE-Completeness of Reversible Deterministic Systems. CoRR abs/2207.07229 (2022) - 2020
- [i5]Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy:
New Results in Sona Drawing: Hardness and TSP Separation. CoRR abs/2007.15784 (2020) - 2018
- [i4]Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow:
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. CoRR abs/1805.04055 (2018) - 2016
- [i3]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:
Single-Player and Two-Player Buttons & Scissors Games. CoRR abs/1607.01826 (2016) - 2005
- [i2]Robert A. Hearn:
Amazons is PSPACE-complete. CoRR abs/cs/0502013 (2005) - 2002
- [i1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
