Counting Polycubes without the Dimensionality Curse

DOI10.1007/978-3-540-69733-6_11MaRDI QIDQ3511318zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Counting polycubes without the dimensionality curse
• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• Formulae and growth rates of high-dimensional polycubes
• Counting n-cell polycubes proper in n - k dimensions

Cites work

• A pattern theorem for lattice clusters
• Cell Growth Problems
• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• Counting lattice animals: A parallel attack
• Counting multidimensional polyominoes
• Counting polyominoes: yet another attack
• Enumerations of lattice animals and trees
• Formulae and growth rates of high-dimensional polycubes
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 3341062 (Why is no real title available?)
• scientific article; zbMATH DE number 3397566 (Why is no real title available?)
• The On-Line Encyclopedia of Integer Sequences

Cited in

(12)

• Counting polycubes without the dimensionality curse
• Counting regions with bounded surface area
• Formulae and growth rates of high-dimensional polycubes
• Parallel enumeration of lattice animals
• Enumeration of polycubes and Dirichlet convolutions
• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• DeBruijn counting for visualization algorithms
• History and introduction to polygon models and polyominoes
• Enumeration of specific classes of polycubes
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• A generic method for the enumeration of various classes of directed polycubes
• Counting hypercubes in hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511318)