Regular ArticleGeneration of Well-Formed Parenthesis Strings in Constant Worst-Case Time
References (9)
- et al.
On rotations and the generation of binary trees
J. Algorithms
(1993) A loopless algorithm for generating binary tree sequences
Inform. Process. Lett.
(1991)- et al.
Efficient generation of the binary reflected Gray code and its applications
Comm. ACM
(1976) Combination generation and graylex ordering, Proceedings of the 18th Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, 1988
Congressus Numerantium
(1989)
There are more references available in the full text version of this article.
Cited by (14)
A minimum-change version of the Chung–Feller theorem for Dyck paths
2018, European Journal of CombinatoricsA minimum-change version of the Chung-Feller theorem for Dyck paths
2017, Electronic Notes in Discrete MathematicsA loop-free two-close Gray-code algorithm for listing k-ary Dyck words
2006, Journal of Discrete AlgorithmsCitation Excerpt :The terms minimal, homogeneous and 2-close will mean the same thing for Dyck words and their generalizations as they do for combinations. A minimal Gray code for Dyck words was published by Ruskey and A. Proskurowski [16]; a non-recursive description and a loop-free implementation of this Gray code appears in [20]. A homogeneous Gray code for Dyck words was discovered by B. Bultena and Ruskey [2].
A Loopless Gray-Code Algorithm for Listing k-ary Trees
2000, Journal of AlgorithmsGreedy Gray Codes for Dyck Words and Ballot Sequences
2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Combinatorial Gray codes-an updated survey
2022, arXiv
Copyright © 1998 Academic Press. All rights reserved.