1. Efficient generation of the ideals of a poset in gray code order;Abdo;Information Processing Letters,2009
2. M. Abdo, Efficient generation of the ideals of a poset in gray code order, 2010. Available electronically at: http://www.archipel.uqam.ca/2849/1/D1905.pdf and http://lacim.uqam.ca/publications_pdf/45.pdf.
3. Calculating bounds on reachability and connectedness in stochastic networks;Ball;Networks,1983
4. T. Beyer, F. Ruskey, Constant Average Time Generation of Subtrees of Bounded Size, 1989 (unpublished manuscript).
5. Gray codes for polyominoes and a new class of distributive lattices;Chow;Discrete Mathematics,2009