Paper by Erik D. Demaine

Reference:

Erik D. Demaine, “Algorithms Meet Art, Puzzles, and Magic”, in Proceedings of the 11th Algorithms and Data Structures Symposium (WADS 2009), Lecture Notes in Computer Science, volume 5664, Banff, Alberta, Canada, August 21–23, 2009, pages 193.

BibTeX

@InProceedings{WADS2009i,
  AUTHOR        = {Erik D. Demaine},
  TITLE         = {Algorithms Meet Art, Puzzles, and Magic},
  BOOKTITLE     = {Proceedings of the 11th Algorithms and Data Structures
                   Symposium (WADS 2009)},
  bookurl       = {http://www.wads.org/},
  SERIES        = {Lecture Notes in Computer Science},
  seriesurl     = {http://www.springer.de/comp/lncs/},
  VOLUME        = 5664,
  ADDRESS       = {Banff, Alberta, Canada},
  MONTH         = {August 21--23},
  YEAR          = 2009,
  PAGES         = {193},

  doi           = {https://dx.doi.org/10.1007/978-3-642-03367-4_17},
  dblp          = {https://dblp.org/rec/conf/wads/Demaine09},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1007/978-3-642-03367-4_17">SpringerLink</A>.},
  paperkind     = {abstract},
  length        = {1 page},
  unrefereed    = 1,
  copyright     = {Copyright held by the author.},
  category      = {art},
}

Comments:

This paper is also available from SpringerLink.

Copyright:

Copyright held by the author.

Length:

The abstract is 1 page.

Availability:

The abstract is available in PostScript (65k) and PDF (33k).

See information on file formats.

[Google Scholar search]