Counting Polycubes without the Dimensionality Curse

DOI10.1007/978-3-540-69733-6_11zbMath1148.68571OpenAlexW2122582664MaRDI QIDQ3511318

Gadi Aleksandrowicz, Gill Barequet

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_11

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Polyominoes (05B50)

Related Items (2)

History and Introduction to Polygon Models and Polyominoes ⋮ Formulae and Growth Rates of High-Dimensional Polycubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting polyominoes: yet another attack
• Counting lattice animals: A parallel attack
• A pattern theorem for lattice clusters
• The On-Line Encyclopedia of Integer Sequences
• Formulae and Growth Rates of High-Dimensional Polycubes
• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• Counting multidimensional polyominoes
• Cell Growth Problems
• Enumerations of lattice animals and trees

This page was built for publication: Counting Polycubes without the Dimensionality Curse