A Loopless Generation of Bitstrings without p Consecutive Ones

Vincent Vajnovszki. A Loopless Generation of Bitstrings without p Consecutive Ones. In Cristian S. Calude, Michael J. Dinneen, Silviu Sburlan, editors, Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania. Discrete mathematics and theoretical computer science, pages 227-240, Springer, 2001. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.