Paper by Erik D. Demaine

Reference:

MIT Hardness Group, Josh Brunner, Erik D. Demaine, Della Hendrickson, and Jeffery Li, “Tetris Is Hard with Just One Piece Type”, in Proceedings of the 13th International Conference on Fun with Algorithms (FUN 2026), edited by John Iacono, LIPIcs, volume 366, Porquerolles, France, May 18–22, 2026, 32:1–32:22.

BibTeX

@InProceedings{TetrisOnePiece_FUN2026,
  key           = {MIT},
  AUTHOR        = {{MIT Hardness Group} and Josh Brunner and Erik D. Demaine and Della Hendrickson and Jeffery Li},
  TITLE         = {Tetris Is Hard with Just One Piece Type},
  BOOKTITLE     = {Proceedings of the 13th International Conference on Fun with Algorithms (FUN 2026)},
  bookurl       = {https://fun2026.limos.fr/},
  EDITOR        = {John Iacono},
  SERIES        = {LIPIcs},
  VOLUME        = 366,
  ADDRESS       = {Porquerolles, France},
  MONTH         = {May 18--22},
  YEAR          = 2026,
  PAGES         = {32:1--32:22},

  withstudent   = 1,
  length        = {22 pages},
  doi           = {https://dx.doi.org/10.4230/LIPIcs.FUN.2026.32},
  dblp          = {https://dblp.org/rec/conf/fun/GroupBDHL26},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.4230/LIPIcs.FUN.2026.32">LIPIcs</A>.},
}

Comments:

This paper is also available from LIPIcs.

Length:

The paper is 22 pages.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]