Sciweavers

41 search results - page 1 / 9
» Tiling layouts with dominoes
Sort
View
CCCG
2004
13 years 8 months ago
Tiling layouts with dominoes
Chris Worman, Mark D. Watson
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
14 years 25 days ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
13 years 7 months ago
2-adic Behavior of Numbers of Domino Tilings
We study the 2-adic behavior of the number of domino tilings of a 2n
Henry Cohn
DGCI
2009
Springer
13 years 10 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
DAC
2004
ACM
14 years 8 months ago
Post-layout logic optimization of domino circuits
Logic duplication, a commonly used synthesis technique to remove trapped inverters in reconvergent paths of Domino circuits, incurs high area and power penalties. In this paper, w...
Aiqun Cao, Cheng-Kok Koh