Pages that link to "Item:Q1203184"
From MaRDI portal
The following pages link to Counting lattice animals: A parallel attack (Q1203184):
Displaying 15 items.
- About two cluster generating algorithms (Q556301) (← links)
- Parallel algorithm for calculation of the exact partition function of a lattice polymer (Q634096) (← links)
- Counting polycubes without the dimensionality curse (Q1043990) (← links)
- Gray codes for column-convex polyominoes and a new class of distributive lattices (Q1044890) (← links)
- A fast cluster counting algorithm for percolation on and off lattices (Q1299578) (← links)
- A direct parallel implementation of the Hoshen-Kopelman algorithm for distributed memory architectures (Q1581150) (← links)
- On the number of hexagonal polyominoes (Q1885027) (← links)
- The impact of large-scale computing on lattice statistics. (Q1963746) (← links)
- On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308) (← links)
- Parallel Enumeration of Lattice Animals (Q3004659) (← links)
- λ > 4 (Q3452770) (← links)
- Counting Polycubes without the Dimensionality Curse (Q3511318) (← links)
- Series expansion of the percolation threshold on hypercubic lattices (Q4629579) (← links)
- ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS (Q5075065) (← links)
- Improved upper bounds on the growth constants of polyominoes and polycubes (Q5970780) (← links)