λ > 4

DOI10.1007/978-3-662-48350-3_8zbMath1401.05063OpenAlexW4249516386MaRDI QIDQ3452770

Günter Rote, Mira Shalah, Gill Barequet

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_8

zbMATH Keywords

lattice animalspolyominoesgrowth constant

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Certifying algorithms
• Polygons, polyominoes and polycubes
• Counting polyominoes: yet another attack
• Counting lattice animals: A parallel attack
• A pattern theorem for lattice clusters
• On the complexity of Jensen's algorithm for counting fixed polyominoes
• The free energy of a collapsing branched polymer
• Statistics of collapsing lattice animals
• Enumerating 2D percolation series by the finite-lattice method: theory
• Formulae for Polyominoes on Twisted Cylinders
• Cell Growth Problems
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Motzkin numbers

This page was built for publication: λ > 4