-
1
-
-
33749570839
-
Counting d-dimensional polycubes and nonrectangular planar polyominoes
-
Proc. 12th Ann. Int. Computing and Combinatorics Conf., Taipei, Taiwan, Springer-Verlag full version to appear in Int. J. Comput. Geom. Appl.
-
Aleksandrowicz G., and Barequet G. Counting d-dimensional polycubes and nonrectangular planar polyominoes. Proc. 12th Ann. Int. Computing and Combinatorics Conf., Taipei, Taiwan. Lecture Notes in Computer Science vol. 4112 (2006), Springer-Verlag 418-427 full version to appear in Int. J. Comput. Geom. Appl.
-
(2006)
Lecture Notes in Computer Science
, vol.4112
, pp. 418-427
-
-
Aleksandrowicz, G.1
Barequet, G.2
-
2
-
-
0001194185
-
Reverse search for enumeration
-
Avis D., and Fukuda K. Reverse search for enumeration. Discrete Appl. Math. 65 (1996) 21-46
-
(1996)
Discrete Appl. Math.
, vol.65
, pp. 21-46
-
-
Avis, D.1
Fukuda, K.2
-
3
-
-
77957158262
-
Formulae and growth rates of high-dimensional polycubes
-
in press
-
R. Barequet, G. Barequet, G. Rote, Formulae and growth rates of high-dimensional polycubes, Combinatorica (in press)
-
Combinatorica
-
-
Barequet, R.1
Barequet, G.2
Rote, G.3
-
7
-
-
67349237158
-
-
The on-line encyclopedia of integer sequences. http://www.research.att.com/njas/sequences
-
The on-line encyclopedia of integer sequences. http://www.research.att.com/njas/sequences
-
-
-
-
8
-
-
0343757232
-
The critical dimension for lattice animals
-
Gaunt D.S. The critical dimension for lattice animals. J. Phys. A: Math. Gen. 13 (1980) L97-L101
-
(1980)
J. Phys. A: Math. Gen.
, vol.13
-
-
Gaunt, D.S.1
-
10
-
-
67349093971
-
-
web
-
K. Gong, web page. http://kevingong.com/Polyominoes/Enumeration.html
-
-
-
Gong, K.1
-
11
-
-
0035534202
-
Enumerations of lattice animals and trees
-
Jensen I. Enumerations of lattice animals and trees. J. Statist. Phys. 102 (2001) 865-881
-
(2001)
J. Statist. Phys.
, vol.102
, pp. 865-881
-
-
Jensen, I.1
-
12
-
-
21144443625
-
Counting polyominoes: A parallel implementation for cluster computing
-
Proc. Int. Conf. on Computational Science, Part III, Melbourne, Australia and St. Petersburg, Russia, Springer
-
Jensen I. Counting polyominoes: A parallel implementation for cluster computing. Proc. Int. Conf. on Computational Science, Part III, Melbourne, Australia and St. Petersburg, Russia. Lecture Notes in Computer Science vol. 2659 (2003), Springer 203-212
-
(2003)
Lecture Notes in Computer Science
, vol.2659
, pp. 203-212
-
-
Jensen, I.1
-
13
-
-
0000272507
-
Cell growth problems
-
Klarner D.A. Cell growth problems. Canad. J. Math. 19 (1967) 851-863
-
(1967)
Canad. J. Math.
, vol.19
, pp. 851-863
-
-
Klarner, D.A.1
-
14
-
-
3042597428
-
Counting polyominoes
-
Atkin A.O.L., and Birch B.J. (Eds), Academic Press, London
-
Lunnon W.F. Counting polyominoes. In: Atkin A.O.L., and Birch B.J. (Eds). Computers in Number Theory (1971), Academic Press, London 347-372
-
(1971)
Computers in Number Theory
, pp. 347-372
-
-
Lunnon, W.F.1
-
15
-
-
0011516283
-
Symmetry of cubical and general polyominoes
-
Read R.C. (Ed), Academic Press, New York
-
Lunnon W.F. Symmetry of cubical and general polyominoes. In: Read R.C. (Ed). Graph Theory and Computing (1972), Academic Press, New York 101-108
-
(1972)
Graph Theory and Computing
, pp. 101-108
-
-
Lunnon, W.F.1
-
16
-
-
0016571966
-
Counting multidimensional polyominoes
-
Lunnon W.F. Counting multidimensional polyominoes. Comput. J. 18 (1975) 366-367
-
(1975)
Comput. J.
, vol.18
, pp. 366-367
-
-
Lunnon, W.F.1
-
17
-
-
0011507826
-
A pattern theorem for lattice clusters
-
Madras N. A pattern theorem for lattice clusters. Ann. Combin. 3 (1999) 357-384
-
(1999)
Ann. Combin.
, vol.3
, pp. 357-384
-
-
Madras, N.1
-
18
-
-
0041081483
-
The free energy of a collapsing branched polymer
-
Madras N., Soteros C.E., Whittington S.G., Martin J.L., Skeys M.F., Flesia S., and Gaunt D.S. The free energy of a collapsing branched polymer. J. Phys. A: Math. Gen. 23 (1990) 5327-5350
-
(1990)
J. Phys. A: Math. Gen.
, vol.23
, pp. 5327-5350
-
-
Madras, N.1
Soteros, C.E.2
Whittington, S.G.3
Martin, J.L.4
Skeys, M.F.5
Flesia, S.6
Gaunt, D.S.7
-
19
-
-
0010691759
-
Computer techniques for evaluating lattice constants
-
Domb C., and Green M.S. (Eds), Academic Press, London
-
Martin J.L. Computer techniques for evaluating lattice constants. In: Domb C., and Green M.S. (Eds). Phase Transitions and Critical Phenomena vol. 3 (1974), Academic Press, London 97-112
-
(1974)
Phase Transitions and Critical Phenomena
, vol.3
, pp. 97-112
-
-
Martin, J.L.1
-
20
-
-
0000777690
-
Lattice animals: A fast enumeration algorithm and new perimeter polynomials
-
Mertens S. Lattice animals: A fast enumeration algorithm and new perimeter polynomials. J. Statist. Phys. 58 (1990) 1095-1108
-
(1990)
J. Statist. Phys.
, vol.58
, pp. 1095-1108
-
-
Mertens, S.1
-
21
-
-
0007231394
-
Counting lattice animals: A parallel attack
-
Mertens S., and Lautenbacher M.E. Counting lattice animals: A parallel attack. J. Statist. Phys. 66 (1992) 669-678
-
(1992)
J. Statist. Phys.
, vol.66
, pp. 669-678
-
-
Mertens, S.1
Lautenbacher, M.E.2
-
22
-
-
21844486840
-
1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer
-
Peard P.J., and Gaunt D.S. 1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer. J. Phys. A: Math. Gen. 28 (1995) 6109-6124
-
(1995)
J. Phys. A: Math. Gen.
, vol.28
, pp. 6109-6124
-
-
Peard, P.J.1
Gaunt, D.S.2
-
23
-
-
0000846006
-
Counting polyominoes: Yet another attack
-
Redelmeier D.H. Counting polyominoes: Yet another attack. Discrete Math. 36 (1981) 191-203
-
(1981)
Discrete Math.
, vol.36
, pp. 191-203
-
-
Redelmeier, D.H.1
-
24
-
-
20544473125
-
Two-dimensional cluster-correcting codes
-
Schwartz M., and Etzion T. Two-dimensional cluster-correcting codes. IEEE Trans. Inform. Theory 51 (2005) 2121-2132
-
(2005)
IEEE Trans. Inform. Theory
, vol.51
, pp. 2121-2132
-
-
Schwartz, M.1
Etzion, T.2
|