1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2026
(Un)ranking Permutation Classes
Nathanaël Hassler, Vincent Vajnovszki
Permutations avoiding a pattern of length three are enumerated by the Catalan numbers. In this work, we present methods for ranking and unranking such permutations in lexicographic…
cs.DM2024★ 1 cited
Greedy Gray Codes for some Restricted Classes of Binary Words
Nathanaël Hassler, Vincent Vajnovszki, Dennis Wong
We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalize…