Publication:4633912
From MaRDI portal
zbMath1423.05008MaRDI QIDQ4633912
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496877
Related Items
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions, Constructing the first (and coolest) fixed-content universal cycle, Combinatorial Generation via Permutation Languages. V. Acyclic Orientations, The coolest way to generate binary strings, Binary bubble languages and cool-lex order, Generating Gray codes for weak orders in constant amortized time, A universal cycle for strings with fixed-content (which are also known as multiset permutations), Successor rules for flipping pancakes and burnt pancakes, A new universal cycle for permutations, A shift Gray code for fixed-content Łukasiewicz words, Flip-swap languages in binary reflected Gray code order