On the complexity of Jensen's algorithm for counting fixed polyominoes-Reference-Cited by-同舟云学术

On the complexity of Jensen's algorithm for counting fixed polyominoes

Published:2007-06 Issue:2 Volume:5 Page:348-355
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Barequet Gill,Moffie Micha

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference25 articles.

1. G. Barequet, M. Moffie, The complexity of Jensen's algorithm for counting polyominoes, in: Proc. 1st Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, January 2004, pp. 161–169

2. G. Barequet, M. Moffie, A. Ribó, G. Rote, Counting polyominoes on twisted cylinders, in: Proc. 3rd European Conf. on Combinatorics, Graph Theory, and Applications, Berlin, Germany, September 2005, pp. 369–374. Full version: Integers, accepted for publication

3. Percolation processes: I. Crystals and mazes;Broadbent;Proceedings of the Cambridge Philosophical Society,1957

4. Enumerating 2D percolation series by the finite-lattice method: Theory;Conway;Journal of Physics, A: Mathematical and General,1995

5. On two-dimensional percolation;Conway;Journal of Physics, A: Mathematical and General,1995

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. λ > 4;Communications of the ACM;2016-06-24

2. λ > 4;Algorithms - ESA 2015;2015

3. On the Enumeration of Permutominoes;Fundamentals of Computation Theory;2015

4. Formulae for Polyominoes on Twisted Cylinders;Language and Automata Theory and Applications;2014

5. Integrative Action of Receptor Mosaics: Relevance of Receptor Topology and Allosteric Modulators;Journal of Receptors and Signal Transduction;2008-01