An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243): Difference between revisions

@@ Property / OpenAlex ID @@
+W2622212042
@@ Property / OpenAlex ID: W2622212042 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01106
@@ Property / arXiv ID: 1706.01106 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
+Normal rank
@@ Property / cites work @@
+Free differential calculus. IV: The quotient groups of the lower central series
+Normal rank
@@ Property / cites work @@
+Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
+Normal rank
@@ Property / cites work @@
+Factorizing words over an ordered alphabet
@@ Property / cites work: Factorizing words over an ordered alphabet / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for constructing m-ary de Bruijn sequences
+Normal rank
@@ Property / cites work @@
+Generation of the Ford sequence of length \(2^ n\), n large
+Normal rank
@@ Property / cites work @@
+Lexicographic compositions and de Bruijn sequences
+Normal rank
@@ Property / cites work @@
+Necklaces of beads in k colors and k-ary de Bruijn sequences
+Normal rank
@@ Property / cites work @@
+Generating necklaces
@@ Property / cites work: Generating necklaces / rank @@
+Normal rank
@@ Property / cites work @@
+A surprisingly simple de Bruijn sequence construction
+Normal rank
@@ Property / cites work @@
+Q2755077
@@ Property / cites work: Q2755077 / rank @@
+Normal rank