Efficient universal cycle constructions for weak orders
From MaRDI portal
Recommendations
Cites work
- A framework for constructing de Bruijn sequences via simple successor rules
- A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
- Greedy universal cycle constructions for weak orders
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Lexicographically least circular substrings
- Research problems on Gray codes and universal cycles
- Universal cycles for weak orders
- Universal cycles of classes of restricted words
Cited in
(8)- Universal cycles for weak orders
- Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
- Efficient construction of long orientable sequences
- Constructing k-ary orientable sequences with asymptotically optimal length
- Efficient universal cycle constructions for k-permutations via concatenation trees
- Greedy universal cycle constructions for weak orders
- 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)
This page was built for publication: Efficient universal cycle constructions for weak orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q785821)