Paper by Erik D. Demaine

Reference:

Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor Fekete, Christian Knauer, André Schulz, and Perouz Taslakian, “On Rolling Cube Puzzles”, in Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007), Ottawa, Ontario, Canada, August 20–22, 2007.

BibTeX

@InProceedings{DiceRolling_CCCG2007,
  AUTHOR        = {Kevin Buchin and Maike Buchin and Erik D. Demaine and
                   Martin L. Demaine and Dania El-Khechen and S\'andor Fekete
                   and Christian Knauer and Andr\'e Schulz and
                   Perouz Taslakian},
  TITLE         = {On Rolling Cube Puzzles},
  BOOKTITLE     = {Proceedings of the 19th Canadian Conference on
                   Computational Geometry (CCCG 2007)},
  bookurl       = {http://2007.cccg.ca/},
  ADDRESS       = {Ottawa, Ontario, Canada},
  MONTH         = {August 20--22},
  YEAR          = 2007,

  dblp          = {https://dblp.org/rec/conf/cccg/BuchinBDDEFKST07},
  ee            = {http://cccg.ca/proceedings/2007/05b5.pdf},
  comments      = {A <A HREF="short.pdf">short version of the paper</A> appeared
                   on pages 141-144.},
  length        = {30 pages},
  unrefereed    = 1,
}

Abstract:

We analyze the computational complexity of various rolling cube puzzles.

Comments:

A short version of the paper appeared on pages 141-144.

Length:

The paper is 30 pages.

Availability:

The paper is available in PDF (519k).

See information on file formats.

[Google Scholar search]