Hard Tiling Problems with Simple Tiles

This publication has 10 references indexed in Scilit:

• Triangular Trimers on the Triangular Lattice: An Exact Solution
  Physical Review Letters, 1999
• Isohedral Polyomino Tiling of the Plane
  Discrete & Computational Geometry, 1999
• Tiling allowing rotations only
  Theoretical Computer Science, 1999
• Complexity of tile rotation problems
  Theoretical Computer Science, 1997
• Tiling a simply connected figure with bars of length 2 or 3
  Discrete Mathematics, 1996
• Tiling with Bars and Satisfaction of Boolean Formulas
  European Journal of Combinatorics, 1996
• On translating one polyomino to tile the plane
  Discrete & Computational Geometry, 1991
• The monotone and planar circuit value problems are log space complete for P
  ACM SIGACT News, 1977
• Undecidability and nonperiodicity for tilings of the plane
  Inventiones Mathematicae, 1971
• The undecidability of the domino problem
  Memoirs of the American Mathematical Society, 1966