1. Abdo, M.: Efficient generation of the ideals of a poset in gray code order, part ii. Theor. Comput. Sci. 502, 30–45 (2013), generation of Combinatorial Structures
2. Chang, Y., Garg, V.K.: Quicklex: a fast algorithm for consistent global states enumeration of distributed computations. In: Anceaume, E., Cachin, C., Potop-Butucaru, M.G. (eds.) 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14–17, 2015, Rennes, France. LIPIcs, vol. 46, pp. 25:1–25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
3. Chomicki, J., Ciaccia, P., Meneghetti, N.: Skyline queries, front and back. ACM SIGMOD Rec. 42(3), 6–18 (2013)
4. Habib, M., Medina, R., Nourine, L., Steiner, G.: Efficient algorithms on distributive lattices. Discrete Appl. Math. 110(2), 169–187 (2001)
5. Habib, M., Nourine, L., Steiner, G.: Gray codes for the ideals of interval orders. J. Algorithms 25, 52–66 (1997)