( en | de | ru )

 

Disambiguation of "Hearn, Robert A."

Author of the publication

copydeleteadd this publication to your clipboard
New Results in Sona Drawing: Hardness and TSP Separation.

, , , , , , , , and . CCCG, page 63-72. (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arthur Hearnden

Robert A Bergonzi

Robert A Pesarchick

Robert A Willingham

Robert A Dickler

 

Other publications of authors with the same name

Learning Hierarchical Representations and Behaviors., and . AAAI Fall Symposium: Naturally-Inspired Artificial Intelligence, volume FS-08-06 of AAAI Technical Report, page 65-66. AAAI, (2008)Single-Player and Two-Player Buttons & Scissors Games., , , , , , , , , and 5 other author(s). CoRR, (2016)Two-Disk Compound Symmetry Groups., , , , and . CoRR, (2023)Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect., , , , and . Theor. Comput. Sci., (2020)Covering Points with Disjoint Unit Disks., , , and . CCCG, page 41-46. (2012)New Results in Sona Drawing: Hardness and TSP Separation., , , , , , , , and . CCCG, page 63-72. (2020)Constraint Logic: A Uniform Framework for Modeling Computation as Games., and . CCC, page 149-162. IEEE Computer Society, (2008)Turning Around and Around: Motion Planning through Thick and Thin Turnstiles., , , , , , , and . CCCG, page 377-387. (2021)Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect., , , , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 365-377. Springer, (2018)Games, puzzles, and computation.. Massachusetts Institute of Technology, Cambridge, MA, USA, (2006)ndltd.org (oai:dspace.mit.edu:1721.1/37913).