Robert A. Hearn

	2009
9		Robert A. Hearn, Erik D. Demaine: Games, puzzles and computation. A K Peters 2009: I-IX, 1-237
	2008
8		Erik D. Demaine, Robert A. Hearn: Constraint Logic: A Uniform Framework for Modeling Computation as Games. IEEE Conference on Computational Complexity 2008: 149-162
	2007
7		Richard H. Granger, Robert A. Hearn: Models of thalamocortical system. Scholarpedia 2(11): 1796 (2007)
	2005
6		Robert A. Hearn: Amazons is PSPACE-complete CoRR abs/cs/0502013: (2005)
5		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)
	2003
4		Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson: Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102
	2002
3		Erik D. Demaine, Robert A. Hearn, Michael Hoffmann: Push-2-f is pspace-complete. CCCG 2002: 31-35
2		Robert A. Hearn, Erik D. Demaine: The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. ICALP 2002: 401-413
1		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

1	Erik D. Demaine	[1] [2] [3] [4] [5] [8] [9]
2	Greg N. Frederickson	[4]
3	Richard Granger (Richard H. Granger)	[7]
4	Michael Hoffmann	[3]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page