Greedy Gray codes for Dyck words and ballot sequences
From MaRDI portal
Publication:6591618
DOI10.1007/978-3-031-49193-1_3MaRDI QIDQ6591618
Dennis Pak Shing Wong, Vicentiu Vajnovszki
Publication date: 22 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Eades-McKay algorithm for well-formed parentheses strings
- Analysis of bidirectional ballot sequences and random walks ending in their maximum
- Direct consequences of the basic ballot theorem
- Knights, spies, games and ballot sequences
- Generalized Dyck paths
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
- Constructing MSTD sets using bidirectional ballot sequences
- A bijection on Dyck paths and its consequences
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- A new bijection between ordered trees and legal bracketings
- A bijection between ordered trees and 2-Motzkin paths and its many consequences
- Generating 2-Gray codes for ballot sequences in constant amortized time
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Enumeration via ballot numbers
- Flip-swap languages in binary reflected Gray code order
- The Greedy Gray Code Algorithm
- Generating binary trees by transpositions
- Binary tree gray codes
- Generation of Binary Trees from Ballot Sequences
- Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
- A Survey of Combinatorial Gray Codes
- Generation oft-ary trees with Ballot-sequences*
- A Loopless Gray-Code Algorithm for Listing k-ary Trees
- On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order
- Some Aspects of the Random Sequence
- Combinatorial Gray codes -- an updated survey
This page was built for publication: Greedy Gray codes for Dyck words and ballot sequences
