A loop-free two-close Gray-code algorithm for listing k-ary Dyck words

Efficient generation of the binary reflected gray code and its applications

J. Bitner, Gideon Ehrlich, Edward M. Reingold · Communications of the ACM · 1976 · 236 citations · Full text

Efficient Generation, Engineering, Program Analysis +15

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Gideon Ehrlich · Journal of the ACM · 1973 · 182 citations · Full text

Engineering, Loopless Algorithms, Combinatory Analysis +11

Generating Binary Trees Lexicographically

Frank Ruskey, T. C. Hu · SIAM Journal on Computing · 1977 · 137 citations

Engineering, Computational Complexity, Binary Tree +17

Correspondences between plane trees and binary sequences

David A. Klarner · Journal of Combinatorial Theory · 1970 · 99 citations

Tree Language, Graph Theory, Binary Sequences +3

An algorithm for generating subsets of fixed size with a strong minimal change property

Peter Eades, Brendan D. McKay · Information Processing Letters · 1984 · 69 citations

Mathematical Programming, Engineering, Graph Theory +10